Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

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

Ant Colony System for Vehicle Routing Problem with Simultaneous Delivery and Pick-up under Time Windows

시간제약하 배달과 수거를 동시에 수행하는 차량경로문제를 위한 개미군집시스템

  • Lee, Sang-Heon (Department of Operations Research, Korea National Defense University) ;
  • Kim, Yong-Dae (Department of Operations Research, Korea National Defense University)
  • 이상헌 (국방대학교 운영분석학과) ;
  • 김용대 (국방대학교 운영분석학과)
  • Received : 20080000
  • Accepted : 20080000
  • Published : 2009.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper studies a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up under time windows(VRPSDP-TW). The objective of this paper is to minimize the total travel distance of routes that satisfy both the delivery and pick-up demand. We propose a heuristic algorithm for solving the VRPSDP-TW, based on the ant colony system(ACS). In route construction, an insertion algorithm based ACS is applied and the interim solution is improved by local search. Through iterative processes, the heuristic algorithm drives the best solution. Experiments are implemented to evaluate a performance of the algorithm on some test instances from literature.

Keywords

References

  1. Bianchessi, N. and Righini, G. (2007), Heuristic Algorithms for the Vehicle Routing Problem with Simultaneous Pick-up and Delivery, Computer and Operational Research, 34(2), 578-594 https://doi.org/10.1016/j.cor.2005.03.014
  2. Chung, E. Y. and Park, Y. B. (2004), A Genetic Algorithm for Vehicle Routing Problems with Mixed Delivery and Pick-up, Journal of the Korean Institute of Industrial Engineers, 30(4), 346-354
  3. Crispim, J. and Brandao, J. (2005), Metaheuristics Applied to Mixed and Simultaneous Extensions of Vehicle Routing Problems with Backhauls, Journal of the Operational Research Society, 56, 1296-1302 https://doi.org/10.1057/palgrave.jors.2601935
  4. Dantzig, G. B. and Ramser, J. H. (1959), The Truck Dispatching Problem, Management Science, 6, 80-91 https://doi.org/10.1287/mnsc.6.1.80
  5. Dethloff, J. (2001), Vehicle Routing and Reverse Logistics : the Vehicle Routing Problem with Simultaneous Delivery and Pick-up, OR Spectrum, 23, 79-96
  6. Dorigo, M. and Di Caro, G. (1999), The Ant Colony Optimization Metaheuristic, New Ideas in Optimization, McGraw-Hill, New York
  7. Lee, D. H., Kim, H. J. and Kim, J. S. (2008), Reverse Logistics : Research Issues and Literature Review, Journal of the Korean Institute of Industrial Engineers, 34(3), 270-288
  8. Min, H. (1989), The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pick-up Points, Transportation Research A, 23, 377-386 https://doi.org/10.1016/0191-2607(89)90085-X
  9. Park, G. J. (2008), A Vehicle Routing Problem to Minimize the Transportation Cost with Simultaneous Delivery and Pick-up, Korea National Defense University, Master Thesis, 42-45
  10. Pisinger, D. and Ropke, S. (2007), A General Heuristic for Vehicle Routing Problems, Computer and Operational Research, 34(8), 2403-2435 https://doi.org/10.1016/j.cor.2005.09.012
  11. Solomon, M. M. (1987), Algorithm for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, 35, 254-265 https://doi.org/10.1287/opre.35.2.254
  12. Tang, F. A. and Galvao, R. D. (2006), A Tabu Search Algorithm for the Vehicle Routing Problems with Simultaneous Pick-up and Delivery Service, Computer and Operational Research, 33, 595-619 https://doi.org/10.1016/j.cor.2004.07.009
  13. Zhang, T. and Tian, W-X. and Zhang Y-E. (2007), RLC_ACS：An Improved Ant Colony Algorithm for VRPSDP, Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, 978-983