一种改进的共生生物搜索算法在流水车间调度中的应用

L. R. Rodrigues, J. Gomes, A. Neto, A. Souza
{"title":"一种改进的共生生物搜索算法在流水车间调度中的应用","authors":"L. R. Rodrigues, J. Gomes, A. Neto, A. Souza","doi":"10.1109/CEC.2018.8477846","DOIUrl":null,"url":null,"abstract":"The Symbiotic Organism Search (SOS) algorithm is an optimization metaheuristic inspired by the symbiotic relationships that occur among organisms in nature. In the last few years, the SOS algorithm attracted increasing attention due to its good performance on various real-world problems, despite the fact that no specific parameter adjustment is required. In this paper, we propose an improved version of SOS by modifying the organisms selection strategy. In the proposed version of the algorithm, three organisms are selected from the population without having a predefined symbiotic relationship. Once the organisms are selected, an assignment step is conducted to assign each organism to a symbiotic relationship. We tested the performance of the proposed algorithm using twenty benchmark instances of the flow shop scheduling problem. We compared the results with the results obtained using the original SOS algorithm. The proposed modification improved the performance of the SOS algorithm in the search for the global optimum value in most of the instances.","PeriodicalId":212677,"journal":{"name":"2018 IEEE Congress on Evolutionary Computation (CEC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Modified Symbiotic Organisms Search Algorithm Applied to Flow Shop Scheduling Problems\",\"authors\":\"L. R. Rodrigues, J. Gomes, A. Neto, A. Souza\",\"doi\":\"10.1109/CEC.2018.8477846\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Symbiotic Organism Search (SOS) algorithm is an optimization metaheuristic inspired by the symbiotic relationships that occur among organisms in nature. In the last few years, the SOS algorithm attracted increasing attention due to its good performance on various real-world problems, despite the fact that no specific parameter adjustment is required. In this paper, we propose an improved version of SOS by modifying the organisms selection strategy. In the proposed version of the algorithm, three organisms are selected from the population without having a predefined symbiotic relationship. Once the organisms are selected, an assignment step is conducted to assign each organism to a symbiotic relationship. We tested the performance of the proposed algorithm using twenty benchmark instances of the flow shop scheduling problem. We compared the results with the results obtained using the original SOS algorithm. The proposed modification improved the performance of the SOS algorithm in the search for the global optimum value in most of the instances.\",\"PeriodicalId\":212677,\"journal\":{\"name\":\"2018 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2018.8477846\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2018.8477846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

共生生物搜索(SOS)算法是一种基于自然界生物间共生关系的优化元启发式算法。在过去的几年里,尽管不需要特定的参数调整,但SOS算法由于其在各种现实问题上的良好性能而受到越来越多的关注。在本文中,我们提出了一个改进版本的SOS通过修改生物体的选择策略。在提出的算法版本中,从种群中选择三种生物,而不具有预定义的共生关系。一旦生物被选择,一个分配步骤是进行分配每个生物到一个共生关系。我们使用20个流水车间调度问题的基准实例测试了所提出算法的性能。我们将结果与原始SOS算法得到的结果进行了比较。在大多数情况下,改进后的SOS算法在搜索全局最优值方面的性能得到了提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Modified Symbiotic Organisms Search Algorithm Applied to Flow Shop Scheduling Problems
The Symbiotic Organism Search (SOS) algorithm is an optimization metaheuristic inspired by the symbiotic relationships that occur among organisms in nature. In the last few years, the SOS algorithm attracted increasing attention due to its good performance on various real-world problems, despite the fact that no specific parameter adjustment is required. In this paper, we propose an improved version of SOS by modifying the organisms selection strategy. In the proposed version of the algorithm, three organisms are selected from the population without having a predefined symbiotic relationship. Once the organisms are selected, an assignment step is conducted to assign each organism to a symbiotic relationship. We tested the performance of the proposed algorithm using twenty benchmark instances of the flow shop scheduling problem. We compared the results with the results obtained using the original SOS algorithm. The proposed modification improved the performance of the SOS algorithm in the search for the global optimum value in most of the instances.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic Evolution of AutoEncoders for Compressed Representations Landscape-Based Differential Evolution for Constrained Optimization Problems A Novel Approach for Optimizing Ensemble Components in Rainfall Prediction A Many-Objective Evolutionary Algorithm with Fast Clustering and Reference Point Redistribution Manyobjective Optimization to Design Physical Topology of Optical Networks with Undefined Node Locations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1