Two-Stage Algorithm for the Open Vehicle Routing Problem

4th International Conference on Science, Technology and Interdisciplinary Research

工业技术（总论）;自然科学（总论）

Imran, A.^1

Industrial Engineering Department, Institut Teknologi Nasional, Jl. PHH Mustopa 23, Bandung

40124, Indonesia^1

关键词: Construction phase;    Distribution costs;    Initial solution;    Local search;    Nearest neighbors;    Open vehicle routing problems;    Quality improvement;    Two-stage algorithm;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/532/1/012006/pdf
DOI  :  10.1088/1757-899X/532/1/012006

来源: IOP

【 摘 要 】

Open Vehicle Routing Problem (OVRP) is a problem that is often found in transportation/distribution problems. On this issue it is known that some consumers are served by several homogeneous vehicles that depart from the depot where after visiting the last consumer the vehicle does not go back to the depot as in the OVRP the vehicle is not possessed by the company. The distribution cost is calculated from the depot until delivery to the last consumer. OVRP will be solved using the 2-stage method. The first stage is the initial construction phase of the solution while the second stage is the quality improvement phase of the solution. The Nearest Neighbor and 2-Opt algorithm are applied to generate the initial solution. The second stage uses Multi-Level Algorithm. The algorithm is equipped with four local searches. The data set from the literature is used to test the algorithm.