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

{"title":"On Feasibility and Asymptotically Stability of Switched Systems Using Adaptive Multi-Model Predictive Control","authors":"Mohammad Fathi;Hossein Bolandi;Bahman Ghobrani Vaghei;Saeed Ebadollahi","doi":"10.23919/CSMS.2024.0030","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0030","url":null,"abstract":"The present paper attempts to design an adaptive multi-model predictive control strategy for strongly nonlinear or switched systems with various operating points. The proposed control system guarantees the feasibility and the asymptotic stability of the closed-loop system, considering various challenges such as inherent uncertainties in the local models constituting the model bank, limited prediction/control horizons, and set point changes. To this end, four fundamental challenges in this area, namely guaranteeing feasibility throughout the region assigned to each subspace, ensuring asymptotic stability in each subspace considering the inherent uncertainties of the local models, guaranteeing feasibility and asymptotic stability during changes in the set point and switching between the subspaces, are addressed. By introducing transferring mode concept, this paper presents a novel method for guaranteeing the feasibility and stability of the switched systems without the need for increasing the prediction/control horizons or decreasing the size of the feasibility region. The proposed control structure uses a supervisor algorithm along with a soft-switching technique. The supervisor algorithm is responsible for determining the suitable local model/controller pair, determining the operational mode of the control system, managing the soft switching, and specifying the control objectives in accordance with the defined set point. The efficiency of the proposed control strategy is demonstrated by simulating a Continuous Stirred Tank Reactor (CSTR) as the controlled system. Based on the results, the proposed controller is able to guarantee the feasibility and stability of highly nonlinear and switched systems in a wide operating region under set point changes and uncertainties in the local models.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 2","pages":"155-175"},"PeriodicalIF":0.0,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10979683","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143937970","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}

{"title":"Traffic Conflict and Risk Analysis of Small-Spacing Interchange Interweaving Sections on Expressways Using Joint Simulation","authors":"Yanpeng Wang;Fanxing Kong;Zhanji Zheng;Xingliang Liu;Heshan Zhang;Jin Xu","doi":"10.23919/CSMS.2024.0031","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0031","url":null,"abstract":"Affected by the limited interchange spacing, the operational risk of vehicles in expressway small-spacing interchanges (SSls) is more complex compared to other interchanges. In this study, unmanned aerial vehicle (UAV) measurements were integrated with joint simulation data to explore the risk characteristics of SSls with the help of traffic conflict theory. Seven traffic flow parameters, including mainline traffic volume, were selected to evaluate their impact on traffic conflicts. The distribution of four traffic conflict indicators, such as time to collision (TTC), was analyzed, and their severity was categorized using cumulative frequency analysis and minibatch K-means clustering. By varying the spacing, the study scrutinized trends in traffic conflicts, emphasizing the influence of various traffic flow parameters, distinctions in conflict indicators, and the ratio of severe conflicts to total conflicts. Additionally, an analysis of the spatial distribution of severe conflicts was conducted. The results suggested that traffic conflicts in SSls are influenced by multiple factors, with mainline and entry traffic volumes being the most significant. Heavy vehicle proportions and entry ramp speeds had notable effects under certain spacing conditions. Considerable variations were observed in conflict indicators across different spacings, with the maximum conflict speed being the most affected by spacing, while TTC was the least. As spacing increased, the proportion of severe conflicts decreased, with severe TTC dropping from 18% to 10%. High-density conflict zones were identified near merging points in the second and third lanes. With larger spacing, the conflict zone range narrowed while the density of conflict points intensified.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 2","pages":"176-189"},"PeriodicalIF":0.0,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10969594","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143938001","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}

