article

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

Operations Research · 1964 · Vol. 12(4) · pp. 568–581

Graham Clarke✉(Co-operative College)J. W. Wright(Manchester University)

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.

Vehicle Routing Optimization Methods Advanced Manufacturing and Logistics Optimization Optimization and Packing ProblemsTruckComputer scienceScheduling (production processes)ComputationMathematical optimizationSelection (genetic algorithm)Routing (electronic design automation)Vehicle routing problemDepotOperations research

Citations

3,810

FWCI

2.69

field-weighted impact

References

Percentile

90%

vs. same field & year

Citations per year

Cited by

A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems