A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: Passenger pickup algorithm

GENCER C., Top I., Aydogan E. K.

APPLIED MATHEMATICS AND COMPUTATION, cilt.181, sa.2, ss.1552-1567, 2006 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 181 Sayı: 2
  • Basım Tarihi: 2006
  • Doi Numarası: 10.1016/j.amc.2006.02.043
  • Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1552-1567
  • Gazi Üniversitesi Adresli: Evet

Özet

Fixed-fleet heterogeneous vehicle routing is a type of vehicle routing problem that aims to provide service to a specific customer group with minimum cost, with a limited number of vehicles with different capacities. In this study, a new intuitional algorithm, which can divide the demands at the stops for fixed heterogeneous vehicle routing, is developed and tested on tests samples. The algorithm is compared to the BATA Algorithm available in the literature in relation to the number of vehicles, fixed cost, variable cost and total cost. (c) 2006 Elsevier Inc. All rights reserved.