RT Journal Article
T1 A matheuristic for the MinMax capacitated open vehicle routing problem
A1 Lysgaard, Jens
A1 López Sánchez, Ana Dolores
A1 Hernández-Díaz, Alfredo G.
K1 Vehicle routing problem
K1 Matheuristic
K1 COVRP
K1 MinMax objective
AB In this paper, the MinMax-COVRP (where COVRP is capacitated open vehicle routing problem) is considered as a variation of the COVRP where the objective is to minimize the duration of the longest route. For the purpose of producing high-quality solutions, elements from the fields of mathematical programming and metaheuristics are combined, resulting in a matheuristic for solving the MinMax-COVRP. The matheuristic benefits from the diversification produced by a metaheuristic and the intensification from mixed-integer linear programming (MILP). The initial solution provided by a multistart heuristic is used to seed and accelerate the MILP in which a local branching framework and the separation of k-path inequalities are suitably combined. Computational experience shows promising results not only improving the initial solution provided by the multistart algorithm, but also ensuring optimality for most of the small- and medium-sized instances.
PB Wiley
YR 2018
FD 2018-08-05
LK https://hdl.handle.net/10433/22474
UL https://hdl.handle.net/10433/22474
LA en
NO International Transactions in Operational Research, vol. 27, nº 1, p. 394-417
NO Departamento de Economía, Métodos cuantitativos e Historia Económica. Universidad Pablo de Olavide.
DS RIO
RD May 9, 2026