结合元启发式求解车问题

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2006-09-26 DOI:10.1109/SYNASC.2006.25

C. Pintea, Camelia Chira, D. Dumitrescu

{"title":"结合元启发式求解车问题","authors":"C. Pintea, Camelia Chira, D. Dumitrescu","doi":"10.1109/SYNASC.2006.25","DOIUrl":null,"url":null,"abstract":"The combination of various meta-heuristics to solve NP-hard problems has great potential to produce good results. Ant algorithms and multi-agent system are proposed to solve a chess problem. The problem is about how to place n rooks on a chessboard so that they are all mutually non-attacking. The introduced algorithms produce reasonable results and have several advantages. A combination between the two meta-heuristics is presented and some possible crossover improvements of the proposed algorithms are suggested","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Combining Meta-Heuristics to Solve the Rook Problem\",\"authors\":\"C. Pintea, Camelia Chira, D. Dumitrescu\",\"doi\":\"10.1109/SYNASC.2006.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The combination of various meta-heuristics to solve NP-hard problems has great potential to produce good results. Ant algorithms and multi-agent system are proposed to solve a chess problem. The problem is about how to place n rooks on a chessboard so that they are all mutually non-attacking. The introduced algorithms produce reasonable results and have several advantages. A combination between the two meta-heuristics is presented and some possible crossover improvements of the proposed algorithms are suggested\",\"PeriodicalId\":309740,\"journal\":{\"name\":\"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2006.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2006.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

结合各种元启发式方法来解决np困难问题有很大的潜力产生良好的结果。提出了蚂蚁算法和多智能体系统来解决象棋问题。问题是如何在棋盘上放置n辆车，使它们都互不攻击。所介绍的算法产生了合理的结果，并具有若干优点。提出了两种元启发式算法的结合，并对提出的算法提出了一些可能的交叉改进

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

查看原文本刊更多论文

Combining Meta-Heuristics to Solve the Rook Problem

The combination of various meta-heuristics to solve NP-hard problems has great potential to produce good results. Ant algorithms and multi-agent system are proposed to solve a chess problem. The problem is about how to place n rooks on a chessboard so that they are all mutually non-attacking. The introduced algorithms produce reasonable results and have several advantages. A combination between the two meta-heuristics is presented and some possible crossover improvements of the proposed algorithms are suggested

求助全文

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

来源期刊

2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

自引率

0.00%

发文量