期刊
JOURNAL OF HEURISTICS
卷 26, 期 3, 页码 423-452出版社
SPRINGER
DOI: 10.1007/s10732-017-9363-8
关键词
General variable neighborhood search; NSGA-II; Open vehicle routing problem; Sweep algorithm; Local search; Multi-objective optimization
资金
- Spanish Ministry of Economia y Competitividad [TIN2015-65460-C2-2-P, TIN2014-54806-R]
- Spanish Ministry of Science and Innovation [ECO2013-47129-C4-1-R, ECO2016-76567-C4-1-R]
The multi-objective open vehicle routing problem (MO-OVRP) is a variant of the classic vehicle routing problem in which routes are not required to return to the depot after completing their service and where more than one objective is optimized. This work is intended to solve a more realistic and general version of the problem by considering three different objective functions. MO-OVRP seeks solutions that minimize the total number of routes, the total travel cost, and the longest route. For this purpose, we present a general variable neighborhood search algorithm to approximate the efficient set. The performance of the proposal is supported by an extensive computational experimentation which includes the comparison with the well-known multi-objective genetic algorithm NSGA-II.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据