Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/jspui/handle/123456789/4280
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCruz, Raphael Carlos-
dc.contributor.authorSilva, Thaís Cotta Barbosa da-
dc.contributor.authorSouza, Marcone Jamilson Freitas-
dc.contributor.authorCoelho, Vitor Nazário-
dc.contributor.authorMine, Marcio Tadayuki-
dc.contributor.authorMartins, Alexandre Xavier-
dc.date.accessioned2015-01-20T15:32:44Z-
dc.date.available2015-01-20T15:32:44Z-
dc.date.issued2012-
dc.identifier.citationCRUZ, R. C. GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery. Electronic Notes in Discrete Mathematics, v. 39, p. 217-224, 2012. Disponível em: <http://www.sciencedirect.com/science/article/pii/S1571065312000303>. Acesso em: 13 jan. 2015.pt_BR
dc.identifier.issn1571-0653-
dc.identifier.urihttp://www.repositorio.ufop.br/handle/123456789/4280-
dc.description.abstractThis work addresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). Due to its complexity, we propose a heuristic algorithm for solving it, so-called GENVNS-TS-CL-PR. This algorithm combines the heuristic procedures Cheapest Insertion, Cheapest Insertion with multiple routes, GENIUS, Variable Neighborhood Search (VNS), Variable Neighborhood Descent (VND), Tabu Search (TS) and Path Relinking (PR). The first three procedures aim to obtain an good initial solution, and the VND and TS are used as local search methods for VNS. TS is called after some iterations without any improvement through of the VND. The PR procedure is called after each VNS iteration and it connects a local optimum with an elite solution generated during the search. The algorithm uses an strategy based on Candidate List to reduce the number of solutions evaluated in the solution space. The algorithm was tested on benchmark instances taken from the literature and it was able to generate high quality solutions.pt_BR
dc.language.isoen_USpt_BR
dc.subjectVariable neighborhood descentpt_BR
dc.subjectTabu searchpt_BR
dc.titleGENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery.pt_BR
dc.typeArtigo publicado em periodicopt_BR
dc.rights.licenseO periódico Electronic Notes in Discrete Mathematics concede permissão para depósito do artigo no Repositório Institucional da UFOP. Número da licença: 3547111464762.pt_BR
dc.identifier.doihttps://doi.org/10.1016/j.endm.2012.10.029-
Appears in Collections:DEENP - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_GENVNS-TS-CL-PRHeuristicApproach.pdf172,6 kBAdobe PDFView/Open


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