论文信息 - VRP-Based Model and Algorithm for Hot Rolling Lot Planning

VRP-Based Model and Algorithm for Hot Rolling Lot Planning

Abstract According to the process programs of hot rolling strips production in an iron & steel enterprise, a VRP (Vehicle Routing Problem) based model for hot rolling lot planning is presented, an ACO (Ant Colony Optimization) algorithm is designed to solve it. Computational study for practical instances has been made, the hot rolling lot plans obtained with the new model are compared with that made by senior planner through human-machine coordination, results show that the former is more effective and efficient.

Shixin Liu | Mengguang Wang | Jianhai Song

[1] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[2] Gilbert Laporte,et al. The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[3] Richard F. Hartl,et al. An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[4] Jeff R. Wright,et al. Discrete event sequencing as a Traveling Salesman Problem , 1992 .

[5] G. Theraulaz,et al. Inspiration for optimization from social insect behaviour , 2000, Nature.

[6] Lixin Tang,et al. A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex , 2000, Eur. J. Oper. Res..