Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions

DOI10.1016/J.COR.2022.105856MaRDI QIDQ2676276zbMATH OpenOpenAlexWikidataFDO

Authors Stefan Voigt, Markus Frank, Pirmin Fontaine, 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

zbMATH Keywords

adaptive large neighborhood searchlocation routing problemmetaheuristicsmulti-depot vehicle routing problemtwo-echelon vehicle routing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics
• An adaptive large neighborhood search for the periodic vehicle routing problem
• Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
• A hybrid large neighborhood search for dynamic vehicle routing problem with time deadline
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation

Cites work

• A general heuristic for vehicle routing problems
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• A hybrid algorithm for a class of vehicle routing problems
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• A large neighbourhood based heuristic for two-echelon routing problems
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
• A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
• A progressive filtering heuristic for the location-routing problem and variants
• A simple and effective evolutionary algorithm for the capacitated location-routing problem
• A survey of recent research on location-routing problems
• A survey of the standard location-routing problem
• A survey of variants and extensions of the location-routing problem
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A tabu search heuristic for the multi-depot vehicle routing problem
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• A two-phase tabu search approach to the location routing problem
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• 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
• 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
• Knowledge-guided local search for the vehicle routing problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
• The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
• Using clustering analysis in a capacitated location-routing problem

Cited in

(17)

• Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
• Hybridizations of evolutionary algorithms with large neighborhood search
• Drone location and vehicle fleet planning with trucks and aerial drones
• An improved hybrid genetic search with data mining for the CVRP
• An adaptive large neighborhood search for the multi-point dynamic aggregation problem
• Rule-based design of a granular tabu search for the multi-depot vehicle routing problem
• The two-echelon vehicle routing problem with pickups, deliveries, and deadlines
• Mathematical models and heuristics for double-load crane scheduling in slab yards
• Last mile delivery routing problem with some-day option
• The location routing problem with time windows and load-dependent travel times for cargo bikes
• A review and ranking of operators in adaptive large neighborhood search for vehicle routing problems
• Driver-centric urban logistics optimization: vehicle routing with heterogeneous fixed drivers
• A two-step large neighborhood search for a collaborative two-tier city logistics system
• Recent developments in location-routing problems. Deterministic single-echelon, single-objective, single-period problems
• E-cargo bike route optimization with rider fatigue considerations: a chance-constrained programming approach
• Enhanced approximation algorithms for the capacitated location routing problem
• Research on inventory routing optimization considering multi-temperature joint distribution of mechanical and insulated container

Describes a project that uses

Uses Software

• METSlib
• VRP

This page was built for publication: Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676276)