Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads.

dc.contributor.authorHaddad, Matheus Nohra
dc.contributor.authorPinto, Rafael Martinelli
dc.contributor.authorVidal, Thibaut Victor Gaston
dc.contributor.authorMartins, Simone de Lima
dc.contributor.authorOchi, Luiz Satoru
dc.contributor.authorSouza, Marcone Jamilson Freitas
dc.contributor.authorHartl, Richard
dc.date.accessioned2019-06-03T13:43:32Z
dc.date.available2019-06-03T13:43:32Z
dc.date.issued2018
dc.description.abstractWe consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notoriously difficult due to the interaction of two challenging vehicle routing attributes, “pickups and deliveries” and “split deliveries”. This possibly leads to optimal solutions of a size that grows exponentially with the instance size, containing multiple visits per customer pair, even in the same route. To solve this problem, we propose an iterated local search metaheuristic as well as a branch-and-price algorithm. The core of the metaheuristic consists of a new large neighborhood search, which reduces the problem of finding the best insertion combination of a pickup and delivery pair into a route (with possible splits) to a resource-constrained shortest path and knapsack problem. Similarly, the branch-and-price algorithm uses sophisticated labeling techniques, route relaxations, pre-processing and branching rules for an efficient resolution. Our computational experiments on classical single-vehicle instances demonstrate the excellent performance of the metaheuristic, which produces new best known solutions for 92 out of 93 test instances, and outperforms all previous algorithms. Experimental results on new multi-vehicle instances with distance constraints are also reported. The branch-and-price algorithm produces optimal solutions for instances with up to 20 pickup-and-delivery pairs, and very accurate solutions are found by the metaheuristic.pt_BR
dc.identifier.citationHADDAD, M. N. et al. Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. European Journal of Operational Research, v. 270, n. 3, p. 1014-1027, nov. 2018. Disponível em: <https://www.sciencedirect.com/science/article/pii/S0377221718303205>. Acesso em: 19 mar. 2019.pt_BR
dc.identifier.doihttps://doi.org/10.1016/j.ejor.2018.04.017pt_BR
dc.identifier.issn0377-2217
dc.identifier.urihttp://www.repositorio.ufop.br/handle/123456789/11363
dc.identifier.uri2https://www.sciencedirect.com/science/article/pii/S0377221718303205pt_BR
dc.language.isoen_USpt_BR
dc.rightsrestritopt_BR
dc.subjectTransportationpt_BR
dc.subjectVehicle routingpt_BR
dc.titleLarge neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads.pt_BR
dc.typeArtigo publicado em periodicopt_BR

Arquivos

Pacote original

Agora exibindo 1 - 1 de 1
Nenhuma Miniatura Disponível
Nome:
ARTIGO_LargeNeighborhoodBased.pdf
Tamanho:
728.52 KB
Formato:
Adobe Portable Document Format

Licença do pacote

Agora exibindo 1 - 1 de 1
Nenhuma Miniatura Disponível
Nome:
license.txt
Tamanho:
924 B
Formato:
Item-specific license agreed upon to submission
Descrição: