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

  • 제35권4호
  • /
  • Pages.171-178
  • /
  • 2012
  • /
  • 2005-0461(pISSN)
  • /
  • 2287-7975(eISSN)
한국산업경영시스템학회 (Society of Korea Industrial and System Engineering)
권호 표지
DOI QR코드

DOI QR Code

4개 시간구간에 의한 가변속도 차량경로해법

A Possible Heuristic for Variable Speed Vehicle Routing Problem with 4 Time Zone

  • 문기주 (동아대학교 산업경영공학과) ;
  • 박성미 (동아대학교 산업경영공학과)
  • Moon, Geeju (Department of Industrial and Management Systems Engineering, Dong-A University) ;
  • Park, Sungmee (Department of Industrial and Management Systems Engineering, Dong-A University)
  • 투고 : 2012.11.06
  • 심사 : 2012.12.04
  • 발행 : 2012.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

A possible heuristic to solve metropolitan area vehicle routing problems with variable vehicle speeds is suggested in this research. Delivery hours are classified into 4 different time zones to make variable vehicle speeds no change within the same time zone to make TDVRP simple to solve. The suggested heuristic consists of 2 stages such as initial solution development step and initial solution improvement step. A computer program using C++ is constructed to evaluate the suggested heuristic. Randomly generated vehicle routing problems are used for the experiments. This heuristic could be helpful to logistics companies by increasing delivery efficiencies since the 4 zone classification is taken from the observed traffic information offered by a local government.

키워드

참고문헌

  1. Imran, A., Salhi, S., and Wassan, N.A., A Variable Neighborhood-based Heuristic for the Heterogeneous Fleet Vechicle Routing Problem. European Journal of Operational Research, 2009, Vol. 197, No. 2, p 509-518. https://doi.org/10.1016/j.ejor.2008.07.022
  2. Malandraki, C. and Daskin, M.S., Time Dependent Vehicle Routing Problems : Formulations, Properties and Heuristic Algorithms. Transportation Science, 1992, Vol. 26, No. 3, p 185-200. https://doi.org/10.1287/trsc.26.3.185
  3. Moon, G. and Park, S., Analysis and Reconstruction of Vehicle Speeds to Design an Efficient Time Dependent VRP Heuristic. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 1, p 140-147.
  4. Brandao, J., A Deterministic Tabu Search Algorithm for the Fleet Size and Mix Vehicle Routing Problem. European Journal of Operational Research, 2009, Vol. 195, No. 3, p 716-728. https://doi.org/10.1016/j.ejor.2007.05.059
  5. Magalhaes, J.M. and Sousa, J.P., Dynamic VRP in pharmaceutical distribution a case study. CEJOR 2006, Vol. 14, No. 2, p 177-192. https://doi.org/10.1007/s10100-006-0167-4
  6. Sun, L. and Hu, X., Knowledge representation for the Model of capacitated vehicle routing problems. IEEE 2005, Vol. 0-7695-2504-0, No. 2, p 1110-1114.
  7. Gendreau, M., Guertin, F., Potvin, J., and Seguin, R., Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C. 2006, Vol. 14, No. 3, p 157-174. https://doi.org/10.1016/j.trc.2006.03.002
  8. Baldacci, R. and Mingozzi, A., Lower bounds and an exact method for the capacitated vehicle routing problem. IEEE, 2006, Vol. 1-4244-0451-7, No. 2, p 1536-1540.
  9. Park, S. and Moon, G., A Study on the Walking Time to Drop off Parcels on the Design of VRP Heuristic for Parcel Delivery Services. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 2, p 88-194.
  10. Hil, V. and Benton, W.C., Modeling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems. Journal of Operational Research Society, 1992, Vol. 43, No. 4, p 343-351.
  11. Bell, W.J., Dalberto, L.M., Fisher, M.L., Greenfield, A.J., Jaikumar, R., Kedia, P., Mack, R.G., and Prutzman, P.J., Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer. Interfaces, 1983, Vol. 13, No. 6, p 4-23. https://doi.org/10.1287/inte.13.6.4

피인용 문헌

  1. 왕복비대칭 가변이동속도에서의 효율적 배송차량경로 탐색해법 연구 vol.36, pp.3, 2012, https://doi.org/10.11627/jkise.2013.36.3.71
  2. Sweep해법 및 공동구역 2차 재할당에 의한 복수차량 배송 최적화 연구 vol.37, pp.1, 2012, https://doi.org/10.11627/jkise.2014.37.1.133
  3. K-Means Clustering의 차량경로문제 적용연구 vol.38, pp.3, 2012, https://doi.org/10.11627/jkise.2015.38.3.01
  4. 여행경로 추천 서비스를 위한 최적화 수리모형 vol.40, pp.3, 2017, https://doi.org/10.11627/jkise.2017.40.3.099
  5. Map과 GPS 기반의 혼적을 고려한 물류할당 및 모니터링 시스템 vol.41, pp.4, 2018, https://doi.org/10.11627/jkise.2018.41.4.138
  6. 단일 허브를 이용한 시간 제약이 존재하는 수거 및 배달 차량 경로 문제 vol.42, pp.4, 2019, https://doi.org/10.11627/jkise.2019.42.4.016