Two-phase algorithm for solving vehicle routing problem with time windows
From MaRDI portal
Recommendations
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- Variable neighborhood descent for solving the vehicle routing problem with time windows
Cites work
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- scientific article; zbMATH DE number 1488078 (Why is no real title available?)
- scientific article; zbMATH DE number 7067733 (Why is no real title available?)
- Hybrid Heuristics for the Vehicle Routing Problem with Time Windows
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- Tabu search heuristics for the vehicle routing problem with time windows.
- The truck dispatching problem
- The vehicle routing problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- Vehicle Routing Problem with Time Windows
Cited in
(3)- A new approach for solution of vehicle routing problem with hard time window: an application in a supermarket chain
- A two-phase solution algorithm for the flexible periodic vehicle routing problem
- A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows
This page was built for publication: Two-phase algorithm for solving vehicle routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097182)