Solving real-life vehicle routing problems efficiently using tabu search
Annals of Operations Research - Special issue on Tabu search
Modern heuristic techniques for combinatorial problems
Heuristic solutions to multi-depot location-routing problems
Computers and Operations Research
Formulations and relaxations for a multi-echelon capacitated location-distribution problem
Computers and Operations Research
Two memetic algorithms for heterogeneous fleet vehicle routing problems
Engineering Applications of Artificial Intelligence
A tabu search heuristic for the truck and trailer routing problem
Computers and Operations Research
A GRASP×ELS approach for the capacitated location-routing problem
Computers and Operations Research
A Branch-and-Cut method for the Capacitated Location-Routing Problem
Computers and Operations Research
A multi-start evolutionary local search for the two-echelon location routing problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A GRASP with evolutionary path relinking for the truck and trailer routing problem
Computers and Operations Research
A metaheuristic for a two echelon location-routing problem
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A variable neighborhood search approach for the two-echelon location-routing problem
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Engineering Applications of Artificial Intelligence
Capacitated location-routing problem with time windows under uncertainty
Knowledge-Based Systems
Hi-index | 0.00 |
The two-echelon location-routing problem (LRP-2E) is raised by the design of transportation networks with two types of trips: first-level trips serving from one main depot a set of satellite depots, to be located, and second-level trips supplying customers from these satellites. In the proposed multi-start iterated local search (MS-ILS), three greedy randomized heuristics are used cyclically to get initial solutions. Each ILS run alternates between two search spaces: LRP-2E solutions, and travelling salesman (TSP) tours covering the main depot and the customers. The number of iterations allotted to a run is reduced whenever a known solution (stored in a tabu list) is revisited. MS-ILS can be reinforced by a path-relinking procedure (PR), used internally for intensification, as post-optimization, or both. On two sets with 24 and 30 LRP-2E instances, MS-ILS outperforms on average two GRASP algorithms and adding PR brings a further improvement. Our metaheuristic also surpasses a tabu search on 30 instances for a more general problem with several main depots. It is still effective on a particular case, the capacitated location-routing problem (CLRP): In a comparison with four published metaheuristics, only one (LRGTS, Prins et al., 2007) does better.