一种新的蚁群算法求解置换流水车间问题

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI:10.1109/BICTA.2010.5645102

Wenjin Yang, Yantao Zhou, Kenli Li

{"title":"一种新的蚁群算法求解置换流水车间问题","authors":"Wenjin Yang, Yantao Zhou, Kenli Li","doi":"10.1109/BICTA.2010.5645102","DOIUrl":null,"url":null,"abstract":"A new ant algorithm for the permutation flow shop problem is presented, which embraces two new features. One is a different yet outstanding pheromone structure, in which an ant is permitted to select more than one jobs at each step when constructing a complete travel sequence. The other is a new heuristic to guide the search. Experiments shows that a considerable improvement of performance can be obtained, and the reason behind is presented.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":" 10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A novel Ant algorithm for permutation flow shop problem\",\"authors\":\"Wenjin Yang, Yantao Zhou, Kenli Li\",\"doi\":\"10.1109/BICTA.2010.5645102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new ant algorithm for the permutation flow shop problem is presented, which embraces two new features. One is a different yet outstanding pheromone structure, in which an ant is permitted to select more than one jobs at each step when constructing a complete travel sequence. The other is a new heuristic to guide the search. Experiments shows that a considerable improvement of performance can be obtained, and the reason behind is presented.\",\"PeriodicalId\":302619,\"journal\":{\"name\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"volume\":\" 10\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2010.5645102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2010.5645102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

提出了一种新的蚁群算法求解置换流水车间问题，该算法具有两个新的特点。一种是不同的但突出的信息素结构，在这种结构中，蚂蚁在构建一个完整的旅行序列时，允许每一步选择多个任务。另一个是一种新的启发式方法来指导搜索。实验结果表明，该方法能显著提高系统的性能，并分析了其原因。

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

查看原文本刊更多论文

A novel Ant algorithm for permutation flow shop problem

A new ant algorithm for the permutation flow shop problem is presented, which embraces two new features. One is a different yet outstanding pheromone structure, in which an ant is permitted to select more than one jobs at each step when constructing a complete travel sequence. The other is a new heuristic to guide the search. Experiments shows that a considerable improvement of performance can be obtained, and the reason behind is presented.

求助全文

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

来源期刊

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)

自引率

0.00%

发文量