Spatial Information Research

  • 제18권3호
  • /
  • Pages.63-72
  • /
  • 2010
  • /
  • 2366-3286(pISSN)
  • /
  • 2366-3294(eISSN)
대한공간정보학회 (Korea Spatial Information Society)
권호 표지

VRPSPD 해결을 위한 위치기반의 실시간 재경로 탐색 휴리스틱

A Location-based Real-time Re-routing Heuristic to Solve the VRPSPD

  • 차상진 (인하대학교 정보공학과) ;
  • 이기성 (인하대학교 정보공학과) ;
  • 유영훈 (인하대학교 컴퓨터정보공학부) ;
  • 조근식 (인하대학교 컴퓨터정보공학부)
  • 투고 : 2010.05.25
  • 심사 : 2010.08.10
  • 발행 : 2010.08.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

일반적인 Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries (VRPSPD)는 배송과 수거가 동시에 발생하는 문제를 고려한 차량경로 문제이며, 차량의 운행 거리등의 비용을 최소화하는 것을 결정하는 문제이다. 그러나 기존의 VRPSPD는 이미 차량이 출발하기 전에 경로가 정해져 있어서 차량 운행 중 발생하는 고객의 수거 요청을 기존의 경로에 효율적으로 추가하여 서비스하기가 어렵다. 따라서 본 논문에서는 이러한 문제를 위치기반의 서비스를 이용하여 이동 중인 차량의 위치정보를 파악하고 이를 바탕으로 실시간 재경로 탐색을 통해 해결하는 휴리스틱을 제안한다. 그리고 실험을 통해 기존의 방식과 비교하여 차량을 운행하는데 소요되는 비용을 줄이는 결과를 보였다.

The vehicle routing problem with simultaneous pick-up and delivery (VRPSPD) is a variant of the vehicle routing problem (VRP) that customers require simultaneously a pick-up and delivery service. The main objective of VRPSPD is to minimize a cost of routes satisfying many constraints. Traditional VRPSPD have been dealt with a static environment. The static environment means that a routing data and plan cannot be changed. For example, it is difficult to change a vehicle's routing plan so that a vehicle serves the pick-up demands of new customers during the delivery service. Therefore, traditional approach is not suitable for dynamic environments. To solve this problem, we propose a novel approach for finding efficient routes using a real-time re-routing heuristics based on the Location Based Service (LBS). Our re-routing heuristics can generate a new route for vehicle that satisfies a new customer's demand considering the current geographic location of a vehicle. Experimental results show that our methodology can reduce the traveling cost of vehicles comparing with other previous methods.

키워드

참고문헌

  1. Anily, S., 1996, "The vehicIe routing problem with delivery and back-haul options," Naval Research Logistics, vol. 43, pp.415-434. https://doi.org/10.1002/(SICI)1520-6750(199604)43:3<415::AID-NAV7>3.0.CO;2-C
  2. Antoine L., Y. Mati, Z. Binder, 2001, "A tabu search heuristic for the single vehicIe pickup and delivery problem with time windows," Journal of Intelligenct Manufacturing, vol. 12, pp.497 -508. https://doi.org/10.1023/A:1012204504849
  3. Baker B. D., V. Furnon, P. Shaw, 2001, "Sovling vehicIe routing problems using constraint programming and meta heuristics," Journal of Heuristics, vol. 6, pp,501-523.
  4. Brandao, J., 2006, "A nEw tabu search for the vehicIc routing problem with back-hauls," European Journal of Operational Research, vol. 173, no. 2, pp.540-555. https://doi.org/10.1016/j.ejor.2005.01.042
  5. Casco, D. O., B. L. Golden and E. A. Colden, 1988, "Vehicle Routing with Backhauls : Models Algorithms, and Case " Vehicle Routing:Methods and Studies, pp.127-147.
  6. Clark, G. and J. K Wright, 1964, "Schoduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, vol. 2, no. 4, pp.568-581.
  7. Gendreau M, G. Laporte, D. Vigo, 1999, "Heuristics for the traveling salesman problem with pickup and delivery," Computers & Operations Research vol. 26, pp.699-714. https://doi.org/10.1016/S0305-0548(98)00085-9
  8. Glover, F., 1989, "Tabu Search Part I", ORSA Journal on Computing, vol. 1, no.3, pp.190-206. https://doi.org/10.1287/ijoc.1.3.190
  9. Glover, F., l990, "Tabu Search Part II", ORSA Journal on Computing, vol. 2, no. 1, pp.4-32. https://doi.org/10.1287/ijoc.2.1.4
  10. Meshup; http://en.wikipedia.org/wki/Meshup_ ( web_application_hybrid)
  11. Min, H., 1989, "The multiple vehicle routing problem with simultaneous delivery and pick-up," Transportation Research Part A, vol. 23A,no. 5, pp.377-386.
  12. Quan L., M. M. Dessousky, 2006, "A new in sertion-based construction heuristic for solving the pickup and delivery problem with time windows, " European Journal of Operational Research vol. 175, pp.672-687. https://doi.org/10.1016/j.ejor.2005.05.012
  13. Solomon M.M, 1987, "Algorithms for the vehicle routing and scheduling problems with time window constrains," Operations Research, vol. 35, pp.254-265. https://doi.org/10.1287/opre.35.2.254
  14. Tan K C., L.H. Lee, Q.L. Zhu, K. Ou, 2001, "Heuristic methods for vehicle routing problem with time windows," Artificial Intelligence in Engineering, vol. 15, pp.281-295. https://doi.org/10.1016/S0954-1810(01)00005-X
  15. Willian P. Nanry, J., W. Barnes, 2000, "Solving the pickup and delivery problem with time windows reactive tabu search," Transportation Research Part B, vol. 34, pp.107-121. https://doi.org/10.1016/S0191-2615(99)00016-8
  16. Yu Y.H, J.H Kim, K.C Shin, G.S Jo, 2009, "Recommendation system using location-based ontology on wireless internet: An example of collective, intelligence by using 'mashup' applications," Expert Systems with Applications, Vol.36, Issue 9, pp.11675-11681. https://doi.org/10.1016/j.eswa.2009.03.017
  17. Zachariadis E.E, C.D Tarantilis, C.T kiranoudis, 2009, 'A hybrid metaheuristic algorithm for the vchiclc routing problem with simultaneous delivery and pick-up service," Expert Systems with Applications, vol 36, issue. 2, pp.1070-1081. https://doi.org/10.1016/j.eswa.2007.11.005
  18. 문형돈, 이성휘, 이재환, 2004, "국내 LBS 동향 및 활성화 방안 분석," 정보통신연구진흥원 학술정보 주간기술동향 1133호.
  19. 유영훈, 차상진, 조근식, 2009, "시간 제약을 가지는 차량 경로 스케줄링 문제 해결을 위한 기회시간 반영 하이브리드 휴리스틱," 지능정보연구, 제15권, 제3호, pp.129-142.
  20. 조대수 2007, "특허 분석을 통한 LBS 기술현황에 관한 연구," 한국공간정보시스템학회논문지, 제9권, 제3호, pp.65-75.
  21. 진희채, 홍길표, 2003, "위치기반 서비스를 위한 모델 분석 및 기술 연구," 한국GIS학회 춘계학술대회, pp.438-450.