Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

Vehicle Routing Problems with Time Window Constraints by Using Genetic Algorithm

유전자 알고리즘을 이용한 시간제약 차량경로문제

  • Jeon, Geon-Wook (Department of Operations Research, Korea National Defense University) ;
  • Lee, Yoon-Hee (LBC, The 1st Air-Borne Special Forces Brigade)
  • Published : 2006.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

The main objective of this study is to find out the shortest path of the vehicle routing problem with time window constraints by using both genetic algorithm and heuristic. Hard time constraints were considered to the vehicle routing problem in this suggested algorithm. Four different heuristic rules, modification process for initial and infeasible solution, 2-opt process, and lag exchange process, were applied to the genetic algorithm in order to both minimize the total distance and improve the loading rate at the same time. This genetic algorithm is compared with the results of existing problems suggested by Solomon. We found better solutions concerning vehicle loading rate and number of vehicles in R-type Solomon's examples R103 and R106.

Keywords

References

  1. Berger, J., Salois, M., and Begin, R.; 'A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows,' Lecture Notes in Artificial Intelligence,AI'98,Advances in Artificial Intelligence : 114-127,1998
  2. Blanton,J. L. and Wainwright,R. L.; 'Multiple Vehicle Routing with Time and Capacity Constraints using Genetic Algorithms,' Proc. 5th Int. Con. on Genetic Algorithms: 452-459,1993
  3. Braysy, O. and Gendreau, M., Metaheuristics for the Vehicle Routing Problem with Time Windows,SINTEF REPORT,SINTEF Applied Mathematics,Research Council of Norway,2001
  4. Danzig,G. B. and Ramser, J. H.; 'The Truck Dispatching Problem,' Management Science,6 : 80-91,1959 https://doi.org/10.1287/mnsc.6.1.80
  5. Gehring, H. and Hornberger, J.; 'Paralle1ization of a Two-Phase Metaheuristic for Routing Problems with Time Windows,' Asia-Pacific Journal of Operational Research 57-64,2001
  6. Jung,Y. M. and Min,K. R.; 'A Vehicle Routing Problem using Heuristic,' Journal of Military Operations Research Society of Korea, 26(1) : 47-55, 2000
  7. Kang,K. H. and Lee,Y. H.; 'Heuristic for Vehicle Routing Problem to Minimize total delivery waiting time,' Con. on KIIE and KORMS : 687-690,2001
  8. Kim,Y. K.,Yoon,B. S.,and Lee,S. B.; Meta Heuristic, Yeongji Moonhwasa,Seoul,Korea, 2000
  9. Or,I.; Traveling Salesman-Type Combinational Problems and their Relation to the Logistics if Regional Blood Banking,Ph.D. Dissertation,Northwestern University,1976
  10. Osman,I. H.; 'Metastrategy Simulated Annealing and Tabu Search Algorithm for the Vehicle Routing Problem,' Annals of Operation Research,41 : 421-451,1993 https://doi.org/10.1007/BF02023004
  11. Potvin,J. Y. and Rousseau,J. M.; 'An Exchange Heuristic for Routing Problems with Time Windows,' Journal of the Operational Research Society,46 1433-1446,1995 https://doi.org/10.1057/jors.1995.204
  12. Potvin,J. Y.; 'The Vehicle Routing Problem with Time Window Part II Genetic Search,' Informs Journal of Computing,8 : 165-172,1996 https://doi.org/10.1287/ijoc.8.2.165
  13. Solomon,M. M.; 'Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints,' Operations Research,35 : 254-265, 1987 https://doi.org/10.1287/opre.35.2.254
  14. Sule,D. R.,Industrial Scheduling,Louisiana Tech. University,1996
  15. Tan,K. C.,Lee. L. H.,and Ou. K.; 'Hybrid Genetic Algorithms in Solving Vehicle Routing Problems with Time Window Constraints,' Asia-Pacific Journal of Operational Research,18 121-130,2001
  16. Thangiah, S.; 'Vehicle Routing with Time Windows Using Genetic Algorithms,' In Application Handbook of Genetic Algorithms: New Frontiers,2 : 253-277,1995
  17. http://neo.lcc.uma.es/radi-aeb/WebVRP/