Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/11371
Title: Heuristics for vehicle routing problems : sequence or set optimization?
Authors: Toffolo, Túlio Ângelo Machado
Vidal, Thibaut Victor Gaston
Wauters, Tony
Keywords: Decision-set decompositions
Metaheuristics
Dynamic programming
Large neighborhood search
Integer programming
Issue Date: 2019
Citation: TOFFOLO, T. A. M.; VIDAL, T. V. G.; WAUTERS, T. Heuristics for vehicle routing problems : sequence or set optimization? Computers & Operations Research, v. 105, p. 118-131, maio 2019. Disponível em: <https://www.sciencedirect.com/science/article/pii/S0305054818303356?via%3Dihub>. Acesso em: 19 mar. 2019.
Abstract: We investigate a structural decomposition for the capacitated vehicle routing problem (CVRP) based on vehicle-to-customer “assignment” and visits “sequencing” decision variables. We show that an heuristic search focused on assignment decisions with a systematic optimal choice of sequences (using Concorde TSP solver) during each move evaluation is promising but requires a prohibitive computational effort. We therefore introduce an intermediate search space, based on the dynamic programming procedure of Balas & Simonetti, which finds a good compromise between intensification and computational efficiency. A variety of speed-up techniques are proposed for a fast exploration: neighborhood reductions, dynamic move filters, memory structures, and concatenation techniques. Finally, a tunneling strategy is designed to reshape the search space as the algorithm progresses. The combination of these techniques within a classical local search, as well as in the unified hybrid genetic search (UHGS) leads to significant improvements of solution accuracy. New best solutions are found for surprisingly small instances with as few as 256 customers. These solutions had not been attained up to now with classic neighborhoods. Overall, this research permits to better evaluate the respective impact of sequence and assignment optimization, proposes new ways of combining the optimization of these two decision sets, and opens promising research perspectives for the CVRP and its variants.
URI: http://www.repositorio.ufop.br/handle/123456789/11371
metadata.dc.identifier.uri2: https://www.sciencedirect.com/science/article/pii/S0305054818303356
metadata.dc.identifier.doi: https://doi.org/10.1016/j.cor.2018.12.023
ISSN: 0305-0548
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_HeuristicsVehicleRouting.pdf1,42 MBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.