Graph-Based Model of Cast Planning Problem and Its Optimization
This paper investigates a type of cast planning problem arising in real-life engineering application. The problem is mathematically modeled based on a directed graph. The number of casts is unknown in advance whereas all the charges should be assigned. The problem falls into an extension of the traditional multiple traveling salesman problem (m-TSP). In the extended m-TSP, there are multiple city types, one salesman can visit only one type of cities, and the distances between cities are asymmetric. The objective of the problem is to minimize both the total distance and the number of salesman involved. An improved genetic algorithm is developed to solve the problem and validated by using numerical experiments. The results indicate that the algorithm is relatively fast, stable, and effective.
steelmaking and continuous casting cast planning problem multiple traveling salesman problem graph genetic algorithm
Ruiyou Zhang Kebin Lu Kewei Huang Dingwei Wang
College of Information Science and Engineering, Key Laboratory of Integrated Automation of Process I Institute of Automation, Baosteel Technology Center, Shanghai 201900, China
国际会议
2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)
四川绵阳
英文
1606-1611
2011-05-23（万方平台首次上网日期，不代表论文的发表时间）