A general variable neighborhood search for solving the multi-objective open vehicle routing problem

被引：0
作者：
Jesús Sánchez-Oro
Ana D. López-Sánchez
J. Manuel Colmenar
机构：
[1] Rey Juan Carlos University,
[2] Pablo de Olavide University,undefined
来源：
Journal of Heuristics | 2020年 / 26卷
关键词：
General variable neighborhood search; NSGA-II; Open vehicle routing problem; Sweep algorithm; Local search; Multi-objective optimization;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：423 / 452
页数：29
相关论文
共 49 条
  • [1] Deb K(2002)A fast and elitist multiobjective genetic algorithm: NSGA-II IEEE Trans. Evolut. Comput. 6 182-197
  • [2] Pratap A(2016)Parallel variable neighbourhood search strategies for the cutwidth minimization problem IMA J. Manag. Math. 27 55-274
  • [3] Agarwal S(2005)A new tabu search heuristic for the open vehicle routing problem J. Oper. Res. Soc. 56 267-349
  • [4] Meyarivan T(1974)A heuristic algorithm for the vehicle-dispatch problem Oper. Res. 22 340-467
  • [5] Duarte A(2001)Variable neighborhood search: principles and applications Eur. J. Oper. Res. 130 449-454
  • [6] Pantrigo J(2017)Variable neighborhood search: basics and variants EURO J. Comput. Optim. 5 423-113
  • [7] Pardo E(2014)A multi-start algorithm for a balanced real-world open vehicle routing problem Eur. J. Oper. Res. 238 104-1100
  • [8] Sánchez Oro J(1997)Variable neighborhood search Comput. Oper. Res. 24 1097-633
  • [9] Fu Z(2012)A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization Netw. Spat. Econ. 12 609-219
  • [10] Eglese R(2014)Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem Comput. Oper. Res. 52 209-92
12345