A large neighbourhood based heuristic for two-echelon routing problems
From MaRDI portal
Publication:342576
DOI10.1016/J.COR.2016.06.014zbMATH Open1349.90073DBLPjournals/cor/BreunigSHV16arXiv1505.08003OpenAlexW2593437733WikidataQ59389533 ScholiaQ59389533MaRDI QIDQ342576FDOQ342576
Authors: U. Breunig, V. Schmid, Richard F. Hartl, T. Vidal 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Abstract: In this paper, we address two optimisation problems arising in the context of city logistics and two-level transportation systems. The two-echelon vehicle routing problem and the two-echelon location routing problem seek to produce vehicle itineraries to deliver goods to customers, with transits through intermediate facilities. To efficiently solve these problems, we propose a hybrid metaheuristic which combines enumerative local searches with destroy-and-repair principles, as well as some tailored operators to optimise the selections of intermediate facilities. We conduct extensive computational experiments to investigate the contribution of these operators to the search performance, and measure the performance of the method on both problem classes. The proposed algorithm finds the current best known solutions, or better ones, for 95% of the two-echelon vehicle routing problem benchmark instances. Overall, for both problems, it achieves high-quality solutions within short computing times. Finally, for future reference, we resolve inconsistencies between different versions of benchmark instances, document their differences, and provide them all online in a unified format.
Full work available at URL: https://arxiv.org/abs/1505.08003
Recommendations
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- A survey on two-echelon routing problems
- A variable neighborhood search approach for the two-echelon location-routing problem
- Lower and upper bounds for the two-echelon capacitated location-routing problem
heuristiclarge neighbourhood searchsplit delivery vehicle routing problemcity logisticsvariable neighbourhood searchadaptive large neighbourhood searchcapacitated vehicle routing problemtwo-echelon vehicle routing problemcovariance matrix adaptation evolution strategymulti-depot vehicle routing problemtwo-echelon location routing problem with single depotwo-echelon location routing problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- A method for solving traveling-salesman problems
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A comparative study of heuristics for a two-level routing-location problem
- Record breaking optimization results using the ruin and recreate principle
- 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
- Title not available (Why is that?)
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- 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 survey on two-echelon routing problems
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- A guide to vehicle routing heuristics
- An exact algorithm for the two-echelon capacitated vehicle routing problem
Cited In (27)
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- A neighborhood search and set cover hybrid heuristic for the two-echelon vehicle routing problem
- A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach
- A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
- Two-echelon vehicle routing problem with satellite bi-synchronization
- A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
- Two-echelon vehicle routing problems: a literature review
- A concise guide to existing and emerging vehicle routing problem variants
- The vehicle routing problem with arrival time diversification on a multigraph
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- A survey on two-echelon routing problems
- An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization
- A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
- A progressive filtering heuristic for the location-routing problem and variants
- A variable neighborhood search approach for the two-echelon location-routing problem
- Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
- The electric two-echelon vehicle routing problem
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services
- A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
- Combining very large scale and ILP based neighborhoods for a two-level location problem
- A time-division distribution strategy for the two-echelon vehicle routing problem with demand blowout
Uses Software
This page was built for publication: A large neighbourhood based heuristic for two-echelon routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342576)
