Skip to main content

Advertisement

SpringerLink
Log in

A decomposition-based hierarchical optimization algorithm for hot rolling batch scheduling problem

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, the hot rolling batch scheduling problem is formulated as a multi-objective vehicle routing problem with double time windows model, in which the first time window deals with the surface grade constraint and the second one is for the linkage modes. In view of the complexity of the proposed model and the priority of considered objectives in practical production, a decomposition-based hierarchical optimization algorithm is proposed to solve the model. Firstly, the model is decomposed into two sub-problems: vehicle routing problem with time windows (VRPTW) and single vehicle routing problem with time windows (SVRPTW). Secondly, MACS-VRPTW is used to optimize the VRPTW sub-problem, in which the first objective is prior to the second one. Then, dynamic programming and genetic algorithm are used to optimize the SVRPTW sub-problem so as to reach a higher hot charge temperature. Experimental results based on the practical production instances have indicated that the proposed model and algorithm are effective and efficient.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Tang LX, Liu JY, Rong AY, Yang ZH (2001) A review of planning and scheduling systems and methods for integrated steel production. Eur J Oper Res 133:1–20

    Article  MATH  Google Scholar 

  2. Kosiba ED, Wright JR, Cobbs AE (1992) Discrete event sequencing as a traveling salesman problem. Comput Ind 19:317–327

    Article  Google Scholar 

  3. Cowling P (1995) Optimization in steel hot rolling. In: Optimization in industry, vol 3. Wiley, Chichester, pp 55–66

    Google Scholar 

  4. Lopez L, Carter MW, Gendreau M (1998) The hot strip mill production scheduling problem: a tabu search approach. Eur J Oper Res 106:317–335

    Article  MATH  Google Scholar 

  5. Chen X, Wan WS, Xu XH (1998) Modeling rolling batch planning as vehicle routing problem with time windows. Comput Oper Res 25(12):1127–1136

    Article  MATH  Google Scholar 

  6. Tang LX, Liu JY, Rong AY, Yang ZH (2000) Multiple travelling salesman problem model for hot scheduling in Shanghai Baoshan Iron & Steel Complex. Eur J Oper Res 124:267–282

    Article  MATH  Google Scholar 

  7. Cowling P (2003) A flexible decision support system for steel hot rolling mill scheduling. Comput Ind Eng 45(2):307–321

    Article  Google Scholar 

  8. Tang LX, Wang XP (2006) Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem. Int J Adv Manuf Technol 29:1246–1258

    Article  Google Scholar 

  9. Wang XP, Tang LX (2008) Integration of batching and scheduling for hot rolling production in the steel industry. Int J Adv Manuf Technol 36:431–441

    Article  Google Scholar 

  10. Chen AL, Yang GK, Wu ZM (2008) Production scheduling optimization algorithm for the hot rolling processes. Int J Prod Res 46(7):1955–1973

    Article  MATH  Google Scholar 

  11. Chen YW, Lu YZ, Yang GK (2008) Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling. Int J Adv Manuf Technol 36:959–968

    Article  Google Scholar 

  12. Yadollahpour MR, Bijari M, Kavosh S, Mahnam M (2009) Guided local search algorithm for hot strip mill scheduling problem with considering hot charge rolling. Int J Adv Manuf Technol 45:1215–1231

    Article  Google Scholar 

  13. Zhao J, Wang W, Liu QL, Wang ZG, Shi P (2009) A two-stage scheduling method for hot rolling and its application. Con Eng Prac 17:629–641

    Article  Google Scholar 

  14. Pan CC, Yang GK (2009) A method of solving a large-scale rolling batch scheduling problem in steel production using a variant of column generation. Comput Ind Eng 56:165–178

    Article  Google Scholar 

  15. Liu SX (2010) Model and algorithm for hot rolling batch planning in steel plants. Int J Infor 21:247–263

    MATH  Google Scholar 

  16. Solomon MM (1987) Algorithm for the vehicle routing and scheduling problem with time window constraints. Oper Res 35(2):254–265

    Article  MathSciNet  MATH  Google Scholar 

  17. Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transport Sci 39(1):104–118

    Article  Google Scholar 

  18. Bräysy O, Gendreau M (2005) Vehicle routing problem with time windows, part II: metaheuristics. Transport Sci 39(1):119–139

    Article  Google Scholar 

  19. Gambardella LM, Taillard E, Agazzi G (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, UK, pp 63–76

    Google Scholar 

  20. Taillard ÉD, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transport Sci 31(2):170–186

    Article  MATH  Google Scholar 

  21. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison Wesley, Reading

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Automation, Shanghai Jiao Tong University, Shanghai, China

    Shujin Jia, Genke Yang & Bin Du

  2. Key Laboratory of System Control and Information Processing, Ministry of Education of China, Shanghai, China

    Shujin Jia, Genke Yang & Bin Du

  3. School of Information Science and Engineering, Northeastern University, Shenyang, China

    Jun Zhu & Jian Yi

  4. Research Institute of Automation, Academy of Baoshan Iron & Steel Co., Ltd., Shanghai, China

    Jun Zhu, Jian Yi & Bin Du

Authors
  1. Shujin Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Genke Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jian Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bin Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shujin Jia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jia, S., Zhu, J., Yang, G. et al. A decomposition-based hierarchical optimization algorithm for hot rolling batch scheduling problem. Int J Adv Manuf Technol 61, 487–501 (2012). https://doi.org/10.1007/s00170-011-3749-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3749-9

Keywords

Search

Navigation