Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Paul Shaw · Lecture notes in computer science · 1998
Cited by 1,366 works. doi:10.1007/3-540-49481-2_30
Authors
References
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Probabilistic diversification and intensification in local search for vehicle routing
- Vehicle Routing Problem
- A Computational Study of the Job-Shop Scheduling Problem
- Parallel iterative search methods for vehicle routing problems
- Local Search in Combinatorial Optimization
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees