Genetic algorithm for distance balancing in set partitioning problems

被引:0
|
作者
Kiremitci, Serap [1 ]
Akyurt, Ibrahim Zeki [2 ]
机构
[1] Istanbul Univ, Sch Transport & Logist, Istanbul, Turkey
[2] Istanbul Univ, Fac Business Adm, Dept Prod Management, Istanbul, Turkey
关键词
Balancing; Set Partitioning Problem; Genetic Algorithms; Football;
D O I
暂无
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
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.
引用
收藏
页码:47 / 61
页数:15
相关论文
共 50 条
  • [31] Rank-Cluster-and-Prune: An Algorithm for Generating Clusters in Complex Set Partitioning Problems
    Cohn, Amy
    Magazine, Michael
    Polak, George
    NAVAL RESEARCH LOGISTICS, 2009, 56 (03) : 215 - 225
  • [32] Genetic algorithm and graph partitioning
    Bui, TN
    Moon, BR
    IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (07) : 841 - 855
  • [33] GENETIC ALGORITHM FOR MCM PARTITIONING
    VEMURI, R
    VEMURI, R
    ELECTRONICS LETTERS, 1994, 30 (16) : 1270 - 1272
  • [34] A genetic algorithm for graph partitioning
    Kureichik, VM
    Kureichik, VV
    JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 1999, 38 (04) : 580 - 588
  • [35] Solving large knowledge base partitioning problems using an intelligent genetic algorithm
    Ho, SY
    Chen, HM
    Shu, LS
    GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, : 1567 - 1572
  • [36] A Genetic Algorithm for solving two-sided assembly line balancing problems
    Taha, Raghda B.
    El-Kharbotly, Amin K.
    Sadek, Yomna M.
    Afia, Nahid H.
    AIN SHAMS ENGINEERING JOURNAL, 2011, 2 (3-4) : 227 - 240
  • [37] Balancing reconfigurable machining lines via a set partitioning model
    Borisovsky, Pavel A.
    Delorme, Xavier
    Dolgui, Alexandre
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (13) : 4026 - 4036
  • [38] AN EXTENSION OF SET PARTITIONING WITH APPLICATION TO SCHEDULING PROBLEMS
    DARBYDOWMAN, K
    MITRA, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) : 200 - 205
  • [39] A group encoding technique for set partitioning problems
    Yang, CJ
    Dasgupta, D
    Cao, YH
    GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, : 742 - 749
  • [40] A balancing method and genetic algorithm for disassembly line balancing
    McGovern, Seamus M.
    Gupta, Surendra M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (03) : 692 - 708