<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005">
<channel xmlns:cfi="http://www.microsoft.com/schemas/rss/core/2005/internal" cfi:lastdownloaderror="None">
<title cf:type="text"><![CDATA[Editorial department of the Journal of National University of Defense Technology -->Decision and Application Based on Artificial Intelligence Optimization Algorithms]]></title>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Review of green shop scheduling problem]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202502001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the vigorous development of the manufacturing industry, the problems such as environmental pollution an  resource shortage have gradually become prominent, seriously affecting the sustainable development of society. Therefore, the transformation of manufacturing energy saving and carbon reduction is an inevitable requirement for global green and lowcarbon development. As one of the most important parts of the manufacturing systems, production scheduling can realize efficient and green operation of the manufacturing systems through the reasonable allocation of resources. Under the context of green manufacturing, the research of green shop scheduling problem has become a hot spot in the field of production scheduling. Therefore, a systematic review of the existing research since 2018 from the aspects of the green parallel machine scheduling problem, the green flow shop scheduling problem, the green job shop scheduling problem, the green flexible job shop scheduling problem, and the green distributed shop scheduling problem was conducted, the shortcomings of the existing research was summed up, and the direction of future research was pointed out.]]></description>
<pubDate>2025/4/14 0:00:00</pubDate>
<category><![CDATA[Decision and Application Based on Artificial Intelligence Optimization Algorithms]]></category>
<author><![CDATA[GAO Liang, YU Fei, LU Chao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GAO Liang, YU Fei, LU Chao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202502001]]></guid><cfi:id>4</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Robotic parallel disassembly sequence planning method based on reinforcement learning and genetic algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202502002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To improve the disassembly efficiency and reduce disassembly energy consumption, the robotic parallel disassembly mode was introduced in the disassembly sequence planning problem, a robotic parallel disassembly sequence planning model was constructed, and a genetic algorithm based on reinforcement learning was designed. To verify the correctness of the model, a mixed integer linear programming model was constructed. In the algorithm, a goal-oriented encoding and decoding strategy was constructed to improve the quality of the initial solution.<i>Q </i>learning was used to select the best crossover and mutation strategies in the iteration process to enhance the algorithms adaptability. Finally, in an engine disassembly case with 34 tasks, the superiority of the proposed algorithm was verified by comparing with four classic multi-objective algorithms. The analysis of the disassembly schemes shows that the robotic parallel disassembly mode can effectively shorten the completion time and reduce disassembly energy consumption.]]></description>
<pubDate>2025/4/14 0:00:00</pubDate>
<category><![CDATA[Decision and Application Based on Artificial Intelligence Optimization Algorithms]]></category>
<author><![CDATA[WANG Kaipu, MA Xiaoyi, LU Chao, YIN Lüjiang, LI Xinyu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Kaipu, MA Xiaoyi, LU Chao, YIN Lüjiang, LI Xinyu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202502002]]></guid><cfi:id>3</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Improved co-evolutionary algorithm for solving many-objective cloud workflow scheduling problem]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202502003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Most current studies formulate the cloud workflow scheduling as a single-objective or multi-objective optimization problem with at most three objectives, which is unable to fully meet practical scenarios′ needs. To address  the limitations above,  many-objective cloud workflow scheduling model was established, where many indicators such as time, cost, reliability, resource consumption, load balancing, were taken into account. Then, an improved co-evolutionary algorithm was introduced to address this problem, where dual-stage search strategy and multi-indicator cooperation mechanism were employed to effectively balance the convergence and diversity of solution set, so as to enhance the search capability of algorithm. Experiments on seven types of real life workflow instances reveal that our proposal outperforms the existing peers and can find better scheduling schemes in most cases.]]></description>
<pubDate>2025/4/14 0:00:00</pubDate>
<category><![CDATA[Decision and Application Based on Artificial Intelligence Optimization Algorithms]]></category>
<author><![CDATA[ZHOU Jiajun, JI Xiaohui, LU Chao, GAO Liang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Jiajun, JI Xiaohui, LU Chao, GAO Liang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202502003]]></guid><cfi:id>2</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Curriculum reinforcement learning algorithm for flexible job shop scheduling problems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202502004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To address the issue of the lack of generalization capability of deep reinforcement learning in flexible job shop scheduling problems, a method combining curriculum learning and deep reinforcement learning was proposed. The training instance difficulty was dynamically adjusted, with an emphasis on enhancing the training of the most difficult instances, to adapt to different data distributions and avoid the forgetting problem during the learning process. Simulation test results demonstrate that the algorithm maintained decent performance on large-scale untrained problems and benchmark datasets. It achieves better performance on four large-scale untrained problems with two artificial distributions. Compared to exact methods and metaheuristic methods, for problem instances with larger computational complexity, it could rapidly obtain solutions of decent quality. Moreover, the algorithm can adapt to flexible job shop scheduling problems with different data distributions, exhibiting a relatively fast convergence speed and good generalization capability.]]></description>
<pubDate>2025/4/14 0:00:00</pubDate>
<category><![CDATA[Decision and Application Based on Artificial Intelligence Optimization Algorithms]]></category>
<author><![CDATA[LU Chao, XIAO Yang, ZHANG Biao, GAO Liang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LU Chao, XIAO Yang, ZHANG Biao, GAO Liang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202502004]]></guid><cfi:id>1</cfi:id><cfi:read>true</cfi:read></item>
</channel>
</rss>