Abstract
The integrated charge batching and casting start time determining (ICBCSD) problem is studied in this paper. ICBCSD is a combinatorial optimization problem extracted from the production and operations management of steel plants. A hierarchical optimization method based on variable neighborhood search (VNS) is proposed to solve ICBCSD. The number of casts on each continuous caster and the number of charges in each cast are determined in the encoding. The decoding process is decomposed into solving two sub-problems. A mixed integer programming (MIP) model is built for the first sub-problem by considering it as a prize collecting multiple traveling salesmen problem, and a VNS algorithm is proposed for solving the model. In addition, a MIP model is built for the second sub-problem, and the model is solved by CPLEX directly. Experimental results on practical production data demonstrate that the proposed algorithm is effective for solving ICBCSD.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
