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

  • 제15권3호
  • /
  • Pages.137-150
  • /
  • 2009
  • /
  • 2288-4866(pISSN)
  • /
  • 2288-4882(eISSN)
한국지능정보시스템학회 (Korea Intelligent Information System Society)
권호 표지

시간 제약을 가지는 차량 경로 스케줄링 문제 해결을 위한 기회시간 반영 하이브리드 휴리스틱

Hybrid Heuristic Applied by the Opportunity Time to Solve the Vehicle Routing and Scheduling Problem with Time Window

  • 유영훈 (인하대학교 일반대학원 정보공학과) ;
  • 차상진 (인하대학교 일반대학원 정보공학과) ;
  • 조근식 (인하대학교 공과대학 컴퓨터정보공학부)
  • Yu, Young-Hoon (School of Information Engineering, Inha University) ;
  • Cha, Sang-Jin (School of Information Engineering, Inha University) ;
  • Jo, Geun-Sik (School of Computer and Information Engineering, Inha University)
  • 투고 : 2009.08.25
  • 심사 : 2009.09.18
  • 발행 : 2009.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 연구는 시간 제약조건을 가지는 차량 경로 탐색과 스케줄링 문제(VRSPTW, the Vehicle Routing and Scheduling Problem with Time Window)를 해결하기 위하여, 기회시간(Opportunity time)을 반영한 하이브리드 휴리스틱을 제안하였다. 기회시간은 각 고객 노드에서 요구하는 하역 서비스를 수행 한 뒤에도 남아 있는 여유시간이다. 제안된 휴리스틱은 기회시간에 대한 제약조건을 추가하고, 기회시간을 고려한 비용 평가함수를 삽입 전략에 적용함으로써 초기 해를 구하였다. 또한 고객 노드 교환에 의한 타부 탐색 전략에도 기회시간을 반영함으로써 해를 개선 시켰다. 마지막으로 지리적, 시간적, 용량적으로 다양한 데이터 유형들에 대하여 각각 효과적으로 최적 해를 구할 수 있는 초기 경로 생성 전략들을 소개하고 비교하였다. 본 연구의 실험에서는 제안된 휴리스틱이 Solomon I1 휴리스틱 보다 효율적으로 최근사 해를 얻을 수 있음을 보였다.

This paper proposes the hybrid heuristic method to apply the opportunity time to solve the vehicle routing and scheduling problem with time constraints(VRSPTW). The opportunity time indicates the idle time which remains after the vehicle performs the unloading service required by each customer's node. In this proposed heuristic, we add the constraints to VRSPTW model for the opportunity time. We also obtain the initial solution by applying the cost evaluation function to the insertion strategy considering the opportunity time. In addition, we improve the former result by applying the opportunity time to the tabu search strategy by swapping the customer's node. Finally, we suggest the construction strategies of initial routing which can efficiently acquire the nearest optimal solution from various types of data in terms of geographical condition, scheduling horizon and vehicle capacity. Our experiment show that our heuristic can get the nearest optimal solution more efficiently than the Solomon's I1 heuristic.

키워드

참고문헌

  1. 고준택, 유영훈, 조근식, "한정 용량 차량 경로탐색 문제에서 이분시드 검출법에 의한 발견적 해법", 한국지능정보시스템학회 지능정보연구논문지, 15권, 1호(2009), 1-12.
  2. Baker E. K. and Schaffer J. R., Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, American Journal of Mathematical and Management Sciences Vol.6(1988), 261-300.
  3. Bard J. F., G. Kontoravdis, and G. Yu, "A Branchand-Cut procedure for the vehicle routing problem with time windows", Transportaion Secience, Vol.36, No.2(2002), 250-269
  4. Bodin L., B. Golden, A. Assad, and M. Ball, "Routing and Scheduling of Vehicles and Crews : The State of the Art. Comput", Opns. Res. Vol.10(1983), 62-212.
  5. Christofides N., A. Mingozzi, and P. Toth, "The Vehicle Routing Problem. In Combinatorial Optimizations", John Wiley and Sons, New York, 1979.
  6. Clarke G. and 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
  7. Desrochers M., J. Desrosiers, and M. M. Solomon, "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows", Operations Research, Vol.40(1992), 342-354. https://doi.org/10.1287/opre.40.2.342
  8. Fisher M., and R. Jaikumar, "A Generalized Assignment Heuristic for Vehicle Routing". Networks, Vol.11(1981), 109-124. https://doi.org/10.1002/net.3230110205
  9. Gillet B., and L. Miller, "A Heuristic Algorithm for the Vehicle Dispatching Problem", Operations Research Vol.22(1974), 340-349. https://doi.org/10.1287/opre.22.2.340
  10. Glover F., "Tabu Search Part I", ORSA Journal on Computing, Vol.1, No.3(1989), 190-206. https://doi.org/10.1287/ijoc.1.3.190
  11. Glover F., "Tabu Search Part II", ORSA Journal on Computing, Vol.2, No.1(1990), 4-32. https://doi.org/10.1287/ijoc.2.1.4
  12. Glover F., and E. Taillard, "A user's guide to tabu search", Annals of Operations Research, Vol.41 No.1(1993), 1-28. https://doi.org/10.1007/BF02078647
  13. Ibrahim H. Osman, and James P. Kelly, METAHEURISTICS : Theory and Applications, Springer, 1 edition, March Vol.31, 1996.
  14. Irnich S. and Villeneuve D., The shortest path problem with k-cycle elimination (k $ge$ 3) : Improving a branch-and-price algorithm for the VRPTW. INFORMS Journal of Computing (2005).
  15. Kolen A., Rinnooy Kan A. H. G., and H. Trienekesn, "Vehicle Routing with Time Windows", Operations Research, Vol.35(1987), 266-273. https://doi.org/10.1287/opre.35.2.266
  16. Lau H. C., Sim M., and K. M. Teo, "Vehicle routing problem with time windows and a limited number of vehicles", Eur. J. Oper. Res., Vol.148(2003), 559-568. https://doi.org/10.1016/S0377-2217(02)00363-6
  17. Lenstra, J. K., and Rinnooy Kan, A. H. G., "Complexity of vehicle routing and scheduling problems", Networks, Vol.1(1981), 221-227.
  18. Or I., "Traveling Salesman-type Combinatorial Problems and their relation to the Logistics of Blood Banking", Ph.D. thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL. 1976.
  19. Potvin J. Y. and J. M. Rousseau, "An Exchange Heuristic for Routing Problems with Time Windows", Journal of the Operational Research Society, Vol.46(1995), 1433-1446. https://doi.org/10.1057/jors.1995.204
  20. Savelsbergh M., Private Communication by Alexander Rinnooy Kan. 1984.
  21. Solomon Marius M., "Algorithms for the vehicle routing and scheduling problems with time window constraints", Operations Research, Vol.35, Is., Vol.2(1987), 254-262. https://doi.org/10.1287/opre.35.2.254
  22. Taillard E. D., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin, "A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows", Te Vsportation Science, Vol.31, No.2(1997), 170-186.