Journal of Korean Society of Transportation (대한교통학회지)

Korean Society of Transportation (대한교통학회)
권호 표지

A Hybrid Genetic Algorithm for Vehicle Routing Problem which Considers Traffic Situations and Stochastic Demands

교통상황과 확률적 수요를 고려한 차량경로문제의 Hybrid 유전자 알고리즘

  • Received : 2010.01.29
  • Accepted : 2010.07.28
  • Published : 2010.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

The vehicle travel time between locations in a downtown is greatly influenced by both complex road conditions and traffic situation that changes real time according to various external variables. The customer's demands also stochastically change by time period. Most vehicle routing problems suggest a vehicle route considering travel distance, average vehicle speed, and deterministic demand; however, they do not consider the dynamic external environment, including items such as traffic conditions and stochastic demand. A realistic vehicle routing problem which considers traffic (smooth, delaying, and stagnating) and stochastic demands is suggested in this study. A mathematical programming model and hybrid genetic algorithm are suggested to minimize the total travel time. By comparing the results considering traffic and stochastic demands, the suggested algorithm gives a better solution than existing algorithms.

도심지에서 수요지간의 이동시간은 복잡한 도로사정과 외부환경으로 인하여 실시간 변화하는 교통상황에 큰 영향을 받고 있으며, 수요는 시기나 성향에 따라 확률적으로 변화하고 있다. 대부분의 차량경로문제 연구는 차량경로를 선정함에 있어 수요지간의 이동거리와 평균속력, 확정된 수요를 고려하여 경로를 구성하고 있으며, 교통상황과 확률적인 수요의 동적인 외부환경 반영이 미흡하였다. 본 연구에서는 원활 지체 정체의 교통상황과 확률적인 수요를 고려한 현실적인 차량경로문제를 제안하였다. 수리모형을 구축하고, CPLEX 11.1을 이용하여 검증하였으며, 총 소요시간을 최소화하는 Hybrid 유전자 알고리즘을 제안하였다. 교통상황과 확률적 수요를 고려한 차량경로문제의 결과를 기존의 휴리스틱 알고리즘과 비교하였으며, 본 연구에서 제안한 알고리즘이 가장 우수한 해를 제공하였다.

Keywords

References

  1. 김기태.전건욱(2009), "서비스 시간대별 교통상황을 고려한 차량경로문제", 산업공학(IE Interfaces)지, 제22권, pp.358-366.
  2. 문기주.양승만(2004), "3구간 종속 가변속도 하에서 배송차량의 최적운영 방안에 관한 연구", 대한설비관리학회지, 제9권, pp.145-154.
  3. Bertsimas, D. J.(1992), "A Vehicle Routing Problem with Stochastic Demand", Operations Research, Vol.40, pp.574-585. https://doi.org/10.1287/opre.40.3.574
  4. Clark, G. and J. W. Wright(1964), "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points", Operations Research, Vol.12, pp.568-581. https://doi.org/10.1287/opre.12.4.568
  5. Dantzig, G. B. and J. H. Ramser(1959), "The Truck Dispatching Problem", Management Science, Vol.6, pp.80-91. https://doi.org/10.1287/mnsc.6.1.80
  6. Gendreau, M., A. Hertz and G. Laporte(1992), "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem", Operations Research, Vol.60, pp.1086-1094.
  7. Goldberg, D. and R. Lingle(1985), "Alleles, Loci, and The Traveling Salesman Problem", Proceedings of the First International Conference on Genetic Algorithms and their applications, pp.154-159.
  8. Haughton, M. A.(1998), "The Performance of Route Modification and Demand Stabilization Strategies in Stochastic Vehicle Routing", Transportation Research, Vol.32, pp.551-566. https://doi.org/10.1016/S0191-2615(98)00017-4
  9. Haughton, M. A. and A. J. Stenger(1999), "Comparing Strategies for Addressing Delivery Shortages in Stochastic Demand Settings", Transportation Research, Vol.35, pp.25-41. https://doi.org/10.1016/S1366-5545(98)00021-0
  10. Hill, V. and W. C. Benton(1992), "Modeling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems", Journal of Operational Research Society, Vol.43, pp.343-351. https://doi.org/10.1057/jors.1992.49
  11. Laporte, G.(1992), "The Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms", European Journal of Operational Research, Vol.59, pp.345-358. https://doi.org/10.1016/0377-2217(92)90192-C
  12. Laporte, G., F. V. Louveaux and L. Van Hamme(2002), "An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands", Operations Research, Vol.50, pp.415-423. https://doi.org/10.1287/opre.50.3.415.7751
  13. Malandraki, C. and M. S. Daskin(1992), "Time Dependent Vehicle Routing Problems: Formulation, Properties and Heuristic Algorithms", Transportation Science, Vol.26, pp.185-200. https://doi.org/10.1287/trsc.26.3.185
  14. Reimann, M.(2005), "Analyzing a Vehicle Routing Problem with Stochastic Demands Using Ant Colony Optimization", Advanced OR and AI Methods in Transportation, Poznan Technical University Publishers, pp.764-769.
  15. Solomon M. M.(1987), "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints", Operations Research, Vol.35, pp.254-265. https://doi.org/10.1287/opre.35.2.254
  16. Stewart, W. R. and B. L. Golden(1983), "Stochastic Vehicle Routing: A Comprehensive Approach", European Journal of Operational Research, Vol.14, pp.371-385. https://doi.org/10.1016/0377-2217(83)90237-0
  17. Tillman, F. A.(1969), "The Multiple Terminal Del-very Problem with Probabilistic Demands", Transportation Science, Vol.3, pp.192-204. https://doi.org/10.1287/trsc.3.3.192