DocumentCode
3313600
Title
An Ant Colony Algorithm for the Order Planning of the Iron-Steel Plant
Author
Zhang, Tao ; Zhang, Yue-jie ; Chen, Yu
Author_Institution
Sch. of Inf. Manage. & Eng., Shanghai Univ. of Finance & Econ., Shanghai
Volume
7
fYear
2008
fDate
18-20 Oct. 2008
Firstpage
485
Lastpage
489
Abstract
Based on the management goals of order planning of the iron-steel plants, a mixed integer programming model for the order planning is constructed. The goals include balancing production capacity and minimizing the total cost of infringing contracts. As the data of orders and processes are put together to make a point graph, the problem of order planning is transferred into an improved traveling salesman problem. An improved ant colony algorithm is presented to solve this model. The computational results show that the model comes up to the production processes, the satisfying solutions can be obtained within acceptable time.
Keywords
capacity planning (manufacturing); integer programming; order processing; steel industry; travelling salesman problems; ant colony algorithm; iron-steel plant; mixed integer programming; order planning; production capacity; production process; total cost minimization; traveling salesman problem; Capacity planning; Contracts; Cost function; Information management; Linear programming; Mathematical model; Process planning; Production planning; Productivity; Traveling salesman problems; ant colony algorithm; iron-steel plant; mixed integer programming; order planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation, 2008. ICNC '08. Fourth International Conference on
Conference_Location
Jinan
Print_ISBN
978-0-7695-3304-9
Type
conf
DOI
10.1109/ICNC.2008.163
Filename
4668025
Link To Document