IE interfaces (산업공학)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

Simulated Annealing Based Vehicle Routing Planning for Freight Container Transportation

화물컨테이너 운송을 위한 시뮬레이티드 어닐링 기반의 차량경로계획

  • Lee, Sang-Heon (Department of Operations Research, Korea National Defense University) ;
  • Choi, Hae-Jung (Department of Operations Research, Korea National Defense University)
  • 이상헌 (국방대학교 운영분석학과) ;
  • 최해정 (국방대학교 운영분석학과)
  • Received : 20061200
  • Accepted : 20070300
  • Published : 2007.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper addresses vehicle routing planning in freight container transportation systems where a number of loaded containers are to be delivered to their destination places. The system under consideration is static in that all transportation requirements are predetermined at the beginning of a planning horizon. A two-phased procedure is presented for freight container transportation. In the first phase, the optimal model is presented to determine optimal total time to perform given transportation requirements and the minimum of number of vehicles required. Based on the results from the optimal model, in the second phase, ASA(Accelerated Simulated Annealing) algorithm is presented to perform all transportation requirements with the least number of vehicles by improving initial vehicle routing planning constructed by greedy method. It is found that ASA algorithm has an excellent global searching ability through various experiments in comparison with existing methods.

Keywords

References

  1. Bodin, L. D., Golden, B. L., Assad A. A., and Ball, M. O. (1983), Routing and Scheduling of Vehicles and Crews: The State of the Art, Computers and Operation Research, 10(2), 63-211 https://doi.org/10.1016/0305-0548(83)90030-8
  2. Christofides, N. and Eilon, S. (1969), An Algorithm for the Vehicle Dispatching Problems, Operations Research Quarterly, 20, 309-318 https://doi.org/10.1057/jors.1969.75
  3. Cordeau, J. F. and Laporte, G. (2003), The Dial-a-ride Problem: Variants, Modeling Issues and Algorithm, Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1, 89-101
  4. Crainic, T. G., Grendreau, M., and Dejax, P. J. (1993), Dynamic and Stochastic Models for the Allocation of Empty Containers, Operations Research, 41(1), 102-126 https://doi.org/10.1287/opre.41.1.102
  5. Danzig, G. B. and Ramser, J. H. (1959), The Truck Dispatching Problem, Management Science, 6, 80-91
  6. Du, Y. and Hall, R. (1997), Fleet Sizing and Empty Equipment Redistribution for Center-Terminal Transportation Networks, Management Science, 43(2), 145-157 https://doi.org/10.1287/mnsc.43.2.145
  7. Kim, D. J., Lee, C. H., and Kim, B. S. (1997), Truck Dispatching Decision Support System for the Container Transportation Problem, Journal of Korean Institute of Industrial Engineering, 23(2), 275-288
  8. Kirkpattick, S., Gelatt, Jr., and Vecchi, M. P. (1983), Optimization by Simulated Annealing, Science, 220, 671-680 https://doi.org/10.1126/science.220.4598.671
  9. Ko, C. S., Chung, K. H., and Shin, J. Y. (2004), Aggregate Container Transportation Planning in the Presence of Dynamic Demand and Three Types of Vehicles, IE Interfaces, 17(1), 71-77
  10. Ko, C. S., Chung, K. H., and Shin, J. Y. (2000), Determination of Vehicle Fleet Size for Container Shuttle Service, Korean Management Science Review, 17(2), 87-95
  11. Ko, C. S., Chung, K. H., Shin, J. Y., Kim, K. B., Yang, C. S., and Park, S. C. (2002), Determination of Vehicle Fleet Size for Container Transportation Service in a Stochastic Work Environment, Journal of the Korean Production and Operations Management Society, 12(3), 17-32
  12. Koo, P. H. and Jang, J. (2002), Vehicle Travel Time Models for AGV Systems under Various Dispatching Rules, International Journal of Flexible Manufacturing Systems, 14, 249-261 https://doi.org/10.1023/A:1015831711304
  13. Koo, P. H. and Suh, J. D. (2002), Fleet Sizing under Dynamic Vehicle Dispatching, Journal of Korean Institute of Industrial Engineering, 28(3), 256-263
  14. Koo, P. H., Jang, D. W., and Lee, W. S. (2003), Fleet Sizing and Vehicle Routing for Static Freight Container Transportation, IE Interfaces, 16(2), 174-184
  15. Kozan, E. and Preston, P. (1999), Genetic Algorithms to Schedule Container Transfers at Multimodal terminals, International Transactions in Operational Research, 6, 311-329 https://doi.org/10.1111/j.1475-3995.1999.tb00158.x
  16. Lehmann, M., Grunow, M., and Gunther, H. O. (2002), Dispatching Multi-Load AGVs in an Highly Automated Container Port Environment, Proceedings of the Fourth APIEMS, Taipei, Taiwan
  17. Lin, S. and Kernighan, B. W. (1973), An Effective Heuristic Algorithm for the Traveling Salesman Problem, Oper. Res, 21, 498-516 https://doi.org/10.1287/opre.21.2.498
  18. Maxwell, W. L. and Muckstadt, J. A. (1981), Design of Automated Guided Vehicle Systems, IIE Transactions, 14(2), 114-124
  19. Osman, I. H. (1993), Meta-strategy Simulated Annealing and Tabu Search Algorithm for the Vehicle Routing Problem, Annals of Operation Research, 41, 421-451 https://doi.org/10.1007/BF02023004
  20. Savelsbergh, M. W. P. and Sol, M. (1995), The General Pickup and Delivery Problem, Transportation Science, 29, 17-29 https://doi.org/10.1287/trsc.29.1.17
  21. Yun, W. Y., Ahn, C. G., and Choi, Y. S. (1999), A Truck Dispatching Problem in the Inland Container Transportation with Empty Container, Journal of the Korean Operations Research and Management Science Society, 24(4), 63-80
  22. Yun, W. Y. and Choi, Y. S. (1997), Development of an Object-Oriented Simulation Model for the Operation Evaluation of the Off-Dock Container Yard, the Korea Society for Simulation, 6(1), 109-122