Skip to main content
Log in

Optimization for vehicle scheduling in iron and steel works based on semi-trailer swap transport

  • Published:
Journal of Central South University of Technology Aims and scope Submit manuscript

Abstract

In order to solve internal logistics problems of iron and steel works, such as low transportation efficiency of vehicles and high transportation cost, the production process and traditional transportation style of iron and steel works were introduced. The internal transport tasks of iron and steel works were grouped based on cluster analysis according to demand time of the transportation. An improved vehicle scheduling model of semi-trailer swap transport among loading nodes and unloading nodes in one task group was set up. The algorithm was designed to solve the vehicle routing problem with simultaneous pick-up and delivery (VRPSPD) problem based on semi-trailer swap transport. A solving program was written by MATLAB software and the method to figure out the optimal path of each grouping was obtained. The dropping and pulling transportation plan of the tractor was designed. And an example of semi-trailer swap transport in iron and steel works was given. The results indicate that semi-trailer swap transport can decrease the numbers of vehicles and drivers by 54.5% and 88.6% respectively compared with decentralized scheduling in iron and steel works, and the total distance traveled reduces by 43.5%. The semi-trailer swap transport can help the iron and steel works develop the production in intension.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. QU Xi-ding, SHI Mei-lun. Theoretical study on the logistics technology in modern iron and steel works [J]. Iron and Steel, 2002, 37(12): 72–75. (in Chinese)

    Google Scholar 

  2. PRINS C. A simple and effective evolutionary algorithm for the vehicle routing problem [J]. Computers and Operations Research, 2004, 31(12): 1985–2002.

    Article  MATH  MathSciNet  Google Scholar 

  3. MIN H. The multiple vehicle route problem with simultaneous delivery and pickup nodes [J]. Transportation Research Part A, 1989, 23(5): 377–386.

    Article  MathSciNet  Google Scholar 

  4. HU Si-ji. Integrated transport engineering [M]. Beijing: Tsinghua University Press, 2005: 10–30. (in Chinese)

    Google Scholar 

  5. LI Ya-ru. Semi-trailer swap transport: An effective way to improve road transport efficiency [J]. Journal of Highway and Transportation Research and Development, 2004, 21(4): 119–122. (in Chinese)

    Google Scholar 

  6. SEMET F. A two-phase algorithm for the partial accessibility constrained vehicle routing problem [J]. Annals of Operations Research, 1995, 61: 45–65.

    Article  MATH  MathSciNet  Google Scholar 

  7. GERDESSEN J C. Vehicle routing problem with trailers [J]. European Journal of Operational Research, 1996, 93(1): 135–147.

    Article  MATH  Google Scholar 

  8. CHAO I M. A tabu search method for the truck and trailer routing problem [J]. Computers and Operations Research, 2002, 29(1): 33–51.

    Article  MATH  Google Scholar 

  9. SCHEUERER S. A tabu search heuristic for the truck and trailer routing problem [J]. Computers and Operations Research, 2006, 33(4): 894–909.

    Article  MATH  Google Scholar 

  10. LIN S W, VINCENT F Y, CHOU S Y. Solving the truck and trailer routing problem based on a simulated annealing heuristic [J]. Computers and Operations Research, 2009, 36(5): 1683–1692.

    Article  MATH  Google Scholar 

  11. GAO Zhen, TANG Li-xin, CHANG Ying-qi, WANG Ding-wei. Survey on logistics research in iron and steel industry [J]. Control and Decision, 2001, 16(1): 12–15. (in Chinese)

    Google Scholar 

  12. DETHLOFF J. Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up [J]. OR Spectrum, 2001, 23(1): 79–96.

    MATH  MathSciNet  Google Scholar 

  13. SALHI S, NAGY G. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries [J]. European Journal of Operational Research, 2005, 162(1): 126–141.

    Article  MATH  Google Scholar 

  14. DETHLOFF J. Relation between vehicle routing problems: An insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls [J]. Journal of the Operational Research Society, 2002, 53(1): 115–118.

    Article  MATH  Google Scholar 

  15. ZACHARIADIS E E, TARABTILIS C D, KIRANOUDIS C T. A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service [J]. Expert Systems with Applications, 2009, 36(2): 1070–1081.

    Article  Google Scholar 

  16. LAI Ming-yong, CAO Er-bao. An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows [J]. Engineering Applications of Artificial Intelligence, 2010, 23(2): 188–195.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yao-rong Cheng  (成耀荣).

Additional information

Foundation item: Project(70671108) supported by the National Natural Science Foundation of China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, Yr., Liang, B. & Zhou, Mh. Optimization for vehicle scheduling in iron and steel works based on semi-trailer swap transport. J. Cent. South Univ. Technol. 17, 873–879 (2010). https://doi.org/10.1007/s11771-010-0570-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-010-0570-9

Key words

Navigation