A progressive filtering heuristic for the location-routing problem and variants
From MaRDI portal
Publication:2668599
DOI10.1016/j.cor.2020.105166OpenAlexW3112394384MaRDI QIDQ2668599
Florian Arnold, Kenneth Sörensen
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105166
Related Items (2)
Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions ⋮ A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group
Uses Software
Cites Work
- Unnamed Item
- A survey of recent research on location-routing problems
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- A large neighbourhood based heuristic for two-echelon routing problems
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Using clustering analysis in a capacitated location-routing problem
- The effect of ignoring routes when locating depots
- A two-phase tabu search approach to the location routing problem
- A survey of the standard location-routing problem
- Knowledge-guided local search for the vehicle routing problem
- Efficiently solving very large-scale routing problems
- New benchmark instances for the capacitated vehicle routing problem
- A concise guide to existing and emerging vehicle routing problem variants
- How to assess and report the performance of a stochastic algorithm on a benchmark problem: \textit{mean} or \textit{best} result on a number of runs?
- A survey of variants and extensions of the location-routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
- Guided Local Search
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Two-stage heuristic algorithm for the large-scale capacitated location routing problem
This page was built for publication: A progressive filtering heuristic for the location-routing problem and variants