{"title":"RM-MOCO: A Fast-Solving Model for Neural Multi-Objective Combinatorial Optimization Based on Retention","authors":"Huiqing Wei;Fei Han;Qing Liu;Henry Han","doi":"10.23919/CSMS.2024.0029","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0029","url":null,"abstract":"Multiobjective combinatorial optimization (MOCO) problems have a wide range of applications in the real world. Recently, learning-based methods have achieved good results in solving MOCO problems. However, most of these methods use attention mechanisms and their variants, which have room for further improvement in the speed of solving MOCO problems. In this paper, following the idea of decomposition strategy and neural combinatorial optimization, a novel fast-solving model for MOCO based on retention is proposed. A brand new calculation of retention is proposed, causal masking and exponential decay are deprecated in retention, so that our model could better solve MOCO problems. During model training, a parallel computation of retention is applied, allowing for fast parallel training. When using the model to solve MOCO problems, a recurrent computation of retention is applied, enabling quicker problem-solving. In order to make our model more practical and flexible, a preference-based retention decoder is proposed, which allows generating approximate Pareto solutions for any trade-off preferences directly. An industry-standard deep reinforcement learning algorithm is used to train RM-MOCO. Experimental results show that, while ensuring the quality of problem solving, the proposed method significantly outperforms some other methods in terms of the speed of solving MOCO problems.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 2","pages":"125-137"},"PeriodicalIF":0.0,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10969587","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143937969","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}

{"title":"Color Image Encryption Based on Five-Dimensional Continuous Hyperchaotic System and Optimized Arnold Algorithm","authors":"Zhenju Wang;Cong Wang;Ping Ma;Yue Meng;Hongli Zhang","doi":"10.23919/CSMS.2024.0028","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0028","url":null,"abstract":"This paper introduces a novel color image encryption algorithm based on a five-dimensional continuous memristor hyperchaotic system (5D-MHS), combined with a two-dimensional Salomon map and an optimized Arnold transform. Firstly, convert the test image to a 2D pixel matrix then processed in blocks, and each block of the pixel matrix is permuted with chaotic sequences generated by 5D-MHS and 2D Salomon map. Then, the permuted image is permuted for three rounds with the optimized Arnold algorithm. Finally, one of the chaotic sequences generated by 5D-MHS is employed to diffuse the permuted image to obtain the final ciphertext image. In this paper, several pseudo-random sequences are generated and mixed in the permutation stage to achieve higher security. The algorithm achieves a key space of 2⁴⁷², the information entropy of the ciphertext image for the color image is 7.9998, number of pixels change rate (NPCR) and unified average changing intensity (UACI) reached 99.6131 % and 33.4361 %, respectively, and the correlation between pixels is close to O. The simulation results show that the encryption algorithm is efficient and the key system is secure.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 2","pages":"138-154"},"PeriodicalIF":0.0,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10969590","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143937986","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}

{"title":"Systematic Literature Review on Multi-Objective Simulation Optimization","authors":"Mariane Gonçalves de Alcantara;Aneirson Francisco da Silva;Fernando Augusto Silva Marins;Rafael de Carvalho Miranda","doi":"10.23919/CSMS.2024.0037","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0037","url":null,"abstract":"Simulation optimization is a rapidly growing research field, fueled by advances in computational technology. These advances have made it possible to solve complex stochastic optimization problems through simulation. While most published articles focus on single-objective optimization, multl-objective optimization is gaining prominence, allowing the approach of real-world problems that present multiple, conflicting objectives. In this context, the objective of this article was to conduct a systematic literature review to identify articles that present solution methods for Multi-Objective Simulation Optimization (MOSO) problems. The focus was on practical optimization applications in conjunction with Discrete Event Simulation (DES) models, aiming to identify the main aspects of the problems addressed, the methods used, and research opportunities, contributing to future projects. By exploring the characteristics of MOSO problems associated with DES and the applied solution methods, this article innovatively presents a guide to help professionals improve their decision-making processes and assist researchers in developing new research.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 2","pages":"190-220"},"PeriodicalIF":0.0,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10969588","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143937988","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}

