The vehicle scheduling problem with intermittent customer demands

  title={The vehicle scheduling problem with intermittent customer demands},
  author={W. C. Benton and Manuel D. Rossetti},
  journal={Computers & OR},
The vehicle scheduling problem (VSP) is a problem of interest to many researchers and practitioners. The general VSP is concerned with minimizing the total distance associated with a fixed set of vehicle routes by determining which vehicles will satisfy the demands at various customer locations. The design of most general distribution systems usually involves the assignment of permanent customer routes even though customer demand patterns are often stochastic in nature. The traditional routing… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
13 Citations
6 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 13 extracted citations


Publications referenced by this paper.
Showing 1-6 of 6 references

Vehicle-Scheduling Problems with Uncertainty and Omitted Customers

  • C.D.J. Waters
  • Journal of the Operations Research Society,
  • 1989

Evaluating a Modified Heuristic for the Multiple Vehicle Scheduling Problem

  • W. C. Benton
  • IEE Transactions March
  • 1986

Route Constrained Fleet Scheduling

  • C. Orloff
  • Transportation Science,
  • 1978

Distribution Management: Mathematical Modelling and Practical Analysis

  • S. Eilon, C.D.T. Watson-Gandy, N. Christofides
  • 1971

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

  • G. Clark, J Wright
  • Operations Research vol
  • 1964
1 Excerpt

Similar Papers

Loading similar papers…