Golomb标尺问题的混合遗传算法

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 Pub Date : 2010-05-16 DOI:10.1109/AICCSA.2010.5586955

N. Ayari, Thé Van Luong, A. Jemai

{"title":"Golomb标尺问题的混合遗传算法","authors":"N. Ayari, Thé Van Luong, A. Jemai","doi":"10.1109/AICCSA.2010.5586955","DOIUrl":null,"url":null,"abstract":"In recent years, with the massive use of Golomb rulers in various fields of engineering, new optimal rulers have become an important subject of search. Many different approaches have been proposed to tackle the Golomb ruler problem such as exact methods, constraint programming, local searches and evolutionary algorithms. This paper describes an hybrid evolutionary algorithm to find optimal or near-optimal Golomb rulers. The obtained results are promising: we are capable of solving large rulers for up to 23 marks.","PeriodicalId":352946,"journal":{"name":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"A hybrid genetic algorithm for Golomb ruler problem\",\"authors\":\"N. Ayari, Thé Van Luong, A. Jemai\",\"doi\":\"10.1109/AICCSA.2010.5586955\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, with the massive use of Golomb rulers in various fields of engineering, new optimal rulers have become an important subject of search. Many different approaches have been proposed to tackle the Golomb ruler problem such as exact methods, constraint programming, local searches and evolutionary algorithms. This paper describes an hybrid evolutionary algorithm to find optimal or near-optimal Golomb rulers. The obtained results are promising: we are capable of solving large rulers for up to 23 marks.\",\"PeriodicalId\":352946,\"journal\":{\"name\":\"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICCSA.2010.5586955\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICCSA.2010.5586955","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 31

摘要

近年来，随着Golomb标尺在工程各个领域的大量应用，新的最优标尺已成为研究的重要课题。人们提出了许多不同的方法来解决Golomb标尺问题，如精确方法、约束规划、局部搜索和进化算法。本文描述了一种寻找最优或近最优Golomb标尺的混合进化算法。得到的结果是有希望的:我们能够解决大尺子高达23个标记。

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

查看原文本刊更多论文

A hybrid genetic algorithm for Golomb ruler problem

In recent years, with the massive use of Golomb rulers in various fields of engineering, new optimal rulers have become an important subject of search. Many different approaches have been proposed to tackle the Golomb ruler problem such as exact methods, constraint programming, local searches and evolutionary algorithms. This paper describes an hybrid evolutionary algorithm to find optimal or near-optimal Golomb rulers. The obtained results are promising: we are capable of solving large rulers for up to 23 marks.

求助全文

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

来源期刊

ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010

自引率

0.00%

发文量