The Vehicle Routing Problem (VRP) is a mathematical model that closely approximates the real-world problems freight companies must deal with on a daily basis. Given the dynamic nature of these problems, VRP can have different levels of constraints and consequently many varied solving techniques. Different constraints on the VRP such as time constraints or the number of vehicles in a fleet, has brought about a need for tailor-made algorithms. Many hybrid techniques to solve the VRP have been established [1-3]. The success of these multiple strategy procedures on different types of problems and the underlining evidence that no one method has shown superiority in solving various versions of this problem has led to the investigation of an Adaptive Controller for resolving the VRP.
展开▼
