A New Algorithm To Solve Vehicle Routing Problems (VRPs)

DOI10.1080/0020716022000005537MaRDI QIDQ4709847zbMATH OpenOpenAlexFDO

Authors

Publication date 2003

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020716022000005537

zbMATH Keywords

Simulated Annealing (SA), Vehicle Routing Problems (VRPs), Temporal Constraints, Technological Constraints, Genetic Algorithms (GA)

Mathematics Subject Classification ID

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

Recommendations

• A new approach to partial constraint satisfaction problems
• Tabu Search for Vehicle Routing Problems (VRPs)
• A genetic algorithm for the vehicle routing problem
• scientific article; zbMATH DE number 1082107
• Solving a vehicle routing problem by balancing the vehicles time utilization.

Cites work

• Branch-and-Bound Methods: A Survey
• Commentary—Progress in Linear Programming
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 194622 (Why is no real title available?)
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Tabu Search—Part II

Cited in

(6)

• An open source spreadsheet solver for vehicle routing problems
• A distance function for computing on finite subsets of Euclidean spaces
• scientific article; zbMATH DE number 5846596 (Why is no real title available?)
• A new approach to partial constraint satisfaction problems
• Tabu Search for Vehicle Routing Problems (VRPs)
• scientific article; zbMATH DE number 7366007 (Why is no real title available?)

This page was built for publication: A New Algorithm To Solve Vehicle Routing Problems (VRPs)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709847)