A Solution Approach from an Analytic Model to Heuristic Algorithm for Special Case of Vehicle Routing Problem with Stochastic Demands

Creative Commons License

Isleyen S. K., BAYKOÇ Ö. F.

MATHEMATICAL PROBLEMS IN ENGINEERING, cilt.2008, 2008 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 2008
  • Basım Tarihi: 2008
  • Doi Numarası: 10.1155/2008/571414
  • Dergi Adı: MATHEMATICAL PROBLEMS IN ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Gazi Üniversitesi Adresli: Evet

Özet

We define a special case for the vehicle routing problem with stochastic demands (SC-VRPSD) where customer demands are normally distributed. We propose a new linearmodel for computing the expected length of a tour in SC-VRPSD. The proposed model is based on the integration of the "Traveling Salesman Problem" (TSP) and the Assignment Problem. For large-scale problems, we also use an Iterated Local Search (ILS) algorithm in order to reach an effective solution. Copyright (C) 2008 S. K. Isleyen and O. F. Baykoc.