역물류 환경을 고려한 복수차고지 다용량 차량경로문제
Dual-Depot Heterogeneous Vehicle Routing Problem Considering Reverse Logistics
정영훈(국방대학교); 김각규(국방대학교); 이상헌(국방대학교)
29권 1호, 89~99쪽
초록
In this paper, we deal with the dual-depot heterogeneous vehicle routing problem with simultaneous delivery and pick up(DH-VRPSDP) in reverse logistics. The DH-VRPSDP is a problem of designing vehicle routes in a day of given vehicle to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited only once according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by changing the customer and the vehicle simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.
Abstract
In this paper, we deal with the dual-depot heterogeneous vehicle routing problem with simultaneous delivery and pick up(DH-VRPSDP) in reverse logistics. The DH-VRPSDP is a problem of designing vehicle routes in a day of given vehicle to minimize the sum of fixed cost and variable cost over the planning horizon. Each customer can be visited only once according to the service combinations of that customer. Due to the complexity of the problem, we suggest a heuristic algorithm in which an initial solution is obtained by changing the customer and the vehicle simultaneously and then it is improved. A performance of the proposed algorithm was compared to both well-known results and new test problems.
- 발행기관:
- 한국경영과학회
- 분류:
- 경영학