用启发式算法求解二维双向数划分问题

2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT) Pub Date : 2014-10-01 DOI:10.1109/ICAICT.2014.7035916

M. Hacibeyoglu, Vahit Tongur, K. Alaykiran

{"title":"用启发式算法求解二维双向数划分问题","authors":"M. Hacibeyoglu, Vahit Tongur, K. Alaykiran","doi":"10.1109/ICAICT.2014.7035916","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":103329,"journal":{"name":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Solving the bi-dimensional two-way number partitioning problem with heuristic algorithms\",\"authors\":\"M. Hacibeyoglu, Vahit Tongur, K. Alaykiran\",\"doi\":\"10.1109/ICAICT.2014.7035916\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":103329,\"journal\":{\"name\":\"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAICT.2014.7035916\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICT.2014.7035916","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

双向数字划分问题是将一组数字划分为两个子集。作为划分过程的结果，子集中的数的和必须尽可能接近相等。双向数字划分问题是np完全问题。二维双向数字划分问题是数字划分问题的一种。该集合只有两个坐标，目标是最小化两个坐标的数字和的差异。本文提出了求解二维双向数划分问题的两种启发式算法。第一个算法是最著名和最常用的贪婪算法。另一个是一种新的遗传算法方法。这些算法在随机不同的20个数据集上进行了分析、实现和测试。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Solving the bi-dimensional two-way number partitioning problem with heuristic algorithms

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)

自引率

0.00%

发文量