SOLVING THE BI-DIMENSIONAL TWO-WAY NUMBER PARTITIONING PROBLEM WITH HEURISTIC ALGORITHMS
Küçük Resim Yok
Tarih
2014
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The 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.
Açıklama
8th IEEE International Conference on Application of Information and Communication Technologies (AICT) -- OCT 15-17, 2014 -- Astana, KAZAKHSTAN
Anahtar Kelimeler
Greedy Algorithm, Genetic Algorithm, Two-Way Number Partitioning Problem, Combinatorial Optimization
Kaynak
2014 Ieee 8th International Conference On Application Of Information And Communication Technologies (Aict)
