{"title":"基于深度强化学习的多元启发式方法研究资源约束下的多项目调度问题","authors":"Ziting Han, Yanlan Yang, Hua Ye","doi":"10.1109/ICSP54964.2022.9778702","DOIUrl":null,"url":null,"abstract":"In order to solve resource-constrained multi-project scheduling problem (RCMPSP) more efficiently, this paper proposes a deep reinforcement learning algorithm based multiple meta-heuristic methods that combines the advantages of discrete cuckoo search (DCS) and particle swarm optimization (PSO). In the process of population evolution, Deep reinforcement learning was used to select the most suitable meta-heuristic algorithm (DCS and PSO) according to the diversity and quality of the population, and the reward was designed according to the evolution effect, so as to guide the algorithm to update the solutions more effectively and find the optimal solution quickly. In addition, the key steps of the CS algorithm, Levy flight and random walk, are redefined in this paper. The task movement, reverse mutation, task list recombination and adaptive and repairable swap mutation are used to make it suitable for solving discrete RCMPSP problems and improve the convergence speed of DCS algorithm. Experimental results on the latest data set (MPLIB) demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":363766,"journal":{"name":"2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A deep reinforcement learning based multiple meta-heuristic methods approach for resource constrained multi-project scheduling problem\",\"authors\":\"Ziting Han, Yanlan Yang, Hua Ye\",\"doi\":\"10.1109/ICSP54964.2022.9778702\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to solve resource-constrained multi-project scheduling problem (RCMPSP) more efficiently, this paper proposes a deep reinforcement learning algorithm based multiple meta-heuristic methods that combines the advantages of discrete cuckoo search (DCS) and particle swarm optimization (PSO). In the process of population evolution, Deep reinforcement learning was used to select the most suitable meta-heuristic algorithm (DCS and PSO) according to the diversity and quality of the population, and the reward was designed according to the evolution effect, so as to guide the algorithm to update the solutions more effectively and find the optimal solution quickly. In addition, the key steps of the CS algorithm, Levy flight and random walk, are redefined in this paper. The task movement, reverse mutation, task list recombination and adaptive and repairable swap mutation are used to make it suitable for solving discrete RCMPSP problems and improve the convergence speed of DCS algorithm. Experimental results on the latest data set (MPLIB) demonstrate the effectiveness of the proposed algorithm.\",\"PeriodicalId\":363766,\"journal\":{\"name\":\"2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSP54964.2022.9778702\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 7th International Conference on Intelligent Computing and Signal Processing (ICSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSP54964.2022.9778702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A deep reinforcement learning based multiple meta-heuristic methods approach for resource constrained multi-project scheduling problem
In order to solve resource-constrained multi-project scheduling problem (RCMPSP) more efficiently, this paper proposes a deep reinforcement learning algorithm based multiple meta-heuristic methods that combines the advantages of discrete cuckoo search (DCS) and particle swarm optimization (PSO). In the process of population evolution, Deep reinforcement learning was used to select the most suitable meta-heuristic algorithm (DCS and PSO) according to the diversity and quality of the population, and the reward was designed according to the evolution effect, so as to guide the algorithm to update the solutions more effectively and find the optimal solution quickly. In addition, the key steps of the CS algorithm, Levy flight and random walk, are redefined in this paper. The task movement, reverse mutation, task list recombination and adaptive and repairable swap mutation are used to make it suitable for solving discrete RCMPSP problems and improve the convergence speed of DCS algorithm. Experimental results on the latest data set (MPLIB) demonstrate the effectiveness of the proposed algorithm.