针对某些调度问题的并行 "胜者为王 "算法

IF 0.58 Q3 Engineering Journal of Applied and Industrial Mathematics Pub Date : 2024-02-16 DOI:10.1134/S1990478923040014

P. A. Borisovsky

{"title":"针对某些调度问题的并行 \"胜者为王 \"算法","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":"{\"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}","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

摘要

摘要我们考虑了一种利用图形加速器解决排列调度问题的方法。我们提出了一种基于迭代随机局部搜索和 "胜者为王 "算法的并行进化算法。对经典的流水车间问题和一个带有时间窗口的生产调度问题的测试实例进行了计算实验。结果表明，与遗传算法和 Gurobi 求解器的各种变体相比，计算速度快，求解精度高。所提出的方法易于实施，便于适应图形计算的特殊性，可用于解决实际问题。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Parallel “Go with the Winners” Algorithm for Some Scheduling Problems

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 Engineering-Industrial and Manufacturing Engineering

CiteScore

1.00

自引率

0.00%

发文量

期刊介绍： 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.