Hybrid optimization algorithm for solving combining tundish MTSP model on continuous casting plan

作者：Yi Jian^*; Tan Shu Bin; Li Wei Gang; Du Bin

来源：Journal of Northeastern University, 2012, 33(9): 1235-1239.

• Charge plan
• Estimation of distribution algorithms
• Multiple traveling salesman problems
• Neighborhood search
• Tundish

The combining tundish problem on continuous casting plan was described and the multiple traveling salesman problem (MTSP) model was constructed. A hybrid optimization algorithm composed of the heuristic method, the k-opt neighborhood search, and the estimation of distribution algorithms (EDA) was proposed to solve the model. First, a heuristic method was used to determine the counts of dummy furnace which were involved in chromosome code to fix on the code length. Each chromosome presented a scheme of combining tundish and then the probability matrix model of the EDA was designed to optimize chromosome globally. Moreover, the k-opt was used as local search strategy. Unlike genetic algorithm(GA), the EDA had no crossover operator, therefore the illegal code resulted from crossover operator was avoided. Simulation results on the real production data indicated that the proposed algorithm had fairly good performance and utility.

• 出版日期2012
• 单位东北大学