Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
From MaRDI portal
Publication:6153465
DOI10.1016/j.dam.2023.12.004OpenAlexW4390081785MaRDI QIDQ6153465
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
Mathematical programming (90Cxx) Operations research and management science (90Bxx) Operations research, mathematical programming (90-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient implementation of local search algorithms for constrained routing problems
- Large-step Markov chains for the TSP incorporating local search heuristics
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Designing granular solution methods for routing problems with time windows
- Variable neighborhood search: basics and variants
- Resource extension functions: properties, inversion, and generalization to segments
- Sequential search and its application to vehicle-routing problems
- A unified solution framework for multi-attribute vehicle routing problems
- A note on single alternating cycle neighborhoods for the TSP
- Fast local search algorithms for the handicapped persons transportation problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
- Fast Algorithms for Geometric Traveling Salesman Problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
- An Exchange Heuristic for Routeing Problems with Time Windows
- A Method for Solving Traveling-Salesman Problems
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
