复杂系统建模与仿真(英文)最新文献

Improved Dynamic Q-Learning Algorithm to Solve the Lot-Streaming Flowshop Scheduling Problem with Equal-Size Sublots 用改进的动态 Q-Learning 算法解决具有大小相等子地块的批量流水车间调度问题

复杂系统建模与仿真(英文) Pub Date : 2024-09-01 DOI: 10.23919/CSMS.2024.0010

Ping Wang;Renato De Leone;Hongyan Sang

{"title":"Improved Dynamic Q-Learning Algorithm to Solve the Lot-Streaming Flowshop Scheduling Problem with Equal-Size Sublots","authors":"Ping Wang;Renato De Leone;Hongyan Sang","doi":"10.23919/CSMS.2024.0010","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0010","url":null,"abstract":"The lot-streaming flowshop scheduling problem with equal-size sublots (ELFSP) is a significant extension of the classic flowshop scheduling problem, focusing on optimize makespan. In response, an improved dynamic O-learning (IDQL) algorithm is proposed, utilizing makespan as feedback. To prevent blind search, a dynamic search strategy is introduced. Additionally, the Nawaz-Enscore-Ham (NEH) algorithm is employed to diversify solution sets, enhancing local optimality. Addressing the limitations of the dynamic \u0000<tex>$varepsilon$</tex>\u0000-greedy strategy, the Glover operator complements local search efforts. Simulation experiments, comparing the IDQL algorithm with other intelligent algorithms, validate its effectiveness. The performance of the IDQL algorithm surpasses that of its counterparts, as evidenced by the experimental analysis. Overall, the proposed approach offers a promising solution to the complex ELFSP, showcasing its capability to efficiently minimize makespan and optimize scheduling processes in flowshop environments with equal-size sublots.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 3","pages":"223-235"},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10737161","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Multi-Objective Hybrid Algorithm for the Casting Scheduling Problem with Unrelated Batch Processing Machine 针对不相关批量加工设备的铸造调度问题的多目标混合算法

复杂系统建模与仿真(英文) Pub Date : 2024-09-01 DOI: 10.23919/CSMS.2024.0011

Wei Zhang;Hongtao Tang;Wenyi Wang;Mengzhen Zhuang;Deming Lei;Xi Vincent Wang

{"title":"A Multi-Objective Hybrid Algorithm for the Casting Scheduling Problem with Unrelated Batch Processing Machine","authors":"Wei Zhang;Hongtao Tang;Wenyi Wang;Mengzhen Zhuang;Deming Lei;Xi Vincent Wang","doi":"10.23919/CSMS.2024.0011","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0011","url":null,"abstract":"The casting production process typically involves single jobs and small batches, with multiple constraints in the molding and smelting operations. To address the discrete optimization challenge of casting production scheduling, this paper presents a multi-objective batch scheduling model for molding and smelting operations on unrelated batch processing machines with incompatible job families and non-identical job sizes. The model aims to minimise the makespan, number of batches, and average vacancy rate of sandboxes. Based on the genetic algorithm, virus optimization algorithm, and two local search strategies, a hybrid algorithm (GA-VOA-BMS) has been designed to solve the model. The GA-VOA-BMS applies a novel Batch First Fit (BFF) heuristic for incompatible job families to improve the quality of the initial population, adopting the batch moving strategy and batch merging strategy to further enhance the quality of the solution and accelerate the convergence of the algorithm. The proposed algorithm was then compared with multi-objective swarm optimization algorithms, namely NSGA-II, SPEA-II, and PESA-II, to evaluate its effectiveness. The results of the performance comparison indicate that the proposed algorithm outperforms the others in terms of both quality and stability.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 3","pages":"236-257"},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10737162","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Image Encryption Algorithm Based on a Hybrid Model of Novel Memristive Hyperchaotic Systems, DNA Coding, and Hash Functions 基于新型膜超混沌系统、DNA 编码和哈希函数混合模型的图像加密算法

