Journal of Intelligence and Information Systems (지능정보연구)

Korea Intelligent Information System Society (한국지능정보시스템학회)
권호 표지

The Bisection Seed Detection Heuristic for Solving the Capacitated Vehicle Routing Problem

한정 용량 차량 경로 탐색 문제에서 이분 시드 검출 법에 의한 발견적 해법

  • Ko, Jun-Taek (School of Information Engineering, Inha University) ;
  • Yu, Young-Hoon (School of Information Engineering, Inha University) ;
  • Jo, Geun-Sik (School of Computer and Information Engineering, Inha University)
  • 고준택 (인하대학교 대학원 정보공학과) ;
  • 유영훈 (인하대학교 대학원 정보공학과) ;
  • 조근식 (인하대학교 IT공과대학 컴퓨터정보공학부)
  • Published : 2009.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is the problem that the vehicles stationed at central depot are to be optimally routed to supply customers with demands, satisfying vehicle capacity constraints. The CVRP is the NP-hard as it is a natural generalization of the Traveling Salesman Problem (TSP). In this article, we propose the heuristic algorithm, called the bisection seed detection method, to solve the CVRP. The algorithm is composed of 3-phases. In the first phase, we work out the initial cluster using the improved sweep algorithm. In the next phase, we choose a seed node in each initial cluster by using the bisection seed detection method, and we compose the rout with the nearest node from each seed. At this phase, we compute the regret value to decide the list of priorities for the node assignment. In the final phase, we improve the route result by using the tabu search and exchange algorithm. We compared our heuristic with different heuristics such as the Clark-Wright heuristic and the genetic algorithm. The result of proposed heuristic show that our algorithm can get the nearest optimal value within the shortest execution time comparatively.

본 연구에서는 한정 용량 차량 경로탐색 문제(CVRP, Capacitated Vehicle Routing Problem)에서 이분 시드 검출 방법(Bisection Seed Detection)을 이용한 휴리스틱 알고리즘을 제안하였다. 이 알고리즘은 3단계로 구성된다. 1단계에서는 improved sweep 알고리즘을 이용해서 초기 클러스터를 구성한다. 2단계에서는 1단계에서 얻은 각 클러스터에 대하여 이분 시드 검출 법을 이용해서 seed 노드를 선택하고, regret 값에 따라 각 경로에 고객 노드들을 삽입 함으로서 차량 이동 경로를 생성한다. 3단계에서는 tabu 탐색 방법과 노드 교환 알고리즘(node exchange algorithm)을 이용하여 2단계에서 얻어진 각 경로를 더욱 향상 시킨다. 본 논문의 실험에서는 제안된 휴리스틱이 비교적 빠른 시간 내에 최적 근사 값을 얻을 수 있음을 보였으며, 이는 빠른 실행 시간을 요구하는 실 업무에 유용하다.

Keywords

References

  1. Taillard, E. D. "Parrel iterative search methods for vehi cle routing problem", Networks, Vol.23(1993), 661-673. https://doi.org/10.1002/net.3230230804
  2. Clarke G. and J. W. Wright, "Scheduling of vehicles from a central depot to a number of delivery points", Operational Research, Vol.12(1964), 568-581. https://doi.org/10.1287/opre.12.4.568
  3. Koskosidis I. and W. B. Powell, "Clustering algorithms for consolidation of customer orders into vehicle shipments", Transpn.Res.-B. Vol.26B, No.5(1992), 365-379.
  4. Clarke, G. and J. W. Wright, "Scheduling of vehicles from a Central Depot to a Number of Delivery Points", Operational Research, Vol.12(1964), 568-581. https://doi.org/10.1287/opre.12.4.568
  5. N.Christofides, Mingozzi, A., and P. Toth, "The vehicle routing Problem", In N.Christofides , A. Mingoz zi, and C. Sandi, edit ors, Combinatorial Optimization, (1979), 325-338, Wiley, Chichester.
  6. Alfonsas Misevicius, "Using Iterated tabu search for the traveling salesman problem", ISSN 1392-124X INFOR MACINES TECHNOLOGIJOS IR VALDYMAS, Vol.3, No.32(2004).
  7. Baker, B. M. and M. A. Ayechew, "A genetic algorithm for the vehicle routing problem", Computer and Operational Research, Vol.30 (2003), 787-800. https://doi.org/10.1016/S0305-0548(02)00051-5
  8. Gillett, B. and L. Miller. "A heuristic algorithm for the vehicle dispatch problem", Operational Research, Vol.22(1974), 340-349. https://doi.org/10.1287/opre.22.2.340
  9. Laporte G., M. Gendreau, J-Y. Potvin, F. Semet, "Classical and modern heuristics for vehicle routing problem", Ecole des HautesEtudes Commerciales and. Centre for research on Transportation, Montreal, (1999).
  10. Ursani, Z., R. Sarker, H. A. Abbass, "Improving the Performance of Genetic Algorithm in Capacitated Vehicle Routing Problem using Self Imposed Constraints" Proceedings of the 2007 IEEE Symposium on Computa tional Intelligence in Scheduling(CI-Sched 2007).
  11. Gendreau, M., A. Hertz, and G. Laporte, "A tabu search heuristic for the vehicle routing problem", Management Science, Vol.40, No.10 (1994), 1276-1290. https://doi.org/10.1287/mnsc.40.10.1276
  12. Osman, I. H., Netastrategy, "simulated annealing and tabu search algorithms for the vehicle routing problem", Ann Operaional Research, Vol.41(1993), 421-451. https://doi.org/10.1007/BF02023004
  13. Stefan, R., "Polynomial time heuristic for the VRP", Topics in transportation and cargo loading, setember, (2005).