{"title":"A Parallel “Go with the Winners” Algorithm for Some Scheduling Problems","authors":"P. A. Borisovsky","doi":"10.1134/S1990478923040014","DOIUrl":null,"url":null,"abstract":"<p> We consider an approach to solving permutation scheduling problems using graphics\naccelerators. A parallel evolutionary algorithm based on the iterated random local search and the\n“Go with the winners” algorithm is proposed. A computational experiment was carried out on test\ninstances of the classic Flow Shop problem and one applied production scheduling problem with\ntime windows. The results show high computing speed and good accuracy of obtained solutions in\ncomparison with various variants of the genetic algorithm and Gurobi solver. The proposed\napproach is easy to implement and convenient for adaptation to particular features of graphics\ncomputing and can be used to solve practical problems.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 4","pages":"687 - 697"},"PeriodicalIF":0.5800,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478923040014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0
Abstract
We consider an approach to solving permutation scheduling problems using graphics
accelerators. A parallel evolutionary algorithm based on the iterated random local search and the
“Go with the winners” algorithm is proposed. A computational experiment was carried out on test
instances of the classic Flow Shop problem and one applied production scheduling problem with
time windows. The results show high computing speed and good accuracy of obtained solutions in
comparison with various variants of the genetic algorithm and Gurobi solver. The proposed
approach is easy to implement and convenient for adaptation to particular features of graphics
computing and can be used to solve practical problems.
期刊介绍：
Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
