A large neighbourhood based heuristic for two-echelon routing problems
Publication:342576
DOI10.1016/j.cor.2016.06.014zbMath1349.90073arXiv1505.08003WikidataQ59389533 ScholiaQ59389533MaRDI QIDQ342576
Richard F. Hartl, Verena Schmid, Thibaut Vidal, U. Breunig
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.08003
heuristic; multi-depot vehicle routing problem; large neighbourhood search; split delivery vehicle routing problem; city logistics; variable neighbourhood search; capacitated vehicle routing problem; adaptive large neighbourhood search; two-echelon vehicle routing problem; covariance matrix adaptation evolution strategy; two-echelon location routing problem with single depot; wo-echelon location routing problem
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
Related Items
Uses Software
Cites Work
- Unnamed Item
- A survey on two-echelon routing problems
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- A comparative study of heuristics for a two-level routing-location problem
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- Record breaking optimization results using the ruin and recreate principle
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A guide to vehicle routing heuristics
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
- A Method for Solving Traveling-Salesman Problems