Problema de Roteamento de Veículos Multiobjetivo com Coleta Seletiva

Translated title of the contribution: Multiobjective Vehicle Routing Problem with Optional Collections

Luciana Pereira de Assis, André Luiz Maravilha Silva, Felipe Campelo Franca Pinto, Alessandro Vivas Andrade, Jaime Arturo Ramírez

Research output: Chapter in Book/Published conference outputChapter (peer-reviewed)peer-review


This chapter presents a multiobjective approach for the vehicle routing problem with optional collections, whose objectives are the minimization of the route costs and of the not fulfilled collection- demands. It proposes a data structure that best suits the problem, neighborhood structures that exploit both goals of the problem and an algorithm that checks the feasibility of a solution with lower computational cost. To solve the problem, three metaheuristics are discussed: the multiobjective iterated local search (MOILS), NSGA-II and the e-Constrained method, which are applied to fourteen instances containing between 50 and 199 customers. The results indicate that the MOILS outperforms the other approaches, obtaining significantly better average values for coverage, hypervolume and cardinality over the set of used test problems.
Translated title of the contributionMultiobjective Vehicle Routing Problem with Optional Collections
Original languagePortuguese
Title of host publicationMeta-Heurísticas em Pesquisa Operacional.
Publication statusPublished - 9 May 2013


Dive into the research topics of 'Multiobjective Vehicle Routing Problem with Optional Collections'. Together they form a unique fingerprint.

Cite this