Aarhus Universitets segl

English

Du er her: AU » Om AU » Organisation » A matheuristic for the MinMax capacitated open vehicle ro...

Om AU

A matheuristic for the MinMax capacitated open vehicle routing problem

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review

Standard

A matheuristic for the MinMax capacitated open vehicle routing problem. / Lysgaard, Jens; López Sánchez, Ana Dolores; Hernández-Díaz, Alfredo García.
I: International Transactions in Operational Research, Bind 27, Nr. 1, 2020, s. 394-417.

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review

Harvard

Lysgaard, J, López Sánchez, AD & Hernández-Díaz, AG 2020, 'A matheuristic for the MinMax capacitated open vehicle routing problem', International Transactions in Operational Research, bind 27, nr. 1, s. 394-417. https://doi.org/10.1111/itor.12581

APA

Lysgaard, J., López Sánchez, A. D., & Hernández-Díaz, A. G. (2020). A matheuristic for the MinMax capacitated open vehicle routing problem. International Transactions in Operational Research, 27(1), 394-417. https://doi.org/10.1111/itor.12581

CBE

Lysgaard J, López Sánchez AD, Hernández-Díaz AG. 2020. A matheuristic for the MinMax capacitated open vehicle routing problem. International Transactions in Operational Research. 27(1):394-417. https://doi.org/10.1111/itor.12581

MLA

Lysgaard, Jens, Ana Dolores López Sánchez og Alfredo García Hernández-Díaz. "A matheuristic for the MinMax capacitated open vehicle routing problem". International Transactions in Operational Research. 2020, 27(1). 394-417. https://doi.org/10.1111/itor.12581

Vancouver

Lysgaard J, López Sánchez AD, Hernández-Díaz AG. A matheuristic for the MinMax capacitated open vehicle routing problem. International Transactions in Operational Research. 2020;27(1):394-417. doi: 10.1111/itor.12581

Author

Lysgaard, Jens ; López Sánchez, Ana Dolores ; Hernández-Díaz, Alfredo García. / A matheuristic for the MinMax capacitated open vehicle routing problem. I: International Transactions in Operational Research. 2020 ; Bind 27, Nr. 1. s. 394-417.

Bibtex

@article{d6662e6729ba44aa9a540438b0fbb44e,
title = "A matheuristic for the MinMax capacitated open vehicle routing problem",
abstract = "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.",
keywords = "COVRP, MinMax objective, matheuristic, vehicle routing problem",
author = "Jens Lysgaard and {L{\'o}pez S{\'a}nchez}, {Ana Dolores} and Hern{\'a}ndez-D{\'i}az, {Alfredo Garc{\'i}a}",
year = "2020",
doi = "10.1111/itor.12581",
language = "English",
volume = "27",
pages = "394--417",
journal = "International Transactions in Operational Research",
issn = "0969-6016",
publisher = "Wiley-Blackwell Publishing Ltd.",
number = "1",

}

RIS

TY - JOUR

T1 - A matheuristic for the MinMax capacitated open vehicle routing problem

AU - Lysgaard, Jens

AU - López Sánchez, Ana Dolores

AU - Hernández-Díaz, Alfredo García

PY - 2020

Y1 - 2020

N2 - 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.

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.

KW - COVRP

KW - MinMax objective

KW - matheuristic

KW - vehicle routing problem

UR - http://www.scopus.com/inward/record.url?scp=85052670816&partnerID=8YFLogxK

U2 - 10.1111/itor.12581

DO - 10.1111/itor.12581

M3 - Journal article

VL - 27

SP - 394

EP - 417

JO - International Transactions in Operational Research

JF - International Transactions in Operational Research

SN - 0969-6016

IS - 1

ER -