Intelligent Route Planner v1.00

The aim of this functionality is to design least cost routes from one or more central depots to a set of geographically scattered points, so called clients. Each point on the routes has to be visited only once by exactly one vehicle. All routes start and end at one of the central depots and the total demand of all the clients on one route must not exceed vehicle capacity.

There are multiple variations of above problem, i.e.:
VRPTW - Vehicle Routing Problem with Time Windows - one depot, homogeneous fleet of vehicles,
CVRP - Capacity VRP - vehicles have defined capacities,
MDVRPTW - Multi-Depot VRPTW - many depots, homogeneous fleet,
SDVRPTW - Site Dependant VRPTW - one depot, vehicles may vary,
RDPTW - Rich Delivery PTW - more general problem combining above 3.

Presented module "Intelligent Route Planner" solves all above mentioned problems plus:
Additional item and vehicle dimensions are taken into consideration,
Vehicle estimated unit cost is used in Cost Function