AN EFFICIENTLY NOVEL MODEL FOR VEHICLE ROUTING PROBLEMS WITH STOCHASTIC DEMANDS


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

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, cilt.26, sa.2, ss.185-197, 2009 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 26 Konu: 2
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1142/s021759590900216x
  • Dergi Adı: ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
  • Sayfa Sayıları: ss.185-197

Özet

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.