资 源 简 介
Description:
VRPSolver is a wizard-like application which solves a basic Vehicle Routing Problem (VRP as it is known in the world of Operations Research) using the Savings Heuristic Method invented by Clarke and Wright in 1964.
A basic VRP consists of one warehouse and several nodes each of which has a demand to be fulfilled by delivery trucks based in the warehouse. These trucks will have a maximum capacity. The objective of solving this problem is to find the minimum number of routes which will add up to having the minimum total distance which will also maximize the utilization of truck capacity. This in turn would ensure the least distribution cost for the company.
Solving this problem requires a lot of effort if done manually because the complexity of this problem increases exponentially with each additional node. Another difficulty faced by users is that the solution needs to be recalculated each time a node is added or removed, location"s demand changes, etc.
O
