{"title":"A consensus-based multi-criteria decision making method integrating GLDS method and quantum probability theory for risk analysis of human errors","authors":"Qiaohong Zheng , Xinwang Liu","doi":"10.1016/j.cie.2024.110847","DOIUrl":"10.1016/j.cie.2024.110847","url":null,"abstract":"<div><div>Human error is one of the major contributors to adverse events in a socio-technical system. Human factor analysis and classification system (HFACS), a qualitative method, is widely recognized for analyzing human errors from a systematic perspective. To overcome its limitation in quantitative analysis of the risk of human error, many multi-criteria decision making (MCDM) techniques are combined with HFACS. However, most existing MCDM technique-based HFACS methods ignore the uncertainty of experts’ opinions, the consensus among experts, and the interference effect between experts. To this end, a consensus reaching process (CRP)-based linguistic MCDM integrating the gained and lost dominance score (GLDS) method and quantum probability theory (QPT) is proposed to rank human errors’ risk under the HFACS framework. First, 2-tuple linguistic variables are utilized to represent experts’ opinions on human errors’ risk, which can handle experts’ linguistic opinions in an interpretable, accurate, and simple way. Second, a two-stage feedback mechanism-based CRP shifts to identify the human errors whose risk evaluation information is with low consensus degree and improve their consensus, which contributes to high consensus on human errors’ risk prioritization results. Then, GLDS and QPT are combined to derive human errors’ collective risk value, where GLDS considers both the comprehensive and worst performances of human errors and QPT considers the interference effect among experts. Finally, a case study of risk analysis for human errors involved in hospital care is conducted to show the efficiency of the proposed method.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110847"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143180129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Some new real-time monitoring schemes for Gumbel’s bivariate exponential time between the events","authors":"Peile Chen , Amitava Mukherjee , Wei Yang , Jiujun Zhang","doi":"10.1016/j.cie.2024.110759","DOIUrl":"10.1016/j.cie.2024.110759","url":null,"abstract":"<div><div>Monitoring the vector of times between multiple events is essential in a high-quality process such as healthcare operations. To this end, the multivariate time between events (TBE) process monitoring schemes are regularly used as one of the most straightforward and appealing visual tools. The existing literature on multivariate TBE schemes focuses almost exclusively on using complete information availed in vector-based TBE data, often making delayed monitoring as it requires observing the complete set of time values in a vector-valued observation. To address this issue, we recommend monitoring the minimum time value of vector TBE data to reach decisions faster and more efficiently. We introduce several new real-time exponentially weighted moving average (EWMA) schemes for monitoring Gumbel’s bivariate exponential TBE processes. We compare them with existing schemes using fully observed vector-based schemes. A Markov chain method is developed to compute the average time to signal (ATS), and the optimal parameters are found. Finally, three real-life examples are used to illustrate the implementation of the proposed schemes.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110759"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143181804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new model for calculating human trust behavior during human-AI collaboration in multiple decision-making tasks: A Bayesian approach","authors":"Song Ding , Xing Pan , Lunhu Hu , Lingze Liu","doi":"10.1016/j.cie.2025.110872","DOIUrl":"10.1016/j.cie.2025.110872","url":null,"abstract":"<div><div>The advancement of Artificial Intelligence (AI) technology has made human-AI collaboration increasingly common. Trust is a decisive factor influencing the quality of such collaboration, as uncalibrated trust may lead to task failure or even catastrophic consequences, significantly jeopardizing the safety of human–machine systems. Therefore, this paper proposes a Bayesian model for predicting human trust behavior towards AI based on human self-confidence and confidence in AI. Grounding in human cognition processes, the model simultaneously considers task difficulty and AI ability. Specifically designed within the context of multiple decision-making tasks with AI assistance, we introduce a task called Multi-Ball Motion (MBM), where participants collaborate with AIs of varying abilities to complete tasks under different levels of difficulty. We report experimental results involving 21 participants, demonstrating that our model effectively explains both the behavioral and subjective data of participants. It captures the dynamic changes in participants’ two types of confidence during the experiment and personalized predictions of their trust behavior, achieving an average prediction accuracy of 97.6%. Furthermore, the model adeptly elucidates the cognition processes underlying participants’ trust behavior formation. This work lays a solid foundation for trust calibration and risk analysis of human-AI systems.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110872"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143179703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hazel Griffith, Cristina Ruiz-Martin, Gabriel Wainer
{"title":"A Discrete-event modeling method to study human behavior for spread of diseases on university campuses","authors":"Hazel Griffith, Cristina Ruiz-Martin, Gabriel Wainer","doi":"10.1016/j.cie.2024.110732","DOIUrl":"10.1016/j.cie.2024.110732","url":null,"abstract":"<div><div>The COVID-19 pandemic has highlighted the importance of defining sound policies to make attending workplaces safer. Sometimes, deciding on different policies is challenging as this highly depends on the behavior of the individuals. This research introduces a Discrete Event-based methodology and a prototype implementation to study such policies, including human behavior along with information about the workplace layout and building characteristics such as ventilation rate or room capacity. The method is based on a combination of agent-based models, diffusion processes and discrete-event simulation. We exemplify how to use this method using a case study based on Carleton University’s Campus, in which we use the methodology and tools to study the effect of ventilation, as well as the application of a policy where sick students are denied entry to the campus on the number of disease cases on campus.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110732"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143179717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hamid Latif-Martínez , José Suárez-Varela , Albert Cabellos-Aparicio , Pere Barlet-Ros
{"title":"GAT-AD: Graph Attention Networks for contextual anomaly detection in network monitoring","authors":"Hamid Latif-Martínez , José Suárez-Varela , Albert Cabellos-Aparicio , Pere Barlet-Ros","doi":"10.1016/j.cie.2024.110830","DOIUrl":"10.1016/j.cie.2024.110830","url":null,"abstract":"<div><div>Network anomaly detection is essential to promptly detect and fix issues in the network. Particularly, detecting traffic anomalies enables the early detection of configuration errors, malicious activities, or equipment malfunctions that could lead to severe impact on the network. In this paper, we present <em>GAT-AD</em>, a Deep Learning-based anomaly detection solution for network monitoring systems, which integrates a custom neural network model based on Graph Attention Networks (GAT). Our solution monitors aggregated traffic on origin–destination flows and automatically defines contexts that group flows with similar past activity. The neural network model within <em>GAT-AD</em> can be efficiently trained in a self-supervised manner. We evaluate our solution against two state-of-the-art anomaly detection baselines also based on graph representations and Deep Learning, in two different datasets: <span><math><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow></math></span> <em>WaDi</em>, which is a well-known dataset for anomaly detection in a distributed sensor network, and <span><math><mrow><mo>(</mo><mi>i</mi><mi>i</mi><mo>)</mo></mrow></math></span> <em>Abilene</em>, where we inject synthetically-generated anomalies into a dataset with real-world traffic from a large-scale backbone network. The results show that <em>GAT-AD</em> outperforms the two anomaly detection baselines: in <em>WaDi</em> by 14.1% in recall and 10.07% in F1-score, and in the <em>Abilene</em> dataset by <span><math><mo>≈</mo></math></span>17.5% recall with respect to the best baseline.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110830"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143179718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fleet size problem for one-way electric carsharing services considering customers’ waiting tolerance and waiting stress","authors":"Ting Wu , Min Xu , Abdelrahman E.E. Eltoukhy","doi":"10.1016/j.cie.2024.110784","DOIUrl":"10.1016/j.cie.2024.110784","url":null,"abstract":"<div><div>Service operation problems arising from electric carsharing services have been the research subject of many scholars in the past few years. Previous studies did not consider customers’ psychological waiting stress in the decision-making of electric carsharing services. This study addresses a fleet size problem for one-way electric carsharing services while considering vehicle relocation, vehicle charging, and customers’ waiting tolerance as well as psychological waiting stress. A mixed-integer nonlinear programming (MINLP) model is first developed for the problem. By exploring the model convexity, we put forward an effective outer-approximation algorithm such that the ε-optimal solution can be obtained. Numerical experiments are conducted to demonstrate the efficacy of the proposed model and solution method. We also analyze how the consideration of customers’ waiting tolerance and waiting stress influences the fleet size, system profitability, and service level.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110784"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143180718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jian Li , Hongwei Wang , Zongyi Mu , Yulong Li , Yanbin Du
{"title":"A new reliability allocation method for mechanical systems considering parts recycling and performance stability","authors":"Jian Li , Hongwei Wang , Zongyi Mu , Yulong Li , Yanbin Du","doi":"10.1016/j.cie.2024.110792","DOIUrl":"10.1016/j.cie.2024.110792","url":null,"abstract":"<div><div>A reliability allocation method for mechanical system is proposed in this paper, which considers the parts recycling and the performance stability of system. First, taking the <em>meta</em>-action of the mechanical system as the analysis object, and six influencing factors are comprehensively considered, including the maturity of unit technology, environmental severity, parts recycling and reuse, unit structural complexity, unit maintenance coefficient, and performance impact. The maturity of unit technology, environmental severity and parts recycling and reuse as the qualitative evaluation indexes; The complex of unit structure, coefficient of unit maintenance and performance impact as the quantitative evaluation indexes. Then, the qualitative data and quantitative data are comprehensively analyzed by TOPSIS method to obtain the reliability distribution coefficient of each unit, and the reliability of the mechanical system is allocated reasonably. Compared with the traditional method, the reliability allocation process of mechanical system is analyzed from the perspective of the lifecycle cost and the perspective of mechanical system performance stability. The boundary of influence factors is clear and the rationality results is more reasonable. The reliability allocation of NC rotary table system is analyzed by using the proposed method, and the allocation results is compared with the traditional method to verify the effectiveness of this method.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110792"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143180720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Meng Wang , Xiang Liu , Liping Wang , Yunqi Bian , Kun Fan , Ren-Qian Zhang
{"title":"A data-driven optimization model for the scattered storage assignment with replenishment","authors":"Meng Wang , Xiang Liu , Liping Wang , Yunqi Bian , Kun Fan , Ren-Qian Zhang","doi":"10.1016/j.cie.2024.110766","DOIUrl":"10.1016/j.cie.2024.110766","url":null,"abstract":"<div><div>Modern warehouses are transitioning from pure storage facilities to order fulfillment centers. To improve order-picking efficiency, picking areas are restricted to small zones to save picker travel distance and thus can only store a limited quantity of SKUs. As a result, replenishment must be frequently carried out which not only causes intensive working efforts but also impacts the order-picking efficiency. Despite of the important role of replenishment, it has been seldom considered in storage assignment planning. This paper proposes a novel optimization model for the storage assignment problem considering both the order-picking and replenishment operations. Instead of the traditional first-extract-then-optimize paradigm, we develop an effective solution method for the problem by integrating the extraction and optimization steps together to avoid the loss of information. Intensive experiments and a case study are presented, the results of which indicate significant advantages of our model against the state-of-the-art counterpart. Several managerial implications are derived: (1) Order data implies substantial useful information for storage assignment planning, including but not limited to the demand correlation of products; (2) The replenishment efforts are intensive and negatively correlated to the order-picking efforts, which therefore should not be neglected in storage assignment planning; (3) To minimize the total working efforts, the optimal replenishment level <span><math><mi>r</mi></math></span> of the <span><math><mrow><mo>(</mo><mi>r</mi><mo>,</mo><mi>S</mi><mo>)</mo></mrow></math></span> replenishment policy should be more than <span><math><mrow><mn>0</mn><mo>.</mo><mn>4</mn><mi>S</mi></mrow></math></span> but less than <span><math><mrow><mn>0</mn><mo>.</mo><mn>6</mn><mi>S</mi></mrow></math></span> with respect to each SKU.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110766"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143180892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Research on location-inventory-routing optimization of emergency logistics based on multiple reliability under uncertainty","authors":"Ling Zhang , Na Yuan , Jing Wang , Jizhao Li","doi":"10.1016/j.cie.2024.110826","DOIUrl":"10.1016/j.cie.2024.110826","url":null,"abstract":"<div><div>Earthquakes, floods and other types of natural disasters are frequent and bring many devastating effects. The research related to emergency logistics has received much attention in recent years. In order to further improve the rescue efficiency and reduce disaster losses, a multi-objective two-stage stochastic programming model of location-inventory-routing of emergency logistics based on multiple reliability under uncertainty is addressed. The proposed model includes three types of uncertainty as demand, supply and transportation time, and two kinds of reliability as distribution center facilities and road access. It is used for integrated decision making in disaster preparedness and response stages. Factors such as material bulk procurement discount, pre-disaster budget, multiple transportation modes, capacity constraints, and disaster scenarios are considered comprehensively. Then, an algorithm was developed. A non-dominated ranking genetic algorithm (NSGA-II) is used to solve the developed model according to its characteristics. The validity of the model and algorithm is verified by conducting a case study on an earthquake in Sichuan, China, and the Pareto optimal solution set is obtained. Finally, sensitivity analysis of the parameters is performed to investigate the effect of changes in key parameters on the model solutions. Thus, some relevant management insights are provided. The results show that an appropriate increase in the pre-disaster budget can substantially reduce the response cost in the post-disaster period. In addition, increasing the number of resident helicopters within the material inventory by a certain amount can help reduce the total distribution time.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110826"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143181749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Behnam Mohammad Hasani Zade, Najme Mansouri, Mohammad Masoud Javidi
{"title":"An improved beluga whale optimization using ring topology for solving multi-objective task scheduling in cloud","authors":"Behnam Mohammad Hasani Zade, Najme Mansouri, Mohammad Masoud Javidi","doi":"10.1016/j.cie.2024.110836","DOIUrl":"10.1016/j.cie.2024.110836","url":null,"abstract":"<div><div>To enhance cloud system performance and customer satisfaction levels, task scheduling must be addressed in the system. Beluga Whale Optimization (BWO) is a metaheuristic method that was developed recently. However, this method still suffers from local minima stagnation despite having an operator that enhances the diversity of population. As a result, Opposition-Based Learning (OBL) can be combined with a Levy Fight Distribution (LFD) and a hybrid balance factor to overcome conventional BWO’s main weaknesses, including slow convergence and local optima traps. We present a multi-objective form of improved BWO (IBWO) to solve task scheduling problems considering both makespan and costs. Multi Objective Improved Beluga Whale Optimization with Ring Topology (MO-IBWO-Ring) is proposed as an efficient task scheduling algorithm that uses whales as feasible solutions for cloud computing tasks. Local search capabilities are also enhanced by using the ring topology concept. The proposed MO-IBWO-Ring algorithm as an optimization algorithm is tested on ten new test functions, and its performance is compared with four algorithms (i.e., Decision space-based Niching Non-dominated Sorting Genetic Algorithm II (DN-NSGAII), Multi-Objective Particle Swarm Optimization algorithm with Ring topology and Special Crowding Distance (MO_Ring_PSO_SCD), Omni-optimizer, and Multi-Objective Particle Swarm Optimization (MOPSO)). Two scenarios have been used to evaluate MO-IBWO-Ring’s performance as a task scheduler. 1) Heterogeneous Computing Scheduling Problem (HCSP) is used as the benchmark dataset with a small (512) and a medium (1024) number of tasks, and 2) with random generated tasks and VMs. When measuring provider metrics, the proposed method achieved better results than competing methods.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"200 ","pages":"Article 110836"},"PeriodicalIF":6.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143180696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}