4개 시간구간에 의한 가변속도 차량경로해법
A Possible Heuristic for Variable Speed Vehicle Routing Problem with 4 Time Zone
0
조회
0
다운로드
7
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (11)
- Imran, A., "A Variable Neighborhood-based Heuristic for the Heterogeneous Fleet Vechicle Routing Problem", European Journal of Operational Research, 197(2), pp.509~518 (2009)
- Malandraki, C., "Time Dependent Vehicle Routing Problems : Formulations, Properties and Heuristic Algorithms", Transportation Science, 26(3), pp.185~200 (1992)
- 문기주, "시간종속VRP의 효율적 해법 설계를 위한 차량통행속도의 분석과 재구성", 산업경영시스템학회지, 35(1), pp.140~147 (2012), 한국산업경영시스템학회
- Brandao, J., "A Deterministic Tabu Search Algorithm for the Fleet Size and Mix Vehicle Routing Problem", European Journal of Operational Research, 195(3), pp.716~728 (2009)
- Magalhaes, J.M., "Dynamic VRP in pharmaceutical distribution a case study", CEJOR 2006, 14(2), pp.177~192 (2006)
- Sun, L., "Knowledge representation for the Model of capacitated vehicle routing problems", IEEE 2005, 0-7695-2504-0(2), pp.1110~1114 (2005)
- Gendreau, M., "Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries", Transportation Research Part C, 14(3), pp.157~174 (2006)
- Baldacci, R., "Lower bounds and an exact method for the capacitated vehicle routing problem", IEEE, 1-4244-0451-7(4244), pp.1536~1540 (2006)
- 박성미, "택배배송 VRP 해법 설계를 위한 도보전달소요시간에 대한 연구", 산업경영시스템학회지, 35(2), pp.189~195 (2012), 한국산업경영시스템학회
- Hil, V., "Modeling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems", Journal of Operational Research Society, 43(4), pp.343~351 (1992)
- Bell, W.J., "Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer", Interfaces, 13(6), pp.4~23 (1983)