{"title":"Efficient Multi-Start Gray Wolf Optimization Algorithm for the Distributed Permutation Flowshop Scheduling Problem with Preventive Maintenance","authors":"Congcong Sun;Hongyan Sang;Leilei Meng;Biao Zhang;Tao Meng","doi":"10.23919/CSMS.2025.0001","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0001","url":null,"abstract":"The distributed permutation flowshop scheduling problem (DPFSP) has received increasing attention in recent years, which always assumes that the machine can process without restrictions. However, in practical production, machine preventive maintenance is required to prevent machine breakdowns. Therefore, this paper studies the DPFSP with preventive maintenance (PM/DPFSP) aiming at minimizing the total flowtime. For solving the problem, a discrete gray wolf optimization algorithm with restart mechanism (DGWO_RM) is proposed. In the initialization phase, a heuristic algorithm that takes into consideration preventive maintenance and idle time is employed to elevate the quality of the initial solution. Next, four local search strategies are proposed for further enhancing the exploitation capability. Furthermore, a restart mechanism is integrated into algorithm to avert the risk of converging prematurely to a suboptimal solution, thereby ensuring a broader exploration of potential solutions. Finally, comprehensive experiments studies are carried out to illustrate the effectiveness of the proposed strategy and to verify the performance of DGWO_RM. The obtained results show that the proposed DGWO_RM significantly outperforms the four state-of-the-art algorithms in solving PM/DPFSP.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 2","pages":"107-124"},"PeriodicalIF":0.0,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10969583","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143937987","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}

{"title":"Effective NSGA-II Algorithm for a Limited AGV Scheduling Problem in Matrix Manufacturing Workshops with Undirected Material Flow","authors":"Xuewu Wang;Jianing Zhang;Yi Hua;Rui Yu","doi":"10.23919/CSMS.2024.0023","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0023","url":null,"abstract":"Automatic guided vehicles (AGVs) are extensively employed in manufacturing workshops for their high degree of automation and flexibility. This paper investigates a limited AGV scheduling problem (LAGVSP) in matrix manufacturing workshops with undirected material flow, aiming to minimize both total task delay time and total task completion time. To address this LAGVSP, a mixed-integer linear programming model is built, and a nondominated sorting genetic algorithm II based on dual population co-evolution (NSGA-IIDPC) is proposed. In NSGA-IIDPC, a single population is divided into a common population and an elite population, and they adopt different evolutionary strategies during the evolution process. The dual population co-evolution mechanism is designed to accelerate the convergence of the non-dominated solution set in the population to the Pareto front through information exchange and competition between the two populations. In addition, to enhance the quality of initial population, a minimum cost function strategy based on load balancing is adopted. Multiple local search operators based on ideal point are proposed to find a better local solution. To improve the global exploration ability of the algorithm, a dual population restart mechanism is adopted. Experimental tests and comparisons with other algorithms are conducted to demonstrate the effectiveness of NSGA-IIDPC in solving the LAGVSP.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 1","pages":"68-85"},"PeriodicalIF":0.0,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10934760","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143655063","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}

