New version of the BBS method and its usage for determining and scheduling vehicle routes

The work presents a method of the vehicle routing and scheduling using the modified Branch and Bound Simulation method for vehicles simultaneously carrying loads from multiple orders. Limitations concerning vehicle loads and time windows in pickup and delivery points are taken into consideration. The developed algorithm appoints the shortest, the fastest and the cheapest routes with a certain known accuracy. A modification of the BBS method is described A sample of result using Google API is shown.