Journal of the Korea Academia-Industrial cooperation Society (한국산학기술학회논문지)

The Korea Academia-Industrial cooperation Society (한국산학기술학회)
권호 표지
DOI QR코드

DOI QR Code

Heuristic Model for Vehicle Routing Problem with Time Constrained Based on Genetic Algorithm

유전자알고리즘에 의한 시간제한을 가지는 차량경로모델

  • Lee, Sang-Cheol (Department of Business Administration, Tongmyong University) ;
  • Yu, Jeong-Cheol (Dept. of Management Information, Kyungnam College of Information & Technology)
  • Published : 2008.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

A vehicle routing problem with time constraint is one of the important problems in distribution and transportation. The service of a customer must start and finish within a given time interval. Our method is based on an improved operators of genetic algorithm and the objective is to minimize the cost of servicing the set of customers without being tardy or exceeding the capacity or travel time of the vehicles. This research shows that a proposed method based on the improved genetic search can obtain good solutions to vehicle routing problems with time constrained compared with a high degree of efficiency other heuristics. For the computational purpose, we developed a GUI-type computer program according to the proposed method and the computational results show that the proposed method is very effective on a set of standard test problems, and can be potentially useful in solving the vehicle routing problems.

시간제한을 가지는 차량경로문제는 배송 및 물류에서 가장 중요한 문제 중의 하나이다. 현실적으로 고객의 서비스를 위하여 정해진 시간 안에 출발해서 배송을 끝마쳐야 한다. 그러므로 본 연구는 개선된 유전자 알고리즘을 이용하여 차량의 용량 및 운행시간을 초과하지 않으면서 고객의 서비스를 제공해주며 비용을 최소화하는 목적이 있다. 그리고 본 연구에서 제안한 개선된 유전자 알고리즘을 이용하면 다른 휴리스틱 기법보다 더욱 효율적인 시간제한을 가지는 차량경로문제에서 훌륭한 해를 도출할 수 있다. 따라서 차량경로문제의 해를 도출할 수 있는 개선된 유전자 알고리즘을 이용한 GUI 방식의 컴퓨터 프로그램을 개발하고 표준문제를 통하여 비교한 결과 본 연구에서 개발된 프로그램이 매우 유용한 결과를 보였다.

Keywords

References

  1. Yeu-Geun Kim, "Meta Heuristic", Young-ji Co. pp.57-123,September, 1997
  2. Achim Bachem et al, "An efficient parallel cluster-heuristic for large Traveling Salesman Problems" Universitat zu Koln,1994.
  3. Chul-Hun Choi, "A Study on the Vehicle Routing of Multi-Supply Center", Dongeui, Univ., Pusan, pp.1-45, 1998.
  4. D. Whitley, T. Starkweather, and D. Fuquay. "Scheduling Problems and Traveling Salesman: The Genetic Edge Recomvination Operator." In Proc. Third Int. Conf. on Genetic Algrithoms, pp.133-140, 1989.
  5. D. Whitley, T. Starkweather, and D. Shaner. "Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination." In Handbook of Genetic Algorims, 1990.
  6. Grefenstette J et al, "Genetic algorithm for the traveling salesman problem", Proc. Intern. Conf. of Genetic algorithm and their applications, pp. 160-165, 1995.
  7. Nygard, K. E. Greenverg, P., Bolkan, W. E., and Swenson, J.E., "Generalized Assignment Methods for the Deadline Vechile Routing Problem", In Vechile Routing: Methods and Studies, North Holland, Amsterdam, 1988.
  8. Sam R., H. Osman., Tong Sun., "Algorithms for the Vehicle Routing Problams with Time Deadlines", American J. of Math. & Manag. Sci., 13(3&4), p323-355, 1994.
  9. Shin, H. W, "Vehicle routing for the delivery using Hybrid Genetic Algorithm", Hanyang University, Seoul, pp.1-75, 1994.
  10. Solomon, M., Desrosiers, M., Desrosiers, J. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows", Operations Research, Vol. 40, No. 2, pp. 342-354, 1992. https://doi.org/10.1287/opre.40.2.342
  11. V. M. Kureichick, A. N. Melihhov et al, "Some new features in genetic solution of the traveling salesman problem" ACEDC, Taganrog State University of Radio-Engineering, Rusia, 1996.
  12. Victor M. Kureichick, Victor V. Miagkikh, et al, "Genetic Algorithm of The Traveling Salesman Problem with New Features against Premature Convergence", Taganrog State University of adio-Engineering, Rusia, 1995.
  13. Weilin, "High QualityTour Hybrid Genetic Schemes for TSP Optimization Problems", State University of New York, 1992.
  14. D. L. Applegate, R. E. Bixby, V. Chvátal and W. J. Cook, "The Traveling Salesman Problem: A Computational Study." Princeton University Press. 2006
  15. Marco Antonio Cruz-Chavez, Ocotlan Diaz-Parral, et., "Search Algorithm for the Constraint Satisfaction Problem of VRPTW," cerma, Electronics, Robotics and Automotive Mechanics Conference, pp. 746-751, 2007.
  16. P. Berman, M. Karpinski, "8/7 APProximation Algorithm for(1,2)-TSP", Proc. 17th ACM-SIAM SODA, pp. 641-648, 2006

Cited by

  1. Case Study on the continuous pickup and delivery vehicle routing problem in Multi-level Logistic Network based on S automobile Part Logistics Process vol.15, pp.2, 2013, https://doi.org/10.12812/ksms.2013.15.2.193