Genetic algorithm for distance balancing in set partitioning problems

KİREMİTCİ S., Akyurt I. Z.

ISTANBUL UNIVERSITY JOURNAL OF THE SCHOOL OF BUSINESS, cilt.41, sa.1, ss.47-61, 2012 (ESCI) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 41 Sayı: 1
  • Basım Tarihi: 2012
  • Dergi Adı: ISTANBUL UNIVERSITY JOURNAL OF THE SCHOOL OF BUSINESS
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.47-61
  • İstanbul Üniversitesi Adresli: Evet

Özet

In this study balancing is taken into consideration in the formation of groups according to the total travel distance as a set partitioning problem (SPP). Fitness functions that can test imbalance are proposed and mathematical models including these fitness functions are presented. In order to make balanced groupings, four different fitness functions are used. The first model aims to minimize total travel distance. The other two models are used for balancing and the last one constitutes a precedent as a multi-objective decision making problem. Genetic Algorithms (GAs) which is a meta-heuristic technique is used for the solution of the proposed models. Data is taken from the study of Akyurt et al. [1] and is used to balance groups in Football Leagues. Different groups are formed according to these models; effects of the results are examined among themselves and compared with the current situation. Additionally, all results are displayed on the maps.