Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems

DOI10.1016/J.DAM.2023.12.004MaRDI QIDQ6153465OpenAlexFDO

Authors Jean Bertrand Gauthier, Stefan Irnich

Publication date 14 February 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2023.12.004

zbMATH Keywords

local searchroutingsequential searchdynamic-radius searchinter-depot

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Mathematical programming (90Cxx) Operations research, mathematical programming (90-XX)

Recommendations

• The multi-depot vehicle routing problem with inter-depot routes
• A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem
• Implicit depot assignments and rotations in vehicle routing heuristics
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
• Creating very large scale neighborhoods out of smaller ones by compounding moves

Cites work

• scientific article; zbMATH DE number 1016966 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A method for solving traveling-salesman problems
• A note on single alternating cycle neighborhoods for the TSP
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• A unified modeling and solution framework for vehicle routing and local search-based metaheuristics
• A unified solution framework for multi-attribute vehicle routing problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An efficient implementation of local search algorithms for constrained routing problems
• Computer Solutions of the Traveling Salesman Problem
• Designing granular solution methods for routing problems with time windows
• Fast Algorithms for Geometric Traveling Salesman Problems
• Fast local search algorithms for the handicapped persons transportation problem
• Large-step Markov chains for the TSP incorporating local search heuristics
• Resource extension functions: properties, inversion, and generalization to segments
• Sequential search and its application to vehicle-routing problems
• The granular tabu search and its application to the vehicle-routing problem
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
• Variable neighborhood search: basics and variants

This page was built for publication: Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems

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