复杂系统建模与仿真(英文) Pub Date : 2024-09-01 DOI: 10.23919/CSMS.2024.0015

Zhenglong Chong;Cong Wang;Hongli Zhang;Ping Ma;Xinkai Li

{"title":"Image Encryption Algorithm Based on a Hybrid Model of Novel Memristive Hyperchaotic Systems, DNA Coding, and Hash Functions","authors":"Zhenglong Chong;Cong Wang;Hongli Zhang;Ping Ma;Xinkai Li","doi":"10.23919/CSMS.2024.0015","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0015","url":null,"abstract":"The design of a chaotic image encryption algorithm plays an essential role in enhancing information and communication security. The performance of such algorithms is intricately linked to the complexity of the chaotic sequence and the underlying encryption algorithm. To additionally enhance the complexity of hyperchaotic systems, this study presents a novel construction of a Five-Dimensional (5D) memristive hyperchaotic system through the introduction of the flux-controlled memristor model. The system's dynamic characteristics are examined through various analytical methods, including phase portraits, bifurcation diagrams, and Lyapunov exponent spectra. Accordingly, the sequences produced by the hyperchaotic system, which passed the National Institute of Standards and Technology (NIST) test, are employed to inform the creation of a novelty image encryption technique that combines hash function, Deoxyribonucleic Acid (DNA) encoding, logistic, and Two-Dimensional Hyperchaotic Map (2D-SFHM). It improves the sensitivity of key and plaintext images to image encryption, expands the algorithm key space, and increases the complexity of the encryption algorithm. Experimental findings and analysis validate the exceptional encryption capabilities of the novel algorithm. The algorithm exhibits a considerable key space 2\u0000<sup>512</sup>\u0000, and the ciphertext image demonstrates an information entropy of 7.9994, with inter-pixel correlation approaching zero, etc., showcasing its resilience against different types of attacks on images.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 3","pages":"303-319"},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10737163","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multi-UAV Collaborative Trajectory Planning for 3D Terrain Based on CS-GJO Algorithm 基于 CS-GJO 算法的三维地形多无人机协同轨迹规划

复杂系统建模与仿真(英文) Pub Date : 2024-09-01 DOI: 10.23919/CSMS.2024.0013

Taishan Lou;Yu Wang;Zhepeng Yue;Liangyu Zhao

{"title":"Multi-UAV Collaborative Trajectory Planning for 3D Terrain Based on CS-GJO Algorithm","authors":"Taishan Lou;Yu Wang;Zhepeng Yue;Liangyu Zhao","doi":"10.23919/CSMS.2024.0013","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0013","url":null,"abstract":"Existing solutions for collaborative trajectory planning using multiple UAVs suffer from issues such as low accuracy, instability, and slow convergence. To address the aforementioned issues, this paper introduces a new method for multiple unmanned aerial vehicle (UAV) 3D terrain cooperative trajectory planning based on the cuckoo search golden jackal optimization (CS-GJO) algorithm. A model for single UAV trajectory planning and a model for multi-UAV collaborative trajectory planning have been developed, and the problem of solving the models is restructured into an optimization problem. Building upon the original golden jackal optimization, the use of tent chaotic mapping aids in the generation of the golden jackal's initial population, thereby promoting population diversity. Subsequently, the position update strategy of the cuckoo search algorithm is combined for purpose of update the position information of individual golden jackals, effectively preventing the algorithm from getting stuck in local minima. Finally, the corresponding nonlinear control parameter were developed. The new parameters expedite the decrease in the convergence factor during the pre-exploration stage, resulting in an improved overall search speed of the algorithm. Moreover, they attenuate the decrease in the convergence factor during the post-exploration stage, thereby enhancing the algorithm's global search. The experimental results demonstrate that the CS-GJO algorithm efficiently and accurately accomplishes multi-UAV cooperative trajectory planning in a 3D environment. Compared with other comparative algorithms, the CS-GJO algorithm also has better stability, higher optimization accuracy, and faster convergence speed.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 3","pages":"274-291"},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10737157","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Low-Carbon Economic Operation Optimization of Mine Integrated Energy System Considering Energy Supply Uncertainty 考虑能源供应不确定性的矿山综合能源系统低碳经济运营优化

