基于散点搜索的二次分配问题求解方法

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI:10.1109/ICEC.1997.592289

V. Cung, T. Mautor, P. Michelon, A. Tavares

{"title":"基于散点搜索的二次分配问题求解方法","authors":"V. Cung, T. Mautor, P. Michelon, A. Tavares","doi":"10.1109/ICEC.1997.592289","DOIUrl":null,"url":null,"abstract":"Scatter search is an evolutionary heuristic, proposed two decades ago, that uses linear combinations of a population subset to create new solutions. A special operator is used to ensure their feasibility and to improve their quality. The authors propose a scatter search approach to the QAP problem. The basic method is extended with intensification and diversification stages and they present a procedure to generate good scattered initial solutions.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"122","resultStr":"{\"title\":\"A scatter search based approach for the quadratic assignment problem\",\"authors\":\"V. Cung, T. Mautor, P. Michelon, A. Tavares\",\"doi\":\"10.1109/ICEC.1997.592289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scatter search is an evolutionary heuristic, proposed two decades ago, that uses linear combinations of a population subset to create new solutions. A special operator is used to ensure their feasibility and to improve their quality. The authors propose a scatter search approach to the QAP problem. The basic method is extended with intensification and diversification stages and they present a procedure to generate good scattered initial solutions.\",\"PeriodicalId\":167852,\"journal\":{\"name\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"122\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEC.1997.592289\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEC.1997.592289","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 122

摘要

分散搜索是20年前提出的一种进化启发式算法，它使用种群子集的线性组合来创建新的解决方案。为了保证其可行性和提高其质量，采用了专门的操作人员。作者提出了一种求解QAP问题的散点搜索方法。将基本方法扩展到强化和多样化阶段，并给出了生成良好分散初始解的过程。

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

查看原文本刊更多论文

A scatter search based approach for the quadratic assignment problem

Scatter search is an evolutionary heuristic, proposed two decades ago, that uses linear combinations of a population subset to create new solutions. A special operator is used to ensure their feasibility and to improve their quality. The authors propose a scatter search approach to the QAP problem. The basic method is extended with intensification and diversification stages and they present a procedure to generate good scattered initial solutions.

求助全文

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

来源期刊

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)

自引率

0.00%

发文量