AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS


İŞLEYEN S. K. , BAYKOÇ Ö. F.

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, vol.26, no.2, pp.185-197, 2009 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 26 Issue: 2
  • Publication Date: 2009
  • Doi Number: 10.1142/s021759590900216x
  • Title of Journal : ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
  • Page Numbers: pp.185-197

Abstract

In this paper, the Vehicle Routing Problem with Stochastic Demands (VRPSD) is considered where customer demands are normally distributed. We propose a new model for computing the expected length of a tour. Monte Carlo simulation is used to demonstrate the accuracy of the model on randomly generated test problems. It is assumed that the service policy is non-divisible, meaning that the entire demand at each customer must be served in a single visit by a unique vehicle.