A matheuristic for the MinMax capacitated open vehicle routing problem
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 prog...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2018 |
| País: | España |
| Institución: | Universidad Pablo de Olavide (UPO) |
| Repositorio: | RIO. Repositorio Institucional Olavide |
| Idioma: | inglés |
| OAI Identifier: | oai:rio.upo.es:10433/22474 |
| Acceso en línea: | https://hdl.handle.net/10433/22474 |
| Access Level: | acceso abierto |
| Palabra clave: | Vehicle routing problem Matheuristic COVRP MinMax objective |
| Sumario: | 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. |
|---|