SOLVING THE BI-DIMENSIONAL TWO-WAY NUMBER PARTITIONING PROBLEM WITH HEURISTIC ALGORITHMS

Basit Öğe Kaydı
dc.contributor.authorHacibeyoglu, Mehmet
dc.contributor.authorTongur, Vahit
dc.contributor.authorAlaykiran, Kemal
dc.date.accessioned2024-02-23T14:45:21Z
dc.date.available2024-02-23T14:45:21Z
dc.date.issued2014
dc.departmentNEÜen_US
dc.description8th IEEE International Conference on Application of Information and Communication Technologies (AICT) -- OCT 15-17, 2014 -- Astana, KAZAKHSTANen_US
dc.description.abstractThe two-way number partitioning problem is to divide set of numbers into two subsets. As a result of the dividing process the sums of numbers in subsets must be as nearly equal as possible. The two-way number partitioning problem problem is NP-complete. The bi-dimensional two-way number partitioning problem is a kind of number partitioning problem. The sets have only two coordinates and the aim is minimized the differences of the sum of the numbers for both coordinates. This work presents two heuristic algorithm for solving bi-dimensional two-way number partitioning problem. Fist algorithm is best known and most used greedy algorithm. The other one is a novel genetic algorithm approach. These algorithms are analyzed, implemented and tested on randomly different 20 datasets.en_US
dc.description.sponsorshipInst Elect & Elect Engineers,Thomson Reuters,MIKRO Informat Handling & Distribut FZE,EMC2,Chevron Corp,Assoc IT Co Kazakhstan,TAMUR,Faktor,Doctor Web,QAFQAZ UNIV,NAZARBAYEV UNIV RES & INNOVAT SYST,Gumilyov Eurasian Natl Univ, IS&C Inst,IEEE Comp Soc, Azerbaijan Chapter,Lomonosov Moscow State Univen_US
dc.identifier.endpage77en_US
dc.identifier.isbn978-1-4799-4120-9
dc.identifier.issn2378-8232
dc.identifier.startpage73en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12452/17378
dc.identifier.wosWOS:000392725100020en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.ispartof2014 Ieee 8th International Conference On Application Of Information And Communication Technologies (Aict)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectGreedy Algorithmen_US
dc.subjectGenetic Algorithmen_US
dc.subjectTwo-Way Number Partitioning Problemen_US
dc.subjectCombinatorial Optimizationen_US
dc.titleSOLVING THE BI-DIMENSIONAL TWO-WAY NUMBER PARTITIONING PROBLEM WITH HEURISTIC ALGORITHMSen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu