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

  • 제31권2호
  • /
  • Pages.132-140
  • /
  • 2008
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지

시간 제약을 갖는 차량 라우팅 문제에서 염색체 해석에 기초한 유전자 알고리듬과 부분 최적화 알고리듬

An Interpretation-based Genetic Algorithm and a Post Local Search Method for Vehicle Routing Problems with Time Windows

  • 임동순 (한남대학교 공과대학 산업경영공학과) ;
  • 오현승 (한남대학교 공과대학 산업경영공학과)
  • Yim, Dong-Soon (Department of Industrial and Management Engineering, Hannam University) ;
  • Oh, Hyun-Seung (Department of Industrial and Management Engineering, Hannam University)
  • 발행 : 2008.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문은 시간 제약을 갖는 차량 라우팅 문제를 해결하기 위해 유전자 알고리듬과 부분 최적화 알고리듬을 적용한 방법을 소개한다. 유전자 알고리듬에서의 염색체는 노드를 나타내는 정수의 순열로 표현되어 직접적인 해를 나타내지 않지만, 경험적 방법에 의한 해석을 통해 유효한 해로 변형되도록 하였다. 유전자 알고리듬에 의해 생성된 주어진 수의 우수한 해들에는 세 부분 최적화 방법이 순차적으로 적용되어 보다 좋은 해를 생성하도록 하였다. 부분 최적화 방법들에 의한 해는 다시 유전자 알고리듬의 해로 바뀌지 않도록 하여 두 알고리듬은 느슨하게 연결되도록 하였다. 솔로몬의 데이터를 이용한 실험에서 본 연구에서의 방법이 모든 문제에 대해 우수한 해를 생성함을 나타내었다. 특히, 지금까지 알려진 가장 우수한 경험적 방법에 비교될 만한 결과를 가져옴을 보였다.

키워드

참고문헌

  1. Baker, B. M. and Ayechew, M. A.; "A genetic algorithm for the vehicle routing problem," Computers and Operations Research, 30:787-800, 2003 https://doi.org/10.1016/S0305-0548(02)00051-5
  2. Berger, J. and Barkaoui, M. A.; "parallel hybrid genetic algorithm for the vehicle routing problem with time window," Computers and Operations Research, 31: 2037-2053, 2004 https://doi.org/10.1016/S0305-0548(03)00163-1
  3. Berger, J. and Barkaoui, M. A.; "new hybrid genetic algorithm for the capacitated vehicle routing problem," Journal of Operations Research Society, 54:1254- 1262, 2004
  4. Blanton, J. L. and Wainwright, R. L.; "Multiple vehicle routing with time and capacity constraints using genetic algorithms," Proceedings of the fifth International Conference on Genetic Algorithms, Morgan Kaufmann:San Francisco, 452-459, 1993
  5. Clark, G. and Wright, J. W.; "Scheduling of vehicles from a central depot to a number of delivery points," Operations Research, 12:568-581, 1964 https://doi.org/10.1287/opre.12.4.568
  6. Davis, L.; "Applying Adaptive Algorithms to epistatic domains," Proceedings of the International Joint Conference on Artificial Intelligence, 162-164, 1985
  7. Goldberg, D. E. and Lingle, R. Alleles; "Loci, and the TSP," Proceedings of the First International Conference on Genetic Algorithms, Alwrence ErlBaum Associates, Hillsdale, NJ, 154-159, 1985
  8. Jones, D. R. and Beltramo, M. A.; "Solving partitioning problems with genetic algorithms," Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, Los Altos, CA, 442-449, 1991
  9. Kallehauge, Brian; "Formulations and exact algorithms for the vehicle routing problem with time windows," Computers and Operations Research, 35(7):2307-2330, 2008 https://doi.org/10.1016/j.cor.2006.11.006
  10. Liu, F. H. and Shen, S. Y.; "A route-neighborhoodbased metaheuristic for vehicle routing problem with time windows," European Journal of Operations Research, 118:485-504, 1999 https://doi.org/10.1016/S0377-2217(98)00315-4
  11. Oliver, I. M., Smith, D. J., and Holland, J. R. C.; "A study of permutation crossover operators on the Traveling Salesman Problem," Proceedings of the First International Conference on Genetic Algorithms, Alwrence Erl- Baum Associates, Hillsdale, NJ, 224-230, 1985
  12. Osman, I. H.; "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem," Operations Research, 41:421-451, 1993 https://doi.org/10.1007/BF02023004
  13. Osman, I. H. and Christofides, N.; "Capacitated clustering problem by hybrid simulated annealing and tabu search," International Transaction in Operations Research, 1(3):317-336, 1994 https://doi.org/10.1016/0969-6016(94)90032-9
  14. Prins, C. A.; "simple and effective evolutionary algorithm for the vehicle routing problem," Computers and Operations Research, 31:1985-2002, 2004 https://doi.org/10.1016/S0305-0548(03)00158-8
  15. Rochat, Y. and Taillard, E.; "Probabilistic diversification and intensification in local search for vehicle routing," Journal of Heuristics, 1:147-167, 1995 https://doi.org/10.1007/BF02430370
  16. Solomon, M. M.; "Algorithm 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
  17. Tan, K. C., Lee, L. H., and Ou, K.; "Artificial intelligence heuristics in solving vehicle routing problems with time window constraints," Engineering Applications of Artificial Intelligence, 14:825-837, 2001 https://doi.org/10.1016/S0952-1976(02)00011-8
  18. Tangiah, S. R, Vinayagamoorthy, and Gubbi, A.; "Vehicle routing with time deadlines using genetic and local algorithms," Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, NY, 506-513, 1993