Abstract
The problem of scheduling delivery vehicles from a number of depots to customers, subject to constraints on load and distance or time, is considered. A new algorithm is presented; this allows routes from several depots to be constructed simultaneously, subject to restrictions on numbers of vehicles at individual depots. Where too many customers require service, a flexible priority rule will select those to be served. Results for the single depot case are compared with other known algorithms; further results are given and discussed for cases of several depots.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
†Now with United Glass Ltd.
Rights and permissions
About this article
Cite this article
Wren, A., Holliday, A. Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points. J Oper Res Soc 23, 333–344 (1972). https://doi.org/10.1057/jors.1972.53
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1972.53