Adaptive multi-restart Tabu Search algorithm for the vehicle routing problem with cross-docking

This paper deals with a multi-source vehicle routing problem with a cross-docking facility, and studies open and closed network configurations as well as practically relevant dependency rules and consolidation decisions. Given a set of supplier–customer pairs with known demands, the aim is to design...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Optimization letters Ročník 7; číslo 7; s. 1583 - 1596
Hlavný autor: Tarantilis, Christos D.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2013
Predmet:
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Cross-docking
Vehicle routing
Tabu Search
ISSN:1862-4472, 1862-4480
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper deals with a multi-source vehicle routing problem with a cross-docking facility, and studies open and closed network configurations as well as practically relevant dependency rules and consolidation decisions. Given a set of supplier–customer pairs with known demands, the aim is to design minimum cost routes for the transportation of products via a cross-dock. Vehicles cannot travel directly from suppliers to customers, and thus, products arriving from inbound vehicles are sorted and consolidated onto outbound vehicles. The proposed method utilizes an adaptive multi-restart local search framework. For this purpose, a Tabu Search algorithm is employed, while the execution of the re-starting mechanism is based on the information extracted from a reference set of solutions. Computational experiments illustrate the efficiency and effectiveness of the proposed method. Compared to existing results, new improved upper bounds are reported.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-012-0558-5