Heuristics for Rich Vehicle Routing Problem : A Case of a Korean Mixed Feed Company

• 발행기관: 한국산업경영시스템학회
• 저자명: 손동훈(Dong Hoon Son) ․ 김화중(Hwa-Joong Kim)
• 간행물 정보: 『산업경영시스템학회지』제42권 제1호, 8~20쪽, 전체 13쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2019.03.28

영문 초록

The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that he proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

목차

1. 서 론

2. 선행 연구

3. 문제 설명

4. 시뮬레이티드 어닐링 알고리즘

5. 실험 결과

6. 결 론

키워드

Rich Vehicle Routing Problem Simulated Annealing Algorithm Local Search Methods