Please use this identifier to cite or link to this item: http://www.repositorio.ufop.br/handle/123456789/11367
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPenna, Puca Huachi Vaz-
dc.contributor.authorSubramanian, Anand-
dc.contributor.authorOchi, Luiz Satoru-
dc.contributor.authorVidal, Thibaut Victor Gaston-
dc.contributor.authorPrins, Christian-
dc.date.accessioned2019-06-03T14:01:56Z-
dc.date.available2019-06-03T14:01:56Z-
dc.date.issued2019-
dc.identifier.citationPENNA, P. H. V. et al. A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Annals of Operations Research, v. 273, n. 1-2, p. 5–74, fev. 2019. Disponível em: <https://link.springer.com/article/10.1007/s10479-017-2642-9>. Acesso em: 19 mar. 2019.pt_BR
dc.identifier.issn1572-9338-
dc.identifier.urihttp://www.repositorio.ufop.br/handle/123456789/11367-
dc.description.abstractWe consider a family of rich vehicle routing problems (RVRP) which have the particularity to combine a heterogeneous fleet with other attributes, such as backhauls, multiple depots, split deliveries, site dependency, open routes, duration limits, and time windows. To efficiently solve these problems, we propose a hybrid metaheuristic which combines an iterated local search with variable neighborhood descent, for solution improvement, and a set partitioning formulation, to exploit the memory of the past search. Moreover, we investigate a class of combined neighborhoods which jointly modify the sequences of visits and perform either heuristic or optimal reassignments of vehicles to routes. To the best of our knowledge, this is the first unified approach for a large class of heterogeneous fleet RVRPs, capable of solving more than 12 problem variants. The efficiency of the algorithm is evaluated on 643 well-known benchmark instances, and 71.70% of the best known solutions are either retrieved or improved. Moreover, the proposed metaheuristic, which can be considered as a matheuristic, produces high quality solutions with low standard deviation in comparison with previous methods. Finally, we observe that the use of combined neighborhoods does not lead to significant quality gains. Contrary to intuition, the computational effort seems better spent on more intensive route optimization rather than on more intelligent and frequent fleet re-assignments.pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectRich vehicle routingpt_BR
dc.subjectMatheuristicspt_BR
dc.subjectSet partitioningpt_BR
dc.subjectIterated local searchpt_BR
dc.titleA hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet.pt_BR
dc.typeArtigo publicado em periodicopt_BR
dc.identifier.uri2https://link.springer.com/article/10.1007%2Fs10479-017-2642-9pt_BR
dc.identifier.doihttps://doi.org/10.1007/s10479-017-2642-9pt_BR
Appears in Collections:DECOM - Artigos publicados em periódicos

Files in This Item:
File Description SizeFormat 
ARTIGO_HybridHeuristBroad.pdf965,03 kBAdobe PDFView/Open    Request a copy


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