Please use this identifier to cite or link to this item:
Title: A GVNS algorithm for solving the multi-depot vehicle routing problem.
Authors: Bezerra, Sinaide Nunes
Souza, Sérgio Ricardo de
Souza, Marcone Jamilson Freitas
Keywords: General Variable Neighborhood Search
Combinatorial optimization
Issue Date: 2018
Citation: BEZERRA, S. N.; SOUZA, S. R. de; SOUZA, M. J. F. A GVNS algorithm for solving the multi-depot vehicle routing problem. Electronic Notes in Discrete Mathematics, v. 66, p. 167-174, abr. 2018. Disponível em: <>. Acesso em: 19 mar. 2019.
Abstract: This paper presents an algorithm based on the General Variable Neighborhood Search (GVNS) metaheuristic for solving the Multi-Depot Vehicle Routing Problem (MDVRP). The MDVRP consists in designing a set of vehicle routes serving all customers, such that the maximum number of vehicle per depot and vehicle-capacity are respected, and the total cost of transportation is minimized. The proposed algorithm uses Randomized Variable Neighborhood Descent (RVND) as local search method and it is tested in classical instances of the problem. The obtained results are presented and discussed in this paper.
ISSN: 1571-0653
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_GVNSAlgorithmSolving.pdf205,73 kBAdobe PDFView/Open    Request a copy

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