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
From MaRDI portal
Publication:2108102
DOI10.1016/j.cor.2022.106016OpenAlexW4294904133MaRDI QIDQ2108102
Marcone Jamilson Freitas Souza, Sinaide Nunes Bezerra, Sérgio Ricardo de Souza
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106016
local searchvariable neighborhood searchneighborhoodmulti-depot vehicle routing problem with time windows
Related Items (3)
A general VNS for the multi-depot open vehicle routing problem with time windows ⋮ Machine learning augmented approaches for hub location problems ⋮ Variable neighborhood search: the power of change and simplicity
Uses Software
Cites Work
- Unnamed Item
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A general heuristic for vehicle routing problems
- Variable neighbourhood search: methods and applications
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- Variable neighborhood search
- Variable neighborhood search: basics and variants
- A GVNS algorithm for solving the multi-depot vehicle routing problem
- High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows
- Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Implicit depot assignments and rotations in vehicle routing heuristics
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- New measures of proximity for the assignment algorithms in the MDVRPTW
- Multi-depot vehicle routing problem with time windows under shared depot resources
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
This page was built for publication: 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
