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

  • Yao-rong Cheng (成耀荣)
  • Bo Liang (梁波)
  • Mei-hua Zhou (周美花)
Article

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.

Key words

transportation semi-trailer swap transportation cluster analysis vehicle scheduling iron and steel works 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    PRINS C. A simple and effective evolutionary algorithm for the vehicle routing problem [J]. Computers and Operations Research, 2004, 31(12): 1985–2002.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    MIN H. The multiple vehicle route problem with simultaneous delivery and pickup nodes [J]. Transportation Research Part A, 1989, 23(5): 377–386.CrossRefMathSciNetGoogle Scholar
  4. [4]
    HU Si-ji. Integrated transport engineering [M]. Beijing: Tsinghua University Press, 2005: 10–30. (in Chinese)Google Scholar
  5. [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. [6]
    SEMET F. A two-phase algorithm for the partial accessibility constrained vehicle routing problem [J]. Annals of Operations Research, 1995, 61: 45–65.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    GERDESSEN J C. Vehicle routing problem with trailers [J]. European Journal of Operational Research, 1996, 93(1): 135–147.MATHCrossRefGoogle Scholar
  8. [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.MATHCrossRefGoogle Scholar
  9. [9]
    SCHEUERER S. A tabu search heuristic for the truck and trailer routing problem [J]. Computers and Operations Research, 2006, 33(4): 894–909.MATHCrossRefGoogle Scholar
  10. [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.MATHCrossRefGoogle Scholar
  11. [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. [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.MATHMathSciNetGoogle Scholar
  13. [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.MATHCrossRefGoogle Scholar
  14. [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.MATHCrossRefGoogle Scholar
  15. [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.CrossRefGoogle Scholar
  16. [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.CrossRefGoogle Scholar

Copyright information

© Central South University Press and Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yao-rong Cheng (成耀荣)
    • 1
  • Bo Liang (梁波)
    • 1
  • Mei-hua Zhou (周美花)
    • 1
  1. 1.School of Traffic and Transport EngineeringCentral South UniversityChangshaChina

Personalised recommendations