A Vehicle Routing Algorithm

Abstract

The Vehicle Scheduling Problem (VSP) is to assign specific routes to a fleet of delivery vehicles so that management's standards of operational efficiency and customer service are both satisfied. The basic format requires all carriers to operate from a common depot and to furnish any particular order with a single drop. In addition, total loads must be within each vehicle's capacity limit and distributed during the driver's statutory working day, whilst a variety of further constraints may have to be taken into account as circumstances dictate.

Citation

Buxey, G. (1982), "A Vehicle Routing Algorithm", Management Research News, Vol. 4 No. 3, pp. 14-15. https://doi.org/10.1108/eb027791