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

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

A Genetic Algorithm for Vehicle Routing Problems with Mixed Delivery and Pick-up

배달과 수거가 혼합된 차량경로 결정문제를 위한 유전 알고리듬의 개발

  • Chung, Eun-Yong (Department of Distribution and Information, Dong Hae University) ;
  • Park, Yang-Byung (Department of Industrial Engineering, College of Advanced Technology, Kyung Hee University)
  • 정은용 (동해대학교 유통정보학과) ;
  • 박양병 (경희대학교 테크노공학대학 기계.산업시스템공학부)
  • Published : 2004.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Most industrial logistic systems have focused on carrying products from manufacturers or distribution centers to customers. In recent years, they are faced with the problem of integrating reverse flows into their transportation systems. In this paper, we address the vehicle routing problems with mixed delivery and pick-up(VRPMDP). Mixed operation of delivery and pick-up during a vehicle tour requires rearrangement of the goods on board. The VRPMDP considers the reshuffling time of goods at customers, hard time windows, and split operation of delivery and pick-up. We construct a mixed integer mathematical model and propose a new genetic algorithm named GAMP for VRPMDP. Computational experiments on various types of test problems are performed to evaluate GAMP against the modified Dethloff's algorithm. The results show that GAMP reduces the total vehicle operation time by 5.9% on average, but takes about six times longer computation time.

Keywords

References

  1. Clarke, G. and Wright, J. (1964), Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, 12, 568-581
  2. Dethloff, J. (2001), Vehicle Routing and Reverse Logistics: The Vehicle Routing Problem with Simultaneous Delivery and Pick-up, OR Spectrum, 23, 79-96
  3. Gen, M. and Cheng, R. (1997), Genetic Algorithms and Engineering Design, John Wiley & Sons, Inc
  4. Goldberg, D.E. (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Pub. Com, Inc
  5. Golden, B. L., Baker, E., Alfaro, J., and Schaffer, J. (1985), The Vehicle Routing Problem with Backhauling: Two Approaches. In R. Hammesfahr, editor, Proceedings of the XXI Annual Meeting of S.E. TIMS, Myrtle Beach, SC, 90-92
  6. Holland, J.H. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press. Ann Arbor
  7. LOG CPLEX 7.5 User's Manual (2001), ILOG, Inc., France
  8. Kim, H. S., Han, D. H. and Lee, I. C. (2001), A Case Study of the Reverse Logistics Considering an Environment, Journal of Society of Korea Industrial and Systems Engineering, 24(66), 69-77
  9. Min, H. (1989), The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pick-up Points, Transportation Research Part A, 23A (5), 377-386
  10. Moon, B. R. (2003), Genetic Algorithm, Doo-Yang Sa
  11. Potvin, J. Y. and Bengio, S. (1996), TheVehicle Routing Problem with Time Windows, Part II: Genetic Search, INFORMS Journal on Computing, 8, 165-I72
  12. Potvin, J. Y., Duhamel, C., and Guertin, F. (1996), A Genetic Algorithm for Vehicle Routing with Backhauling, Applied Intelligence, 6, 345-355
  13. Reimann, M., Doerner, K., and Hartl, R. F. (2002), Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows: Ant Algorithms, Dorigo et al. (Eds.), Springer LNCS 2463, Berlin/Heidelberg, 135-148
  14. Salhi, S. and Nagy G. (1999), ACluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauls, Journal of the Operational Research Society, 50, 1034-1042
  15. Sural, H. and Book binder, J.H. (2003), The Single-vehicle Routing Problem with Unrestricted Backhauls, Networks, 41(3), 127-136 https://doi.org/10.1002/net.10067
  16. Toth, P. and Vigo, D. (1997), An Exact Algorithm for the Vehicle Routing Problem with Backhauls, Transportation Science, 31 (4),372-385 https://doi.org/10.1287/trsc.31.4.372
  17. Wade, A. C. and Salhi, S.(2002), An Investigation into a New Class of Vehicle Routing Problem with Backhauls, Omega, 30, 479-487
  18. Zhong, Y. and Cole, M. H. (2001), A Simple Approach to Linehaul-backhaul Problems: A Guided Local Search Approach for the Vehicle Routing Problem, MBTC-1102, Mack-Blackwell Transportation Center, University of Arkansas, Fayetteville