Algorithm Research On Casing Assembling Optimization Problem

Based on the existing approximation algorithm for solving casing assembly optimization model, we do further research on the algorithm in this paper. First of all, according to the characteristics of the model, we analyze the advantages and disadvantages of the approximate algorithm. Secondly, we analyze the math-ematical background of the algorithm from the perspective of the optimal base and preprocessing. Based on that, we put forward the strategy of extracting the columns of the constraint matrix dispersedly and the numerical examples to illustrate the advantage of this strategy. Then, applying the idea of nonlinear programming method, the new local search algorithm for solving casing assembly optimization model is proposed and we also give numerical examples using the new algorithm. Finally, we generalize local search algorithm, and put forward a new model considering the economic effect and solve it using generalized local search algorithm.