Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
From MaRDI portal
Publication:2676276
DOI10.1016/j.cor.2022.105856OpenAlexW4224882453WikidataQ114671549 ScholiaQ114671549MaRDI QIDQ2676276
Stefan Voigt, Pirmin Fontaine, Markus Frank, Heinrich Kuhn
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105856
metaheuristicsmulti-depot vehicle routing problemadaptive large neighborhood searchlocation routing problemtwo-echelon vehicle routing problem
Related Items (2)
Hybridizations of evolutionary algorithms with large neighborhood search ⋮ Drone location and vehicle fleet planning with trucks and aerial drones
Uses Software
Cites Work
- A survey of recent research on location-routing problems
- A hybrid algorithm for a class of vehicle routing problems
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A large neighbourhood based heuristic for two-echelon routing problems
- 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
- A general heuristic for vehicle routing problems
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A two-phase tabu search approach to the location routing problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
- A survey of the standard location-routing problem
- Knowledge-guided local search for the vehicle routing problem
- A tabu search heuristic for the multi-depot vehicle routing problem
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Implicit depot assignments and rotations in vehicle routing heuristics
- A survey of variants and extensions of the location-routing problem
- A progressive filtering heuristic for the location-routing problem and variants
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
This page was built for publication: Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
