Por favor, use este identificador para citar o enlazar este ítem:
http://www.repositorio.ufop.br/jspui/handle/123456789/11356| Título : | A GVNS algorithm for solving the multi-depot vehicle routing problem. |
| Autor : | Bezerra, Sinaide Nunes Souza, Sérgio Ricardo de Souza, Marcone Jamilson Freitas |
| Palabras clave : | General Variable Neighborhood Search Combinatorial optimization |
| Fecha de publicación : | 2018 |
| Citación : | 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: <https://www.sciencedirect.com/science/article/pii/S1571065318300684>. Acesso em: 19 mar. 2019. |
| Resumen : | 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. |
| URI : | http://www.repositorio.ufop.br/handle/123456789/11356 |
| metadata.dc.identifier.uri2: | https://www.sciencedirect.com/science/article/pii/S1571065318300684 |
| metadata.dc.identifier.doi: | https://doi.org/10.1016/j.endm.2018.03.022 |
| ISSN : | 1571-0653 |
| Aparece en las colecciones: | DECOM - Artigos publicados em periódicos |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| ARTIGO_GVNSAlgorithmSolving.pdf Restricted Access | 205,73 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.