A New Algorithm To Solve Vehicle Routing Problems (VRPs)

DOI10.1080/0020716022000005537zbMath1065.90014OpenAlexW2016007475MaRDI QIDQ4709847

No author found.

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

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

Related Items (1)

A distance function for computing on finite subsets of Euclidean spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Tabu Search—Part II
• Commentary—Progress in Linear Programming
• Branch-and-Bound Methods: A Survey

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