Large neighborhood search for multi-trip vehicle routing

•Multi-trip operators are proposed and compared with classical techniques.•One of the proposed ALNS heuristics provides state-of-the-art results.•An automatic configuration tool is used to analyze algorithmic components.•The roulette wheel cannot effectively replace an offline heuristic selection. W...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 255; číslo 2; s. 422 - 441
Hlavní autoři: François, Véronique, Arda, Yasemin, Crama, Yves, Laporte, Gilbert
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.12.2016
Elsevier Sequoia S.A
Elsevier Science
Témata:
Algorithm configuration
Automatic algorithm configuration
Benchmarking
Business & economic sciences
Customers
Heuristic
Integer programming
Large neighborhood search
Motor vehicle fleets
Multi-trip
Operational research
Packing problem
Problem solving
Production, distribution & gestion de la chaîne logistique
Production, distribution & supply chain management
Route selection
Sciences économiques & de gestion
Searching
Solution space
Studies
Transportation
Vehicle routing
Vehicles
Automatic algorithm configuration
Vehicle routing
Multi-trip
Large neighborhood search
Transportation
ISSN:0377-2217, 1872-6860, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Multi-trip operators are proposed and compared with classical techniques.•One of the proposed ALNS heuristics provides state-of-the-art results.•An automatic configuration tool is used to analyze algorithmic components.•The roulette wheel cannot effectively replace an offline heuristic selection. We consider the multi-trip vehicle routing problem, in which each vehicle can perform several routes during the same working shift to serve a set of customers. The problem arises when customers are close to each other or when their demands are large. A common approach consists of solving this problem by combining vehicle routing heuristics with bin packing routines in order to assign routes to vehicles. We compare this approach with a heuristic that makes use of specific operators designed to tackle the routing and the assignment aspects of the problem simultaneously. Two large neighborhood search heuristics are proposed to perform the comparison. We provide insights into the configuration of the proposed algorithms by analyzing the behavior of several of their components. In particular, we question the impact of the roulette wheel mechanism. We also observe that guiding the search with an objective function designed for the multi-trip case is crucial even when exploring the solution space of the vehicle routing problem. We provide several best known solutions for benchmark instances.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
scopus-id:2-s2.0-84969924840
ISSN:0377-2217
1872-6860
1872-6860
DOI:10.1016/j.ejor.2016.04.065