자원 재배치를 위한 차량 경로계획의 다목적 최적화

• 영문명: Multi-objective Optimization of Vehicle Routing with Resource Repositioning
• 발행기관: 한국산업경영시스템학회
• 저자명: 강재구(Jae-Goo Kang) 임동순(Dong-Soon Yim)
• 간행물 정보: 『산업경영시스템학회지』제44권 제2호, 36~42쪽, 전체 7쪽
• 주제분류: 공학 > 산업공학
• 파일형태: PDF
• 발행일자: 2021.06.30

영문 초록

This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

목차

1. 서 론

2. 자원 재배치 경로계획 문제

3. 다목적 해 탐색 알고리즘

4. 실험 및 결과

5. 결 론

키워드

Vehicle Routing Problem with Pickup and Delivery Static Repositioning of Public Bikes Multi-Objective Optimization Strength Pareto Evolutionary Algorithm Variable Neighborhood Search