A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem

YUCENUR G. N., Demirel N.

EXPERT SYSTEMS WITH APPLICATIONS, cilt.38, sa.9, ss.11859-11865, 2011 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 38 Sayı: 9
  • Basım Tarihi: 2011
  • Doi Numarası: 10.1016/j.eswa.2011.03.077
  • Dergi Adı: EXPERT SYSTEMS WITH APPLICATIONS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.11859-11865
  • Yıldız Teknik Üniversitesi Adresli: Evet

Özet

In this paper, a new type of geometric shape based genetic clustering algorithm is proposed. A genetic algorithm based on this clustering technique is developed for the solution process of the multi-depot vehicle routing problem. A set of problems obtained from the literature is used to compare the efficiency of the proposed algorithm with the nearest neighbor algorithm so as to solve the multi-depot vehicle routing problem. The experimental results show that the proposed algorithm provides a better clustering performance in terms of the distance of each customer to each depot in clusters. This result in a considerably less computation time required, when compared with the nearest neighbor algorithm. (C) 2011 Elsevier Ltd. All rights reserved.