Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

G. Clarke and J. W. Wright
Additional contact information
G. Clarke: Cooperative Wholesale Society, Manchester, England
J. W. Wright: College of Science and Technology, University of Manchester, England

Operations Research, 1964, vol. 12, issue 4, 568-581

Abstract: The optimum routing of a fleet of trucks of varying capacities from a central depot to a number of delivery points may require a selection from a very large number of possible routes, if the number of delivery points is also large. This paper, after considering certain theoretical aspects of the problem, develops an iterative procedure that enables the rapid selection of an optimum or near-optimum route. It has been programmed for a digital computer but is also suitable for hand computation.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (469)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.4.568 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:12:y:1964:i:4:p:568-581

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().