A Comparative Analysis of Metaheuristic Approaches for Multidimensional Two-Way Number Partitioning Problem

Basit Öğe Kaydı
dc.contributor.authorHacıbeyoğlu, Mehmet
dc.contributor.authorAlaykıran, Kemal
dc.contributor.authorAcılar, Ayşe Merve
dc.contributor.authorTongur, Vahit
dc.contributor.authorÜlker, Erkan
dc.date.accessioned2020-03-26T19:52:40Z
dc.date.available2020-03-26T19:52:40Z
dc.date.issued2018
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractIn this study, a novel usage of four metaheuristic approaches Genetic algorithm (GA), Simulated annealing (SA), migrating bird optimization algorithm (MBO) and clonal selection algorithm (CSA) are applied to multidimensional two-way number partitioning problem (MDTWNPP). MDTWNPP is a classical combinatorial NP-hard optimization problem where a set of vectors have more than one coordinate is partitioned into two subsets. The main objective function of MDTWNPP is to minimize the maximum absolute difference between the sums per coordinate of elements. In order to solve this problem, GA is applied with greedy crossover and mutation operators. SA is improved with dual local search mechanism. MBO is specialized as multiple flock migrating birds optimization algorithms. CSA is applied with problem specific hyper mutation process. Furthermore, all instances are solved using an integer linear programming model which was previously presented in the literature. In the experiments, four metaheuristic approaches and integer linear programming model are used to solve 126 datasets with different sizes and coordinates. As a brief result, the GA and SA approaches designed for this problem outperformed all other heuristics and the integer programming model. Both the performance of GA and SA approaches are in a competitive manner where GA and SA yielded the best solution for 56 and 65 out of 125 datasets, respectively.en_US
dc.identifier.doi10.1007/s13369-018-3155-9en_US
dc.identifier.endpage7520en_US
dc.identifier.issn2193-567Xen_US
dc.identifier.issn2191-4281en_US
dc.identifier.issue12en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage7499en_US
dc.identifier.urihttps://dx.doi.org/10.1007/s13369-018-3155-9
dc.identifier.urihttps://hdl.handle.net/20.500.12395/36232
dc.identifier.volume43en_US
dc.identifier.wosWOS:000449936300054en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSPRINGER HEIDELBERGen_US
dc.relation.ispartofARABIAN JOURNAL FOR SCIENCE AND ENGINEERINGen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectMultidimensional two-way number partitioning problemen_US
dc.subjectInteger linear programmingen_US
dc.subjectGenetic algorithmsen_US
dc.subjectMigrating birds optimization algorithmen_US
dc.subjectClonal selection algorithmen_US
dc.subjectSimulated annealingen_US
dc.titleA Comparative Analysis of Metaheuristic Approaches for Multidimensional Two-Way Number Partitioning Problemen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu