As an emerging technology, digital twin is expected to bring novel application modes to the whole life cycle process of unmanned ground equipment, including research and development, design, control optimization, operation and maintenance, etc. The highly dynamic, complex, and uncertain characteristics of unmanned ground equipment and the battlefield environment also pose new challenges for digital twin technology. Starting from the new challenges faced by the digital twin of unmanned ground equipment, this paper designs a service-oriented cloud-edge-end collaborative platform architecture of the digital twin system of unmanned ground equipment, and further analyzes several key technologies supporting the implementation of the platform architecture.
{"title":"Research on Digital Twin System Platform Framework and Key Technologies of Unmanned Ground Equipment","authors":"Kunyu Wang;Lin Zhang;Cheng Xu;Han Lu;Zhen Chen;Hongbo Cheng;Rui Guo","doi":"10.23919/CSMS.2024.0009","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0009","url":null,"abstract":"As an emerging technology, digital twin is expected to bring novel application modes to the whole life cycle process of unmanned ground equipment, including research and development, design, control optimization, operation and maintenance, etc. The highly dynamic, complex, and uncertain characteristics of unmanned ground equipment and the battlefield environment also pose new challenges for digital twin technology. Starting from the new challenges faced by the digital twin of unmanned ground equipment, this paper designs a service-oriented cloud-edge-end collaborative platform architecture of the digital twin system of unmanned ground equipment, and further analyzes several key technologies supporting the implementation of the platform architecture.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10598211","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141624088","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}
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.
{"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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
The heightened autonomy and robust adaptability inherent in a multi-robot system have proven pivotal in disaster search and rescue, agricultural irrigation, and environmental monitoring. This study addresses the coordination of multiple robots for the surveillance of various key target positions within an area. This involves the allocation of target positions among robots and the concurrent planning of routes for each robot. To tackle these challenges, we formulate a unified optimization model addressing both target allocation and route planning. Subsequently, we introduce an adaptive memetic algorithm featuring dual-level local search strategies. This algorithm operates independently among and within robots to effectively solve the optimization problem associated with surveillance. The proposed method's efficacy is substantiated through comparative numerical experiments and simulated experiments involving diverse scales of robot teams and different target positions.
{"title":"Adaptive Memetic Algorithm with Dual-Level Local Search for Cooperative Route Planning of Multi-Robot Surveillance Systems","authors":"Hao Cheng;Jin Yi;Wei Xia;Huayan Pu;Jun Luo","doi":"10.23919/CSMS.2024.0006","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0006","url":null,"abstract":"The heightened autonomy and robust adaptability inherent in a multi-robot system have proven pivotal in disaster search and rescue, agricultural irrigation, and environmental monitoring. This study addresses the coordination of multiple robots for the surveillance of various key target positions within an area. This involves the allocation of target positions among robots and the concurrent planning of routes for each robot. To tackle these challenges, we formulate a unified optimization model addressing both target allocation and route planning. Subsequently, we introduce an adaptive memetic algorithm featuring dual-level local search strategies. This algorithm operates independently among and within robots to effectively solve the optimization problem associated with surveillance. The proposed method's efficacy is substantiated through comparative numerical experiments and simulated experiments involving diverse scales of robot teams and different target positions.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10598213","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141624099","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}
Dongqi Liu;Qiong Zhang;Haolan Liang;Tao Zhang;Rui Wang
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 $(alpha)$ and the security tolerance of the system $(beta)$ 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.
{"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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
Enhancing the adaptability of Unmanned Aerial Vehicle (UAV) swarm control models to cope with different complex working scenarios is an important issue in this research field. To achieve this goal, control model with tunable parameters is a widely adopted approach. In this article, an improved UAV swarm control model with tunable parameters namely Multi-Objective O-Flocking (MO O-Flocking) is proposed. The MO O-Flocking model is a combination of a multi rule control system and a virtual-physical-law based control model with tunable parameters. To achieve multi-objective parameter tuning, a multi-objective parameter tuning method namely Improved Strength Pareto Evolutionary Algorithm 2 (ISPEA2) is designed. Simulation experiment scenarios include six target orientation scenarios with different kinds of objectives. Experimental results show that both the ISPEA2 algorithm and MO O-Flocking control model have good performance in their experiment scenarios.
提高无人飞行器（UAV）蜂群控制模型的适应性，以应对不同的复杂工作场景，是该研究领域的一个重要问题。为实现这一目标，参数可调的控制模型被广泛采用。本文提出了一种参数可调的改进型无人机蜂群控制模型，即多目标 O-Flocking（MO O-Flocking）。MO O-Flocking模型是多规则控制系统与基于虚拟物理定律的可调参数控制模型的结合。为实现多目标参数调整，设计了一种多目标参数调整方法，即改进强度帕累托进化算法 2（ISPEA2）。仿真实验场景包括六种不同目标的目标定向场景。实验结果表明，ISPEA2 算法和 MO O-Flocking 控制模型在各自的实验场景中都有良好的表现。
{"title":"Multi-Objective Rule System Based Control Model with Tunable Parameters for Swarm Robotic Control in Confined Environment","authors":"Yuan Wang;Lining Xing;Junde Wang;Tao Xie;Lidong Chen","doi":"10.23919/CSMS.2023.0022","DOIUrl":"https://doi.org/10.23919/CSMS.2023.0022","url":null,"abstract":"Enhancing the adaptability of Unmanned Aerial Vehicle (UAV) swarm control models to cope with different complex working scenarios is an important issue in this research field. To achieve this goal, control model with tunable parameters is a widely adopted approach. In this article, an improved UAV swarm control model with tunable parameters namely Multi-Objective O-Flocking (MO O-Flocking) is proposed. The MO O-Flocking model is a combination of a multi rule control system and a virtual-physical-law based control model with tunable parameters. To achieve multi-objective parameter tuning, a multi-objective parameter tuning method namely Improved Strength Pareto Evolutionary Algorithm 2 (ISPEA2) is designed. Simulation experiment scenarios include six target orientation scenarios with different kinds of objectives. Experimental results show that both the ISPEA2 algorithm and MO O-Flocking control model have good performance in their experiment scenarios.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10525674","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140895069","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}
Power grids, due to their lack of network redundancy and structural interdependence, are particularly vulnerable to cascading failures, a phenomenon where a few failed nodes-having their loads exceeding their capacities—can trigger a widespread collapse of all nodes. Here, we extend the cascading failure (Motter-Lai) model to a more realistic perspective, where each node's load capacity is determined to be nonlinearly correlated with the node's centrality. Our analysis encompasses a range of synthetic networks featuring small-world or scale-free properties, as well as real-world network configurations like the IEEE bus systems and the US power grid. We find that fine-tuning this nonlinear relationship can significantly enhance a network's robustness against cascading failures when the network nodes are under attack. Additionally, the selection of initial nodes and the attack strategies also impact overall network robustness. Our findings offer valuable insights for improving the safety and resilience of power grids, bringing us closer to understanding cascading failures in a more realistic context.
{"title":"Cascading Failures in Power Grids: A Load Capacity Model with Node Centrality","authors":"Chaoyang Chen;Yao Hu;Xiangyi Meng;Jinzhu Yu","doi":"10.23919/CSMS.2023.0020","DOIUrl":"https://doi.org/10.23919/CSMS.2023.0020","url":null,"abstract":"Power grids, due to their lack of network redundancy and structural interdependence, are particularly vulnerable to cascading failures, a phenomenon where a few failed nodes-having their loads exceeding their capacities—can trigger a widespread collapse of all nodes. Here, we extend the cascading failure (Motter-Lai) model to a more realistic perspective, where each node's load capacity is determined to be nonlinearly correlated with the node's centrality. Our analysis encompasses a range of synthetic networks featuring small-world or scale-free properties, as well as real-world network configurations like the IEEE bus systems and the US power grid. We find that fine-tuning this nonlinear relationship can significantly enhance a network's robustness against cascading failures when the network nodes are under attack. Additionally, the selection of initial nodes and the attack strategies also impact overall network robustness. Our findings offer valuable insights for improving the safety and resilience of power grids, bringing us closer to understanding cascading failures in a more realistic context.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10525231","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140895070","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}
There are many studies about flexible job shop scheduling problem with fuzzy processing time and deteriorating scheduling, but most scholars neglect the connection between them, which means the purpose of both models is to simulate a more realistic factory environment. From this perspective, the solutions can be more precise and practical if both issues are considered simultaneously. Therefore, the deterioration effect is treated as a part of the fuzzy job shop scheduling problem in this paper, which means the linear increase of a certain processing time is transformed into an internal linear shift of a triangle fuzzy processing time. Apart from that, many other contributions can be stated as follows. A new algorithm called reinforcement learning based biased bi-population evolutionary algorithm (RB 2 EA) is proposed, which utilizes Q-learning algorithm to adjust the size of the two populations and the interaction frequency according to the quality of population. A local enhancement method which combimes multiple local search stratgies is presented. An interaction mechanism is designed to promote the convergence of the bi-population. Extensive experiments are designed to evaluate the efficacy of RB 2 EA, and the conclusion can be drew that RB 2 EA is able to solve energy-efficient fuzzy flexible job shop scheduling problem with deteriorating jobs (EFFJSPD) efficiently.
{"title":"Biased Bi-Population Evolutionary Algorithm for Energy-Efficient Fuzzy Flexible Job Shop Scheduling with Deteriorating Jobs","authors":"Libao Deng;Yingjian Zhu;Yuanzhu Di;Lili Zhang","doi":"10.23919/CSMS.2023.0021","DOIUrl":"https://doi.org/10.23919/CSMS.2023.0021","url":null,"abstract":"There are many studies about flexible job shop scheduling problem with fuzzy processing time and deteriorating scheduling, but most scholars neglect the connection between them, which means the purpose of both models is to simulate a more realistic factory environment. From this perspective, the solutions can be more precise and practical if both issues are considered simultaneously. Therefore, the deterioration effect is treated as a part of the fuzzy job shop scheduling problem in this paper, which means the linear increase of a certain processing time is transformed into an internal linear shift of a triangle fuzzy processing time. Apart from that, many other contributions can be stated as follows. A new algorithm called reinforcement learning based biased bi-population evolutionary algorithm (RB\u0000<sup>2</sup>\u0000EA) is proposed, which utilizes Q-learning algorithm to adjust the size of the two populations and the interaction frequency according to the quality of population. A local enhancement method which combimes multiple local search stratgies is presented. An interaction mechanism is designed to promote the convergence of the bi-population. Extensive experiments are designed to evaluate the efficacy of RB\u0000<sup>2</sup>\u0000EA, and the conclusion can be drew that RB\u0000<sup>2</sup>\u0000EA is able to solve energy-efficient fuzzy flexible job shop scheduling problem with deteriorating jobs (EFFJSPD) efficiently.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10525671","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140895034","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：