复杂系统建模与仿真(英文) Pub Date : 2024-09-01 DOI: 10.23919/CSMS.2024.0012

Xiaokang Wu;Yong Zhang;Xiaotian Fei;Hejuan Hu;Xiaoyan Sun;Dunwei Gong;Xianfang Song

{"title":"Low-Carbon Economic Operation Optimization of Mine Integrated Energy System Considering Energy Supply Uncertainty","authors":"Xiaokang Wu;Yong Zhang;Xiaotian Fei;Hejuan Hu;Xiaoyan Sun;Dunwei Gong;Xianfang Song","doi":"10.23919/CSMS.2024.0012","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0012","url":null,"abstract":"Mine integrated energy system (MIES) can promote the utilization of derived energy and achieve multi-energy complementation and ecological protection. Now it gradually becomes an important focus for scientific carbon reduction and carbon neutrality. To reduce the impact of uncertain prediction differences on the system during the process of using mine derived energy, a low-carbon economic operation strategy of MIES considering energy supply uncertainty is developed in this paper. Firstly, based on the basic structure of energy flow in MIES, the energy-carbon flow framework of MIES is established for the low-carbon operation requirements. Secondly, considering carbon emission constraints, the low-carbon economic operation optimization model (LEOOM) is built for MIES to minimize operation cost and carbon emission. Finally, multiple uncertainties of the system are modeled and analyzed by using the robust model under the risk aversion strategy of information gap decision theory (IGDT), and a model conversion method is designed to optimize the low-carbon economic operation model. The simulation results under three scenarios demonstrate that compared to the existed economic dispatching models, the proposed model achieves a 30% reduction in carbon emission while the operational cost of MIES only is increased by 2.1%. The model efficiently mitigates the carbon emission of the system, and the proposed uncertain treatment strategy can significantly improve the robustness of obtained operation plans.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 3","pages":"258-273"},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10737156","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An Adaptive Shuffled Frog-Leaping Algorithm for Hybrid-Flow Shop Scheduling with No Precedence Between Some Stages 用于某些阶段之间无先例的混合流程车间调度的自适应洗牌蛙跳算法

复杂系统建模与仿真(英文) Pub Date : 2024-09-01 DOI: 10.23919/CSMS.2024.0014

Zhenghui Yin;Deming Lei;Bo Yang

引用次数: 0

Research on Digital Twin System Platform Framework and Key Technologies of Unmanned Ground Equipment 无人地面设备数字孪生系统平台框架及关键技术研究

复杂系统建模与仿真(英文) Pub Date : 2024-06-01 DOI: 10.23919/CSMS.2024.0009

Kunyu Wang;Lin Zhang;Cheng Xu;Han Lu;Zhen Chen;Hongbo Cheng;Rui Guo

引用次数: 0

Hierarchical Disturbance Propagation Mechanism and Improved Contract Net Protocol for Satellite TT&C Resource Dynamic Scheduling 用于卫星 TT&C 资源动态调度的分层干扰传播机制和改进的合同网协议

复杂系统建模与仿真(英文) Pub Date : 2024-06-01 DOI: 10.23919/CSMS.2024.0004

Zhiqing Xiang;Yi Gu;Xinwei Wang;Guohua Wu