{"title":"Dynamic and Heterogeneous Identity-Based Cooperative Co-Evolution for Distributed Lot-Streaming Flowshop Scheduling Problem","authors":"Juan Wang;Guanghui Zhang;Xiaoling Li;Yanxiang Feng","doi":"10.23919/CSMS.2024.0025","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0025","url":null,"abstract":"In this research, a novel dynamic and heterogeneous identity based cooperative co-evolutionary algorithm (DHICCA) is proposed for addressing the distributed lot-streaming flowshop scheduling problem (DLSFSP) with the objective to minimize the makespan. A two-layer-vector representation is devised to bridge the solution space of DLSFSP and the search space of DHICCA. In the evolution of DHICCA, population individuals are endowed with heterogeneous identities according to their quality, including superior individuals, ordinary individuals, and inferior individuals, which serve local exploitation, global exploration, and diversified restart, respectively. Because individuals with different identities require different evolutionary mechanisms to fully unleash their respective potentials, identity-specific evolutionary operators are devised to evolve them in a cooperative co-evolutionary way. This is important to use limited population resources to solve complex optimization problems. Specifically, exploitation is carried out on superior individuals by devising three exploitative operators with different intensities based on techniques of variable neighborhood, destruction-construction, and gene targeting. Exploration is executed on ordinary individuals by a newly constructed discrete Jaya algorithm and a probability crossover strategy. In addition, restart is performed on inferior individuals to introduce new evolutionary individuals to the population. After the cooperative co-evolution, all individuals with different identities are merged as a population again, and their identities are dynamically adjusted by new evaluation. The influence of parameters on the algorithm is investigated based on design-of-experiment and comprehensive computational experiments are used to evaluate the performance of all algorithms. The results validate the effectiveness of special designs and show that DHICCA performs more efficient than the existing state-of-the-art algorithms in solving the DLSFSP.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 1","pages":"86-106"},"PeriodicalIF":0.0,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10934759","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143655062","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}

{"title":"Scheduling Bi-Objective Lot-Streaming Hybrid Flow Shops with Consistent Sublots via an Enhanced Artificial Bee Colony Algorithm","authors":"Benxue Lu;Kaizhou Gao;Peiyong Duan;Adam Slowik","doi":"10.23919/CSMS.2024.0022","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0022","url":null,"abstract":"This work addresses bi-objective hybrid flow shop scheduling problems considering consistent sublots (Bi-HFSP_CS). The objectives are to minimize the makespan and total energy consumption. First, the Bi-HFSP_CS is formalized, followed by the establishment of a mathematical model. Second, enhanced version of the artificial bee colony (ABC) algorithms is proposed for tackling the Bi-HFSP_CS. Then, fourteen local search operators are employed to search for better solutions. Two different O-learning tactics are developed to embed into the ABC algorithm to guide the selection of operators throughout the iteration process. Finally, the proposed tactics are assessed for their efficacy through a comparison of the ABC algorithm, its three variants, and three effective algorithms in resolving 95 instances of 35 different problems. The experimental results and analysis showcase that the enhanced ABC algorithm combined with O-learning (QABC1) demonstrates as the top performer for solving concerned problems. This study introduces a novel approach to solve the Bi-HFSP_CS and illustrates its efficacy and superior competitive strength, offering beneficial perspectives for exploration and research in relevant domains.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 1","pages":"46-67"},"PeriodicalIF":0.0,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10934126","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143655065","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}

{"title":"Exploring Dynamics and Hardware Implementation of an Enhanced 5D Hyperchaotic Memristive System Inspired by Sprott-C System","authors":"Abdulmajeed Abdullah Mohammed Mokbel;Fei Yu;Yumba Musoya Gracia;Bohong Tan;Hairong Lin;Herbert Ho-Ching Iu","doi":"10.23919/CSMS.2024.0024","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0024","url":null,"abstract":"This paper proposes a novel 5D hyperchaotic memristive system based on the Sprott-C system configuration, which greatly improves the complexity of the system to be used for secure communication and signal processing. A critical aspect of this research work is the introduction of a flux-controlled memristor that exhibits chaotic behavior and dynamic responses of the system. To this respect, detailed mathematical modeling and numerical simulations about the stability of the system's equilibria, bifurcations, and hyperchaotic dynamics were conducted and showed a very wide variety of behaviors of great potential in cryptographic applications and secure data transmission. Then, the flexibility and efficiency of the real-time operating environment were demonstrated, and the system was actually implemented on a field-programmable gate array (FPGA) hardware platform. A prototype that confirms the theoretical framework was presented, providing new insights for chaotic systems with practical significance. Finally, we conducted National Institute of Standards and Technology (NIST) testing on the proposed 5D hyperchaotic memristive system, and the results showed that the system has good randomness.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"5 1","pages":"34-45"},"PeriodicalIF":0.0,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10934125","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143655064","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}