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

{"title":"Q-Learning Based Meta-Heuristics for Scheduling Bi-Objective Surgery Problems with Setup Time","authors":"Ruixue Zhang;Hui Yu;Adam Slowik;Kaizhou Gao","doi":"10.23919/CSMS.2024.0021","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0021","url":null,"abstract":"Since the increasing demand for surgeries in hospitals, the surgery scheduling problems have attracted extensive attention. This study focuses on solving a surgery scheduling problem with setup time. First, a mathematical model is created to minimize the maximum completion time (makespan) of all surgeries and patient waiting time, simultaneously. The time by the fatigue effect is included in the surgery time, which is caused by doctors' long working time. Second, four mate-heuristics are optimized to address the relevant problems. Three novel strategies are designed to improve the quality of the initial solutions. To improve the convergence of the algorithms, seven local search operators are proposed based on the characteristics of the surgery scheduling problems. Third, Q-learning is used to dynamically choose the optimal local search operator for the current state in each iteration. Finally, by comparing the experimental results of 30 instances, the Q-learning based local search strategy's effectiveness is verified. Among all the compared algorithms, the improved artificial bee colony (ABC) with Q-learning based local search has the best competitiveness.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 4","pages":"321-338"},"PeriodicalIF":0.0,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10820941","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142918240","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":"Advance in Significant Wave Height Prediction: A Comprehensive Survey","authors":"Jinyuan Mo;Xianghan Wang;Shengjun Huang;Rui Wang","doi":"10.23919/CSMS.2024.0019","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0019","url":null,"abstract":"The significant wave height prediction holds critical value for marine energy development, coastal infrastructure planning, and ensuring safety in maritime operations. The precision of such predictions carries substantial theoretical and practical weight. This survey delivers an exhaustive evaluation and integration of the latest studies and advances in the domain of significant wave height prediction, serving as a methodical guidepost for academicians. The study introduces an all-encompassing predictive framework for significant wave height, which not only integrates diverse established forecasting techniques but also paves the way for novel research trajectories and creative breakthroughs. The framework is structured into four principal layers, i.e., feature selection, basic prediction, data decomposition, and parameter optimization. The ensuing sections meticulously dissect the methodologies within these strata, elucidating their core concepts, distinctive features, merits, and constraints, and their applicability to significant wave height prediction. To wrap up, the study delves into fresh research inquiries and avenues pertinent to the discipline, thereby broadening the comprehension of significant wave height prediction. In essence, this scholarly article imparts critical knowledge beneficial to the realm of marine technology.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 4","pages":"402-439"},"PeriodicalIF":0.0,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10820943","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142918107","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":"A Review of Integrated Optimization Method of Batch Planning and Scheduling for Steelmaking-Continuous Casting-Hot Rolling Production Under Uncertain Environment Based on Lagrangian Relaxation Framework","authors":"Liangliang Sun;Xirang Hao;Yunpeng Li;Jinghan Xue;Natalia M. Matsveichuk;Yuri N. Sotskov;Qichun Zhang","doi":"10.23919/CSMS.2024.0018","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0018","url":null,"abstract":"The integrated process of steelmaking, continuous casting, and hot rolling (SM-CC-HR) covers the entire process from refining liquid steel to manufacturing semi-finished steel products. Its batch planning and scheduling are connected to the production contract plan at the upper level and the production process control at the lower level, which is the key to achieving efficient and full process steel manufacturing. Batch planning determines the location of the slabs to be produced in the converter, ladle, continuous casting machine, and hot rolling mill by combining production orders, process standards, and production conditions. Production scheduling, guided by batch planning, combines production performance indicators, process constraints, etc., to determine the equipment selection and start-stop times of specific production units at each process. The synergy of the two aims to optimize production profitability, energy consumption, efficiency, etc., through rational decisions, ensuring the efficiency and flexibility of the steel production process. However, due to the traditional “divide and conquer” management mode and the influence of many uncertain factors, it is difficult to ensure the flexible balance between the demand and capacity, as well as a reasonable matching of logistics and resources among the production processes that operate independently. Considering the uncertain environment and the integration of SM-CC-HR, this paper summarizes the research status of previous scholars from three aspects: mathematical modeling, model optimization, and algorithm optimization based on the Lagrangian framework. It discusses the research status of batch planning and scheduling methods for SM-CC-HR production based on the Lagrangian relaxation framework, analyzes the problems existing in current research, and points out the main research directions and important research contents in the future, in order to promote the research and application of batch planning and scheduling problems for SM-CC-HR under uncertain environments.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 4","pages":"387-401"},"PeriodicalIF":0.0,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10820944","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142918105","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":"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}

{"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}

{"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⁵¹²\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}

{"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}

{"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}

{"title":"An Adaptive Shuffled Frog-Leaping Algorithm for Hybrid-Flow Shop Scheduling with No Precedence Between Some Stages","authors":"Zhenghui Yin;Deming Lei;Bo Yang","doi":"10.23919/CSMS.2024.0014","DOIUrl":"https://doi.org/10.23919/CSMS.2024.0014","url":null,"abstract":"Hybrid flow shop scheduling problem (HFSP) has been extensively considered, however, some real-life conditions are seldom investigated. In this study, HFSP with no precedence between some stages is solved and an adaptive shuffled frog-leaping algorithm (ASFLA) is developed to optimize makespan. A new solution representation and a decoding procedure are presented, an adaptive memeplex search and dynamical population shuffling are implemented together. Many computational experiments are implemented. Computational results prove that the new strategies of ASFLA are effective and ASFLA is very competitive in solving HFSP with no precedence between some stages.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"4 3","pages":"292-302"},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10737164","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142524240","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":"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":"4 2","pages":"109-123"},"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}