{"title":"Hierarchical Disturbance Propagation Mechanism and Improved Contract Net Protocol for Satellite TT&C Resource Dynamic Scheduling","authors":"Zhiqing Xiang;Yi Gu;Xinwei Wang;Guohua Wu","doi":"10.23919/CSMS.2024.0004","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0004","url":null,"abstract":"The practical engineering of satellite tracking telemetry and command (TT&C) is often disturbed by unpredictable external factors, including the temporary rise in a significant quantity of satellite TT&C tasks, temporary failures and failures of some TT&C resources, and so on. To improve the adaptability and robustness of satellite TT&C systems when faced with uncertain dynamic disturbances, a hierarchical disturbance propagation mechanism and an improved contract network dynamic scheduling method for satellite TT&C resources were designed to address the dynamic scheduling problem of satellite TT&C resources. Firstly, the characteristics of the dynamic scheduling problem of satellite TT&C resources are analyzed, and a mathematical model is established with the weighted optimization objectives of maximizing the revenue from task completion and minimizing the degree of plan disturbance. Then, a bottom-up distributed dynamic collaborative scheduling framework for satellite TT&C resources is proposed, which includes a task layer, a resource layer, a central internal collaboration layer, and a central external collaboration layer. Dynamic disturbances are propagated layer by layer from the task layer to the central external collaboration layer in a bottom-up manner, using efficient heuristic strategies in the task layer and the resource layer, respectively. We use improved contract network algorithms in the center internal collaboration layer and the center external collaboration layer, the original scheduling plan is quickly adjusted to minimize the impact of disturbances while effectively completing dynamic task requirements. Finally, a large number of simulation experiments were carried out and compared with various comparative algorithms. The results show that the proposed algorithm can effectively improve the solution effect of satellite TT&C resource dynamic scheduling problems, and has good application prospects.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 2","pages":"166-183"},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10598215","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141624091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Q-Learning Based Hybrid Meta-Heuristic for Integrated Scheduling of Disassembly and Reprocessing Processes Considering Product Structures and Stochasticity 考虑产品结构和随机性的基于 Q 学习的拆卸和再加工工序综合调度混合元亨利术

复杂系统建模与仿真(英文) Pub Date : 2024-06-01 DOI: 10.23919/CSMS.2024.0007

Fuquan Wang;Yaping Fu;Kaizhou Gao;Yaoxin Wu;Song Gao

{"title":"A Q-Learning Based Hybrid Meta-Heuristic for Integrated Scheduling of Disassembly and Reprocessing Processes Considering Product Structures and Stochasticity","authors":"Fuquan Wang;Yaping Fu;Kaizhou Gao;Yaoxin Wu;Song Gao","doi":"10.23919/CSMS.2024.0007","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0007","url":null,"abstract":"Remanufacturing is regarded as a sustainable manufacturing paradigm of energy conservation and environment protection. To improve the efficiency of the remanufacturing process, this work investigates an integrated scheduling problem for disassembly and reprocessing in a remanufacturing process, where product structures and uncertainty are taken into account. First, a stochastic programming model is developed to minimize the maximum completion time (makespan). Second, a Q-learning based hybrid meta-heuristic (Q-HMH) is specially devised. In each iteration, a Q-learning method is employed to adaptively choose a premium algorithm from four candidate ones, including genetic algorithm (GA), artificial bee colony (ABC), shuffled frog-leaping algorithm (SFLA), and simulated annealing (SA) methods. At last, simulation experiments are carried out by using sixteen instances with different scales, and three state-of-the-art algorithms in literature and an exact solver CPLEX are chosen for comparisons. By analyzing the results with the average relative percentage deviation (RPD) metric, we find that Q-HMH outperforms its rivals by 9.79%-26.76%. The results and comparisons verify the excellent competitiveness of Q-HMH for solving the concerned problems.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 2","pages":"184-209"},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10598210","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141624145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Adaptive Memetic Algorithm with Dual-Level Local Search for Cooperative Route Planning of Multi-Robot Surveillance Systems 多机器人监控系统合作路线规划的双级局部搜索自适应记忆算法

复杂系统建模与仿真(英文) Pub Date : 2024-06-01 DOI: 10.23919/CSMS.2024.0006

Hao Cheng;Jin Yi;Wei Xia;Huayan Pu;Jun Luo

引用次数: 0