{"title":"用于某些阶段之间无先例的混合流程车间调度的自适应洗牌蛙跳算法","authors":"Zhenghui Yin;Deming Lei;Bo Yang","doi":"10.23919/CSMS.2024.0014","DOIUrl":null,"url":null,"abstract":"Hybrid flow shop scheduling problem (HFSP) has been extensively considered, however, some real-life conditions are seldom investigated. In this study, HFSP with no precedence between some stages is solved and an adaptive shuffled frog-leaping algorithm (ASFLA) is developed to optimize makespan. A new solution representation and a decoding procedure are presented, an adaptive memeplex search and dynamical population shuffling are implemented together. Many computational experiments are implemented. Computational results prove that the new strategies of ASFLA are effective and ASFLA is very competitive in solving HFSP with no precedence between some stages.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 3","pages":"292-302"},"PeriodicalIF":0.0000,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10737164","citationCount":"0","resultStr":"{\"title\":\"An Adaptive Shuffled Frog-Leaping Algorithm for Hybrid-Flow Shop Scheduling with No Precedence Between Some Stages\",\"authors\":\"Zhenghui Yin;Deming Lei;Bo Yang\",\"doi\":\"10.23919/CSMS.2024.0014\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hybrid flow shop scheduling problem (HFSP) has been extensively considered, however, some real-life conditions are seldom investigated. In this study, HFSP with no precedence between some stages is solved and an adaptive shuffled frog-leaping algorithm (ASFLA) is developed to optimize makespan. A new solution representation and a decoding procedure are presented, an adaptive memeplex search and dynamical population shuffling are implemented together. Many computational experiments are implemented. Computational results prove that the new strategies of ASFLA are effective and ASFLA is very competitive in solving HFSP with no precedence between some stages.\",\"PeriodicalId\":65786,\"journal\":{\"name\":\"复杂系统建模与仿真(英文)\",\"volume\":\"4 3\",\"pages\":\"292-302\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10737164\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"复杂系统建模与仿真(英文)\",\"FirstCategoryId\":\"1089\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10737164/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"复杂系统建模与仿真(英文)","FirstCategoryId":"1089","ListUrlMain":"https://ieeexplore.ieee.org/document/10737164/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Adaptive Shuffled Frog-Leaping Algorithm for Hybrid-Flow Shop Scheduling with No Precedence Between Some Stages
Hybrid flow shop scheduling problem (HFSP) has been extensively considered, however, some real-life conditions are seldom investigated. In this study, HFSP with no precedence between some stages is solved and an adaptive shuffled frog-leaping algorithm (ASFLA) is developed to optimize makespan. A new solution representation and a decoding procedure are presented, an adaptive memeplex search and dynamical population shuffling are implemented together. Many computational experiments are implemented. Computational results prove that the new strategies of ASFLA are effective and ASFLA is very competitive in solving HFSP with no precedence between some stages.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
