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

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

Modeling and Analysis of Risk Propagation and Loss Causing Capacity for Key Nodes in Cyber-Physical Coupled Power Network 网络-物理耦合电力网络中关键节点的风险传播和损失容量建模与分析

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

Dongqi Liu;Qiong Zhang;Haolan Liang;Tao Zhang;Rui Wang

{"title":"Modeling and Analysis of Risk Propagation and Loss Causing Capacity for Key Nodes in Cyber-Physical Coupled Power Network","authors":"Dongqi Liu;Qiong Zhang;Haolan Liang;Tao Zhang;Rui Wang","doi":"10.23919/CSMS.2024.0008","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0008","url":null,"abstract":"The modern power system has evolved into a cyber-physical system with deep coupling of physical and information domains, which brings new security risks. Aiming at the problem that the “information-physical” cross-domain attacks with key nodes as springboards seriously threaten the safe and stable operation of power grids, a risk propagation model considering key nodes of power communication coupling networks is proposed to study the risk propagation characteristics of malicious attacks on key nodes and the impact on the system. First, combined with the complex network theory, a topological model of the power communication coupling network is established, and the key nodes of the coupling network are screened out by Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method under the comprehensive evaluation index based on topological characteristics and physical characteristics. Second, a risk propagation model is established for malicious attacks on key nodes to study its propagation characteristics and analyze the state changes of each node in the coupled network. Then, two loss-causing factors: the minimum load loss ratio and transmission delay factor are constructed to quantify the impact of risk propagation on the coupled network. Finally, simulation analysis based on the IEEE 39-node system shows that the probability of node being breached \u0000<tex>$(alpha)$</tex>\u0000 and the security tolerance of the system \u0000<tex>$(beta)$</tex>\u0000 are the key factors affecting the risk propagation characteristics of the coupled network, as well as the criticality of the node is positively correlated with the damage-causing factor. The proposed methodological model can provide an effective exploration of the diffusion of security risks in control systems on a macro level.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 2","pages":"124-136"},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10598212","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141624098","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 Penalty Groups-Assisted Iterated Greedy Integrating Idle Time Insertion: Solving the Hybrid Flow Shop Group Scheduling with Delivery Time Windows 惩罚群辅助迭代贪婪整合闲置时间插入：解决具有交货时间窗口的混合流水车间分组调度问题

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

Qianhui Ji;Yuyan Han;Yuting Wang;Biao Zhang;Kaizhou Gao

{"title":"A Penalty Groups-Assisted Iterated Greedy Integrating Idle Time Insertion: Solving the Hybrid Flow Shop Group Scheduling with Delivery Time Windows","authors":"Qianhui Ji;Yuyan Han;Yuting Wang;Biao Zhang;Kaizhou Gao","doi":"10.23919/CSMS.2024.0005","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0005","url":null,"abstract":"The hybrid flow shop group scheduling problem (HFGSP) with the delivery time windows has been widely studied owing to its better flexibility and suitability for the current just-in-time production mode. However, there are several unresolved challenges in problem modeling and algorithmic design tailored for HFGSP. In our study, we place emphasis on the constraint of timeliness. Therefore, this paper first constructs a mixed integer linear programming model of HFGSP with sequence-dependent setup time and delivery time windows to minimize the total weighted earliness and tardiness (TWET). Then a penalty groups-assisted iterated greedy integrating idle time insertion (PG_IG_ITI) is proposed to solve the above problem. In the PG_IG_ITI, a double decoding strategy is proposed based on the earliest available machine rule and the idle time insertion rule to calculate the TWET value. Subsequently, to reduce the amount of computation, a skip-based destruction and reconstruction strategy is designed, and a penalty groups-assisted local search is proposed to further improve the quality of the solution by disturbing the penalized groups, i.e., early and tardy groups. Finally, through comprehensive statistical experiments on 270 test instances, the results prove that the proposed algorithm is effective compared to four state-of-the-art algorithms.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 2","pages":"137-165"},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10598214","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141624141","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 Hybrid Algorithm Based on Comprehensive Search Mechanisms for Job Shop Scheduling Problem 基于综合搜索机制的工作车间调度问题混合算法

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

Lin Huang;Shikui Zhao;Yingjie Xiong

{"title":"A Hybrid Algorithm Based on Comprehensive Search Mechanisms for Job Shop Scheduling Problem","authors":"Lin Huang;Shikui Zhao;Yingjie Xiong","doi":"10.23919/CSMS.2024.0001","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0001","url":null,"abstract":"The research on complex workshop scheduling methods has important academic significance and has wide applications in industrial manufacturing. Aiming at the job shop scheduling problem, a hybrid algorithm based on comprehensive search mechanisms (HACSM) is proposed to optimize the maximum completion time. HACSM combines three search methods with different optimization scales, including fireworks algorithm (FW), extended Akers graphical method (LS1+_AKERS_EXT), and tabu search algorithm (TS). FW realizes global search through information interaction and resource allocation, ensuring the diversity of the population. LS1+_AKERS_EXT realizes compound movement with Akers graphical method, so it has advanced global and local search capabilities. In LS1+_AKERS_EXT, the shortest path is the core of the algorithm, which directly affects the encoding and decoding of scheduling. In order to find the shortest path, an effective node expansion method is designed to improve the node expansion efficiency. In the part of centralized search, TS based on the neighborhood structure is used. Finally, the effectiveness and superiority of HACSM are verified by testing the relevant instances in the literature.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 1","pages":"50-66"},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10525670","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140895068","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