Modeling and application for rolling scheduling problem based on TSP

Fuyong Su, Linglu Kong, Hui Wang and Zhi Wen

Applied Mathematics and Computation, 2021, vol. 407, issue C

Abstract: In the process of steel production, rolling scheduling is a complex problem in hot rolling production. In this paper, according to the hot rolling production process and product constraints of iron and steel enterprises, the problem of rolling plan formulation is attributed to asymmetric traveling salesman problem, and the mathematical model of rolling plan formulation is established.The simulation results show that the model and algorithm are effective and feasible.

Keywords: Rolling plan; Multi-objective optimization; Traveling salesman problem; Ant colony algorithm; Genetic algorithm (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321004227
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:407:y:2021:i:c:s0096300321004227

DOI: 10.1016/j.amc.2021.126333

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().