A GVNS algorithm for solving the multi-depot vehicle routing problem

DOI10.1016/j.endm.2018.03.022zbMath1408.90331OpenAlexW2796800512MaRDI QIDQ1791946

Marcone Jamilson Freitas Souza, Sinaide Nunes Bezerra, Sérgio Ricardo de Souza

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.03.022

zbMATH Keywords

combinatorial optimizationmulti-depot vehicle routing problemgeneral variable neighborhood search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (4)

Time-dependent multi-depot green vehicle routing problem with time windows considering temporal-spatial distance ⋮ An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ A general VNS for the multi-depot open vehicle routing problem with time windows ⋮ A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction

Cites Work

• A hybrid algorithm for a class of vehicle routing problems
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation
• A general heuristic for vehicle routing problems
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• Variable neighbourhood search: Methods and applications
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• 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: A GVNS algorithm for solving the multi-depot vehicle routing problem