A GVNS algorithm for solving the multi-depot vehicle routing problem.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorBezerra, Sinaide Nunes-
Autor(es): dc.creatorSouza, Sérgio Ricardo de-
Autor(es): dc.creatorSouza, Marcone Jamilson Freitas-
Data de aceite: dc.date.accessioned2025-08-21T15:43:53Z-
Data de disponibilização: dc.date.available2025-08-21T15:43:53Z-
Data de envio: dc.date.issued2019-05-28-
Data de envio: dc.date.issued2019-05-28-
Data de envio: dc.date.issued2018-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/11356-
Fonte completa do material: dc.identifierhttps://www.sciencedirect.com/science/article/pii/S1571065318300684-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.endm.2018.03.022-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1022740-
Descrição: dc.descriptionThis 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectGeneral Variable Neighborhood Search-
Palavras-chave: dc.subjectCombinatorial optimization-
Título: dc.titleA GVNS algorithm for solving the multi-depot vehicle routing problem.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.