GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorCruz, Raphael Carlos-
Autor(es): dc.creatorSilva, Thaís Cotta Barbosa da-
Autor(es): dc.creatorSouza, Marcone Jamilson Freitas-
Autor(es): dc.creatorCoelho, Vitor Nazário-
Autor(es): dc.creatorMine, Marcio Tadayuki-
Autor(es): dc.creatorMartins, Alexandre Xavier-
Data de aceite: dc.date.accessioned2019-11-06T13:31:53Z-
Data de disponibilização: dc.date.available2019-11-06T13:31:53Z-
Data de envio: dc.date.issued2015-01-20-
Data de envio: dc.date.issued2015-01-20-
Data de envio: dc.date.issued2012-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/4280-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/557365-
Descrição: dc.descriptionThis 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.-
Idioma: dc.languageen-
Direitos: dc.rightsO 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.-
Palavras-chave: dc.subjectVariable neighborhood descent-
Palavras-chave: dc.subjectTabu search-
Título: dc.titleGENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.