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
Recommendations
- A new variable neighborhood search algorithm for the multi depot heterogeneous vehicle routing problem with time windows
- An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints
- scientific article; zbMATH DE number 2118477
- Variable neighborhood search for vehicle routing problem with multiple time windows
- Local search and variable neighborhood: search algorithms for the vehicle routing problem with time windows
- Variable neighborhood descent for solving the vehicle routing problem with time windows
- Variable neighbourhood search for close–open vehicle routing problem with time windows
Cites work
- scientific article; zbMATH DE number 1749226 (Why is no real title available?)
- A GVNS algorithm for solving the multi-depot vehicle routing problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A general heuristic for vehicle routing problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A hybrid heuristic algorithm for the open-pit-mining operational planning problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A unified tabu search heuristic for vehicle routing problems with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows
- Implicit depot assignments and rotations in vehicle routing heuristics
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- Multi-depot vehicle routing problem with time windows under shared depot resources
- New measures of proximity for the assignment algorithms in the MDVRPTW
- Variable neighborhood search
- Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
- Variable neighborhood search: basics and variants
- Variable neighbourhood search: methods and applications
Cited in
(7)- A new variable neighborhood search algorithm for the multi depot heterogeneous vehicle routing problem with time windows
- An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems
- Models and local search algorithms for vehicle routing with returns and time windows
- Variable neighborhood search: the power of change and simplicity
- A general VNS for the multi-depot open vehicle routing problem with time windows
- Machine learning augmented approaches for hub location problems
- An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108102)
