{"title":"A discrete event simulator to implement deep reinforcement learning for the dynamic flexible job shop scheduling problem","authors":"Lorenzo Tiacci, Andrea Rossi","doi":"10.1016/j.simpat.2024.102948","DOIUrl":"10.1016/j.simpat.2024.102948","url":null,"abstract":"<div><p>The job shop scheduling problem, which involves the routing and sequencing of jobs in a job shop context, is a relevant subject in industrial engineering. Approaches based on Deep Reinforcement Learning (DRL) are very promising for dealing with the variability of real working conditions due to dynamic events such as the arrival of new jobs and machine failures. Discrete Event Simulation (DES) is essential for training and testing DRL approaches, which are based on the interaction of an intelligent agent and the production system. Nonetheless, there are numerous papers in the literature in which DRL techniques, developed to solve the Dynamic Flexible Job Shop Problem (DFJSP), have been implemented and evaluated in the absence of a simulation environment. In the paper, the limitations of these techniques are highlighted, and a numerical experiment that demonstrates their ineffectiveness is presented. Furthermore, in order to provide the scientific community with a simulation tool designed to be used in conjunction with DRL techniques, an agent-based discrete event simulator is also presented.</p></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1569190X24000625/pdfft?md5=849864b242edbe1834ecc16bf681e910&pid=1-s2.0-S1569190X24000625-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140775130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Energy efficient Security Driven Scheduling for Real-Time Tasks through DVS-enabled Fog Networks","authors":"Surendra Singh","doi":"10.1016/j.simpat.2024.102941","DOIUrl":"https://doi.org/10.1016/j.simpat.2024.102941","url":null,"abstract":"<div><p>The issue of task scheduling for a multi-core processor in Fog networks, with a focus on security and energy efficiency is of great importance in real-time systems. Currently, scheduling algorithms designed for cluster computing environments utilize dynamic voltage scaling (DVS) to decrease CPU power consumption, albeit at the expense of performance. This problem becomes more pronounced when a real-time task requires robust security, resulting in heavily overloaded nodes (CPUs or computing systems) in a cluster computing environment. To address such challenges, a solution called “Energy efficient Security Driven Scheduling of Real-Time Tasks using DVS-enabled Fog Networks (ESDS)” has been proposed. The primary goal of ESDS is to dynamically adjust CPU voltages or frequencies based on the workload conditions of nodes in Fog networks, thereby achieving optimal trade-offs between security, scheduling, and energy consumption for real-time tasks. By dynamically reducing voltage or frequency levels, ESDS conserves energy while still meeting deadlines for both running and new tasks, especially during periods of high system workload. Comprehensive experiments have been carried out to compare the ESDS algorithm with established baseline algorithms, including MEG, MELV, MEHV, and AEES. These experiments affirm the originality and effectiveness of the ESDS algorithm.</p></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140559231","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TALICS3: Tape library cloud storage system simulator","authors":"Suayb S. Arslan , James Peng , Turguy Goker","doi":"10.1016/j.simpat.2024.102947","DOIUrl":"10.1016/j.simpat.2024.102947","url":null,"abstract":"<div><p>High performance computing data is surging fast into the exabyte-scale world, where tape libraries are the main platform for long-term durable data storage besides high-cost DNA. Tape libraries are extremely hard to model, but accurate modeling is critical for system administrators to obtain valid performance estimates for their designs. This research introduces a discrete–event tape simulation platform that realistically models tape library behavior in a networked cloud environment, by incorporating real-world phenomena and effects. The platform addresses several challenges, including precise estimation of data access latency, rates of robot exchange, data collocation, deduplication/compression ratio, and attainment of durability goals through replication or erasure coding. Using the proposed simulator, one can compare the single enterprise configuration with multiple commodity library configurations, making it a useful tool for system administrators and reliability engineers. This makes the simulator a valuable tool for system administrators and reliability engineers, enabling them to acquire practical and dependable performance estimates for their enduring, cost-efficient cold data storage architecture designs.</p></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140765491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wei Xie , Xiongfeng Peng , Yanru Liu , Junhai Zeng , Lili Li , Toshio Eisaka
{"title":"Conflict-free coordination planning for multiple automated guided vehicles in an intelligent warehousing system","authors":"Wei Xie , Xiongfeng Peng , Yanru Liu , Junhai Zeng , Lili Li , Toshio Eisaka","doi":"10.1016/j.simpat.2024.102945","DOIUrl":"https://doi.org/10.1016/j.simpat.2024.102945","url":null,"abstract":"<div><p>With the rapid development of intelligent manufacturing, the application of automated guided vehicles (AGVs) in intelligent warehousing systems has become increasingly common. Efficiently planning the conflict-free paths of multiple AGVs while minimizing the total task completion time is crucial for evaluating the performance of the system. Distinguishing itself from recent approaches where conflict avoidance strategy and path planning algorithm are executed independently or separately, this paper proposes an improved conflict-free A* algorithm by integrating the conflict avoidance strategy into the initial path planning process. Based on the heuristic A* algorithm, we use the instruction time consumption as the key evaluation indicator of the cost function and add the turning consumption in the future path cost evaluation. Moreover, the expansion mode of child nodes is optimized where a five-element search set containing the “zero movement” is proposed to implement a proactive pause-wait strategy. Then the prediction rules are designed to add constraints to three types of instructions based on the timeline map, guiding the heuristic planning to search for conflict-free child nodes. Extensive simulations show that the coordination planning based on the improved conflict-free A* algorithm not only effectively achieves advanced conflict avoidance at the algorithmic level, but also exhibits lower computational complexity and higher task completion efficiency compared to other coordination planning methods.</p></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140647515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"PredictOptiCloud: A hybrid framework for predictive optimization in hybrid workload cloud task scheduling","authors":"Sugan J , Isaac Sajan R","doi":"10.1016/j.simpat.2024.102946","DOIUrl":"10.1016/j.simpat.2024.102946","url":null,"abstract":"<div><p>In the realm of e-commerce, the growing complexity of dynamic workloads and resource management poses a substantial challenge for platforms aiming to optimize user experiences and operational efficiency. To address this issue, the PredictOptiCloud framework is introduced, offering a solution that combines sophisticated methodologies with comprehensive performance analysis. The framework encompasses a domain-specific approach that extracts and processes historical workload data, utilizing Domain-specific Hierarchical Attention Bi LSTM networks. This enables PredictOptiCloud to effectively predict and manage both stable and dynamic workloads. Furthermore, it employs the Spider Wolf Optimization (SWO) for load balancing and offloading decisions, optimizing resource allocation and enhancing user experiences. The performance analysis of PredictOptiCloud involves a multifaceted evaluation, with key metrics including response time, throughput, resource utilization rate, cost-efficiency, conversion rate, rate of successful task offloading, precision, accuracy, task volume, and churn rate. By meticulously assessing these metrics, PredictOptiCloud demonstrates its prowess in not only predicting and managing workloads but also in optimizing user satisfaction, operational efficiency, and cost-effectiveness, ultimately positioning itself as an invaluable asset for e-commerce platforms striving for excellence in an ever-evolving landscape.</p></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140763708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Haozhou Ma , Peng Zhang , Yingwei Dong , Xuewen Wang , Rui Xia , Bo Li
{"title":"Study on the rigid-discrete coupling effect of scraper conveyor under different chain speed-load conditions","authors":"Haozhou Ma , Peng Zhang , Yingwei Dong , Xuewen Wang , Rui Xia , Bo Li","doi":"10.1016/j.simpat.2024.102943","DOIUrl":"https://doi.org/10.1016/j.simpat.2024.102943","url":null,"abstract":"<div><p>The complexity of the underground environment in coal mines often leads to varying load conditions during the operation of the scraper conveyor, which can affect the lifespan of its components and result in unnecessary energy consumption. A test platform for the scraper conveyor was constructed based on the similarity theory to measure torque, speed, chain tension, and scraper acceleration during transportation. A DEM-MBD model of the scraper conveyor was developed and validated through transport tests and similarity theories to analyze the rigid-discrete coupling effect under different chain speed-load conditions. The results revealed a stratification phenomenon and a Brazilian fruit effect in the movement of coal. The average velocity of the upper and lower coal layers gradually increased during the transportation, while the difference between them gradually decreased. As the load increased, the stacking density and height of coal between scrapers also increased, leading to a higher force exerted on the scraper and chain. As the chain speed increased, the stacking density and height of coal between scrapers decreased, along with a decrease in the force applied to the scraper and chain. The formation of three-body wear necessitates a specific positional condition. When the scraper (chain)- coal-deck plate (chute liner) forms a particle stagnation state, severe wear occurs on the parts. This study provides a foundation for analyzing the transport mechanism of scraper conveyor from the particle perspective, offers a simulation reference for analyzing the mechanical and tribological characteristics of the line pan and scraper chain, and serves as a guideline for the future development of transportation state monitoring and the optimization and enhancement of components under different working conditions.</p></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140559173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modeling and simulation of services computing✰","authors":"Helen D. Karatza","doi":"10.1016/j.simpat.2024.102944","DOIUrl":"10.1016/j.simpat.2024.102944","url":null,"abstract":"","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140628444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zilong Yang , Yong Hu , Mingxu Xu , Jiyu Tian , Hao Pang , Xiangyang Liu
{"title":"An iterative method to improve the calibration accuracy of flat-joint models: Catch-up penalty algorithm","authors":"Zilong Yang , Yong Hu , Mingxu Xu , Jiyu Tian , Hao Pang , Xiangyang Liu","doi":"10.1016/j.simpat.2024.102942","DOIUrl":"https://doi.org/10.1016/j.simpat.2024.102942","url":null,"abstract":"<div><p>Parameter calibration is a critical step in accurately modeling using the discrete element method (DEM), but the time-consuming and complex calibration process limits the practical utilization of DEM. Herein, a catch-up penalty algorithm was proposed to simultaneously adjust multiple micro parameters of the flat-joint model through iterations. The effect of micro parameters on macro parameters was investigated by conducting 64 sets of orthogonal tests in PFC3D and analyzing the results by ANOVA. Regression analysis was used to establish the preliminary formulas for directly obtaining initial values of micro parameters and the trend equations for deriving iterative formulas. Based on the preliminary and iterative formulas, the calibration process for the algorithm was proposed, in which the micro parameters of each iteration can be calculated, thereby reducing researchers' dependence on the experience. The calibration capability of the algorithm was verified on four types of rocks, and the results showed that the average calibration error between the simulation results and the target values was reduced to within 5 % after six iterations, proving the reliability and applicability of the algorithm.</p></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140542926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Luis Veas-Castillo , Juan Ovando-Leon , Carolina Bonacic , Veronica Gil-Costa , Mauricio Marin
{"title":"A methodology for performance estimation of bot-based applications for natural disasters","authors":"Luis Veas-Castillo , Juan Ovando-Leon , Carolina Bonacic , Veronica Gil-Costa , Mauricio Marin","doi":"10.1016/j.simpat.2024.102931","DOIUrl":"https://doi.org/10.1016/j.simpat.2024.102931","url":null,"abstract":"<div><p>Natural disasters drastically impact the society, causing emotional disorders as well as serious accidents that can lead to death. These kinds of disasters cause serious damage in computer and communications systems, due to the complete or partial destruction of the infrastructure, causing software applications that actually run on those infrastructures to crash. Additionally, these software applications have to provide a stable service to a large number of users and support unpredictable peaks of workloads. In this work, we propose a methodology to predict the performance of software applications designed for emergency situations when a natural disaster strikes. The applications are deployed on a distributed platform formed of commodity hardware usually available from universities, using container technology and container orchestration. We also present a specification language to formalize the definition and interaction between the components, services and the computing resources used to deploy the applications. Our proposal allows to predict computing performance based on the modeling and simulation of the different components deployed on a distributed computing platform combined with machine learning techniques. We evaluate our proposal under different scenarios, and we compare the results obtained by our proposal and by actual implementations of two applications deployed in a distributed computing infrastructure. Results show that our proposal can predict the performance of the applications with an error between 2% and 7%.</p></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140535632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xu Chen, Siyu Li, Wenzhang Yang, Yujia Chen, Hao Wang
{"title":"Enhanced microsimulation framework for right-turning vehicle-pedestrian interactions at signalized intersection","authors":"Xu Chen, Siyu Li, Wenzhang Yang, Yujia Chen, Hao Wang","doi":"10.1016/j.simpat.2024.102930","DOIUrl":"https://doi.org/10.1016/j.simpat.2024.102930","url":null,"abstract":"<div><p>The unclear understanding of right-turning vehicle behavior at signalized intersections complicates the interaction with pedestrians. Current micro-dynamic modeling research falls short of effectively simulating this complexity. Specifically, the existing models fail to adequately capture the three states that right-turning vehicles may undergo: car-following, free right-turn, and avoidance of conflicting pedestrians. Moreover, pedestrian behavior is typically influenced by encountering conflicting vehicles and surrounding pedestrians, as well as traffic signals. To simulate these behaviors, the right-turning and yielding intelligent driver model (RTYIDM), the modified social force model (MSFM) considering green light pressure, and the yielding decision model between pedestrians and vehicles have been established. Model calibration is performed using detailed behavioral data collected and extracted from field observations. Furthermore, a microsimulation platform with 3D visualization and playback features has been developed to facilitate testing and demonstration. Model validation is performed by comparing it with actual trajectories in three representative scenarios of pedestrian crossing with conflict between pedestrians and vehicles. Meanwhile, the calibrated model's ability to predict pedestrian-interaction events and estimate vehicle yielding rates is also assessed. The well-established simulation performance of the proposed model makes it a useful tool for evaluating existing traffic operations.</p></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140535631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}