Large neighborhoods with implicit customer selection for vehicle routing problems with profits.

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorVidal, Thibaut Victor Gaston-
Autor(es): dc.creatorMaculan Filho, Nelson-
Autor(es): dc.creatorOchi, Luiz Satoru-
Autor(es): dc.creatorPenna, Puca Huachi Vaz-
Data de aceite: dc.date.accessioned2025-08-21T15:46:39Z-
Data de disponibilização: dc.date.available2025-08-21T15:46:39Z-
Data de envio: dc.date.issued2018-01-30-
Data de envio: dc.date.issued2018-01-30-
Data de envio: dc.date.issued2015-
Fonte completa do material: dc.identifierhttp://www.repositorio.ufop.br/handle/123456789/9377-
Fonte completa do material: dc.identifierhttps://pubsonline.informs.org/doi/10.1287/trsc.2015.0584#-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1287/trsc.2015.0584-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1023837-
Descrição: dc.descriptionWe consider several vehicle routing problems (VRP) with profits, which seek to select a subset of customers, each one being associated with a profit, and to design service itineraries. When the sum of profits is maximized under distance constraints, the problem is usually called the team orienteering problem. The capacitated profitable tour problem seeks to maximize profits minus travel costs under capacity constraints. Finally, in the VRP with a private fleet and common carrier, some customers can be delegated to an external carrier subject to a cost. Three families of combined decisions must be taken: customer’s selection, assignment to vehicles, and sequencing of deliveries for each route. We propose a new neighborhood search for these problems, which explores an exponential number of solutions in pseudo-polynomial time. The search is conducted with standard VRP neighborhoods on an exhaustive solution representation, visiting all customers. Since visiting all customers is usually infeasible or suboptimal, an efficient select algorithm, based on resource constrained shortest paths, is repeatedly used on any new route to find the optimal subsequence of visits to customers. The good performance of these neighborhood structures is demonstrated by extensive computational experiments with a local search, an iterated local search, and a hybrid genetic algorithm. Intriguingly, even a local-improvement method to the first local optimum of this neighborhood achieves an average gap of 0.09% on classic team orienteering benchmark instances, rivaling with the current state-of-the-art metaheuristics. Promising research avenues on hybridizations with more standard routing neighborhoods are also open.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Direitos: dc.rightsrestrito-
Palavras-chave: dc.subjectVehicle routing-
Palavras-chave: dc.subjectTeam orienteering-
Palavras-chave: dc.subjectLocal search-
Palavras-chave: dc.subjectLarge neighborhoods-
Título: dc.titleLarge neighborhoods with implicit customer selection for vehicle routing problems with profits.-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.