{"title":"针对单目标柔性作业车间调度问题，提出了一种改进的蚁群算法","authors":"Ming Huang, Dongsheng Guo, Xu Liang, Xiuyan Liang","doi":"10.1109/ICCSNT50940.2020.9305005","DOIUrl":null,"url":null,"abstract":"This paper takes minimizing the maximum completion time as the optimization goal, establishes a disjunctive graph model of the Job-shop scheduling problem, and proposes an improved ant colony algorithm to solve it. The new algorithm improves the ant colony algorithm from two aspects: pheromone update rules and state transition rules, aiming at the problem that ant colony algorithm is easy fall into local optimal solution and slow convergence speed. The feasibility and effectiveness of the proposed algorithm are verified by the experimental simulation of classical examples and the comparison with other relevant literature in recent years.","PeriodicalId":6794,"journal":{"name":"2020 IEEE 8th International Conference on Computer Science and Network Technology (ICCSNT)","volume":"145 1","pages":"16-21"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Ant Colony Algorithm is Proposed to Solve the Single Objective Flexible Job-shop Scheduling Problem\",\"authors\":\"Ming Huang, Dongsheng Guo, Xu Liang, Xiuyan Liang\",\"doi\":\"10.1109/ICCSNT50940.2020.9305005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper takes minimizing the maximum completion time as the optimization goal, establishes a disjunctive graph model of the Job-shop scheduling problem, and proposes an improved ant colony algorithm to solve it. The new algorithm improves the ant colony algorithm from two aspects: pheromone update rules and state transition rules, aiming at the problem that ant colony algorithm is easy fall into local optimal solution and slow convergence speed. The feasibility and effectiveness of the proposed algorithm are verified by the experimental simulation of classical examples and the comparison with other relevant literature in recent years.\",\"PeriodicalId\":6794,\"journal\":{\"name\":\"2020 IEEE 8th International Conference on Computer Science and Network Technology (ICCSNT)\",\"volume\":\"145 1\",\"pages\":\"16-21\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 8th International Conference on Computer Science and Network Technology (ICCSNT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSNT50940.2020.9305005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 8th International Conference on Computer Science and Network Technology (ICCSNT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSNT50940.2020.9305005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Improved Ant Colony Algorithm is Proposed to Solve the Single Objective Flexible Job-shop Scheduling Problem
This paper takes minimizing the maximum completion time as the optimization goal, establishes a disjunctive graph model of the Job-shop scheduling problem, and proposes an improved ant colony algorithm to solve it. The new algorithm improves the ant colony algorithm from two aspects: pheromone update rules and state transition rules, aiming at the problem that ant colony algorithm is easy fall into local optimal solution and slow convergence speed. The feasibility and effectiveness of the proposed algorithm are verified by the experimental simulation of classical examples and the comparison with other relevant literature in recent years.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
