Given a daily and variable goods transportation request list (or order list) with different pickup and dropoff points, at different times of day, we need to generate automatically the vehicle schedules & routes for a fleet of vehicles of different load capacities and different physical constraints so that we transport the maximum number of goods with a minimum of fleet mileage and without violating the users requested times and other operating rules. For example:
We receive daily about 9000 transportation requests. Each transportation request goes from an origen (point A) to a destination (point B) which may be diferent between themselves. Each order has a specific requested pickup time or a requested dropoff time, or both, and must meet delivery time tolerances of -15 minutes to +15 minutes.
Each order has also a specific load time and unload time which are known in advance. Some orders can go in any vehicle while others must go in specific vehicles. Refrigerated goods must go in vehicles with cooling systems. Some goods are not compatible among themselves and cannot share the same vehicle. Regrigerated goods cannot travel mixed with unrefrigerated goods. Goods from different clients can travel together provided it is efficient from the mileage perspective and the goods are compatible between themselves and compatible with the type of vehicles.
We have a fleet of 300 vehicles of different load capacities. Some vehicles can only carry liquid or solid goods while others can carry a variable combination of both. The capacity combination of liquids or solids can also vary dynamically on route depending on the number and type of goods to be loaded at the next stop. The operation of vehicles must meet some labour laws which requires at least 3 rest breaks of different durations during the day. Some breaks can be taken on route while others must be taken at specific locations.
The vehicles start their routes from different locations, normally from different garages or from the drivers' home locations. The required starting and ending time of vehicle routes may also be different for all vehicles.
A vehicle schedule must be produced that meets the above requirements, or as many as possible, at minimum cost.
Simple example of integration of our software with
your existing application for goods distribution
