{"title":"A decision-support system for ambulance management: A case study of the Portuguese EMS","authors":"A.S. Carvalho, M.E. Captivo","doi":"10.1016/j.cie.2025.111044","DOIUrl":"10.1016/j.cie.2025.111044","url":null,"abstract":"<div><div>This paper presents a decision-support system (DSS) named <em>ambulance management tool</em> (AMT), which was developed to support the decision-making process in the Emergency Medical Service (EMS) context. We focus on the operational level of decision by considering ambulances’ dispatching and relocation tasks. A Geographic Information System (GIS) is embedded in the AMT to help the EMS managers in the decision-making process. It allows the visualization on the map of the EMS features (e.g., hospitals, bases), emergencies’ and ambulances’ location. The AMT includes two optimization approaches to solve the dispatching and relocation problems: a mathematical model and a heuristic. We present the Portuguese EMS as a case study focusing on the EMS operation in the Lisbon area, where dispatching and relocation decisions are currently handmade tasks. Real life features such as multiple ambulance and emergency types and the ambulances’ working shifts are considered.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111044"},"PeriodicalIF":6.7,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143783624","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":"Ant Colony Optimization for solving large-scale bi-level network design problems","authors":"Ertan Yakici , Mumtaz Karatas","doi":"10.1016/j.cie.2025.111077","DOIUrl":"10.1016/j.cie.2025.111077","url":null,"abstract":"<div><div>In this study, we consider a bi-level hierarchical network design problem that encompasses both gradual and cooperative coverage. The lower-level facility serves as the primary point of contact for customers, while the upper-level facility acts as a supplier for the lower-level facilities. We first present a mathematical formulation of the problem, followed by an Ant Colony Optimization (ACO) approach to solve it. We then compare the performance of our method with commercial exact solvers. Our experiments, conducted on instances of various sizes, show that while exact methods may succeed in the long run, our heuristic provides a fast and reliable option for operational decisions that need to be made in a short period of time. In nine out of twelve instances, the exact solver failed to find a feasible solution within three hours for the high-budget case and two hours for the low-budget case. In contrast, our heuristic had run times between 0.1 and 0.4 h for 50 iterations. We also compare the performance of ACO with that of a Genetic Algorithm (GA) to evaluate its effectiveness among heuristics. Our numerical results demonstrate that ACO outperforms GA. This study contributes to the literature by offering a solid theoretical framework for the problem and implementing ACO to solve a bi-level facility location problem. Our results demonstrate that ACO can deliver good solutions in a reasonable time and serves as a promising alternative.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111077"},"PeriodicalIF":6.7,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143814755","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":"Reinforcement learning approach for outbound container stacking in container terminals","authors":"Wonhee Lee , Sung Won Cho","doi":"10.1016/j.cie.2025.111069","DOIUrl":"10.1016/j.cie.2025.111069","url":null,"abstract":"<div><div>The container stacking problem for outbound containers is a major planning task under yard operations in a container terminal. It is important to minimize the expected number of rehandling operations, which further helps maintain the productivity of yard operations and improve the efficiency of container terminals. In this paper, we propose a reinforcement learning based approach to determine the storage location of the arriving outbound containers. A reinforcement learning approach is developed to identify the appropriate storage location, aiming to minimize the expected number of rehandling operations during the loading operation. Furthermore, we developed suitable strategies related to reinforcement learning to determine the storage location by training the model using a sufficient number of episodes. Numerical experiments were conducted to compare the proposed model with existing algorithms using real-life container terminal data. The experimental results indicate that the proposed model is robust to uncertain environments, supports real-time decisions, and minimizes the expected number of rehandling operations.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111069"},"PeriodicalIF":6.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143760952","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":"An automatic flood escape route identification method for existing underground spaces: From the perspective of multi-objective trade-offs","authors":"Zhikun Ding , Zihuan Sun , Xiaoxiao Xu","doi":"10.1016/j.cie.2025.111082","DOIUrl":"10.1016/j.cie.2025.111082","url":null,"abstract":"<div><div>Frequent occurrences of flood disasters pose a significant threat to the safety of urban residents. Although research on emergency management for building disasters has made progress, it has primarily focused on fire incidents, lacking comprehensive studies on flood disasters. Furthermore, existing studies on optimal escape route planning predominantly relied on single criteria, resulting in a limited evaluation perspective. To address this gap, this research introduces a dynamic, systematic, and versatile framework for optimizing escape routes in flood scenarios, which incorporates Building Information Modeling (BIM), flood fluid simulation, crowd evacuation simulation, and weighted multi-criteria evaluation. The effectiveness and superiority of the framework are demonstrated through a case study of an underground facility used for university teaching and research. The outcomes of this research contribute to bridging the theoretical gap in emergency management of underground spaces during flood disasters, providing valuable insights to enhance the emergency preparedness of buildings in flood-prone areas.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111082"},"PeriodicalIF":6.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143767846","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":"Facility location and capacity planning for sampling and testing processes under demand uncertainty","authors":"Zhongbao Zhou , Wenting Sun , Tiantian Ren , Ximei Zeng","doi":"10.1016/j.cie.2025.111094","DOIUrl":"10.1016/j.cie.2025.111094","url":null,"abstract":"<div><div>During an outbreak, nucleic acid testing is essential for early infection detection and virus transmission control. In this study, we aim to location and capacity planning of testing facilities, balancing minimal costs with maximum population coverage during public health emergencies. We propose a novel two-stage robust optimization model that addresses uncertainties in sampling demand during an epidemic, with distinct phases for sampling and testing. Applying this model to medium and high-risk areas in Beijing during COVID-19, we use the column-and-constraint generation (C&CG) algorithm and compare its performance with three <em>meta</em>-heuristic algorithms: Differential Evolution (DE), Genetic Algorithm (GA), and Simulated Annealing (SA). Our findings reveal that the C&CG algorithm reduces sampling costs by 31.10% compared to DE, 26.77% to GA, and 21.17% to SA. It also lowers testing costs by 7.48%, 79.79%, and 60.63%, respectively, and achieves a higher completion rate for sampling and testing volumes, ranging from 93.12% to 100%. In addition, C&CG outperforms the other algorithms in handling large sample sizes by 43.98% to 61.84%. Despite its longer computational time, C&CG is more efficient in cost reduction and demand satisfaction. Furthermore, we analyze the impact of uncertainty set parameters, including a unified value of the demand risk parameter, and assess different cases. The corresponding location and capacity solutions can offer decision support for emergency agencies managing public health crises.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111094"},"PeriodicalIF":6.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143785586","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 path-free modelling approach for the traffic counting location problem","authors":"Gokhan Karakose , İslam Diri","doi":"10.1016/j.cie.2025.111079","DOIUrl":"10.1016/j.cie.2025.111079","url":null,"abstract":"<div><div>Efficient sensor placement enhances traffic management, planning, and flow control by providing real-time traffic information. Given that the quality of this information is closely linked to sensor locations, this paper aims to find the optimal location of minimum number of counting sensors to efficiently monitor all origin–destination (<span><math><mrow><mi>O</mi><mi>D</mi></mrow></math></span>) trips. This problem is known as the Traffic Counting Location Problem (TCLP) in the literature. For this problem, the paper presents a path-free modelling approach, along with a search space reduction procedure. The proposed approach removes the need to explicitly track paths between all <span><math><mrow><mi>O</mi><mi>D</mi></mrow></math></span> pairs as well as excluding unnecessary route observations. This greatly reduces the solution return time and memory usage for the TCLP, showed in extensive computational experiments tested on well-known transportation networks and randomly generated networks. Specifically, the best existing method in the literature has demonstrated effectiveness only for networks with fewer than 2,000 nodes. In contrast, the proposed solution methodology in this paper successfully addresses networks exceeding 15,000 nodes, substantially extending the scalability of exact approaches in solving the TCLP. Hence, this paper fills a significant gap in the TCLP literature by introducing an efficient exact approach that rapidly generates optimal solutions for medium-scale networks, and provides, for the first time, an optimal solution of TCLP for many large-scale networks. This advancement contributes to the development of intelligent transportation systems in smart cities, facilitating better traffic management and improving overall urban efficiency</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111079"},"PeriodicalIF":6.7,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143767847","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":"The community group buying models and strategic management for fresh food under supply uncertainty","authors":"Xianjia Wang , Tianrun He","doi":"10.1016/j.cie.2025.111083","DOIUrl":"10.1016/j.cie.2025.111083","url":null,"abstract":"<div><div>This paper explores a community group buying fresh food model with one supplier, one platform and one community leader, where the platform adopts full payment pre-sale model, and the supplier has uncertain supply. We establish profit models for the centralized decision, decentralized decisions and semi-integrated decisions, and obtain management strategies. For decentralized decision-making, we introduce two kinds of wholesale price contracts considering shortage undertaking, and propose a new form of minimum commitment supply contract which enables the platform to obtain the supplier’s compensation for the shortage loss caused by uncertain supply and transfer part of it to the leader. Compared with traditional wholesale price contracts, we prove that the minimum commitment supply contract can coordinate the overall profit of the supply chain and enhance the effort levels of the members. This numerical study shows that whether the average supply is sufficient or short, the optimal decisions and the expected profit of each member of the supply chain increases with the decrease in supply uncertainty.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111083"},"PeriodicalIF":6.7,"publicationDate":"2025-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143748595","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 general preventive maintenance framework of a production system considering dynamic maintenance accessibility","authors":"Fei Zhao , Nan Zhang","doi":"10.1016/j.cie.2025.111054","DOIUrl":"10.1016/j.cie.2025.111054","url":null,"abstract":"<div><div>In this paper, we investigate the maintenance problem of a production system where maintenance delay and dynamic environmental accessibility are considered. The system can be a single-component system or a series system with multiple components. It operates in a dynamic environment modeled by a discrete time Markov chain. The impact of the environment is twofold. Both the system productivity and the maintenance process depend on the environment state. Maintenance delay is taken into account in this work, such that the maintenance crew needs non-negligible times to arrive for maintenance activity. In addition, maintenance executing times are also non-negligible. We propose a preventive maintenance framework for a general production system. The component(s) are aging with time, described by their degradation levels or the time elapsed since their last renewal epochs, depending on their failure characteristics. For a specific maintenance scheduling, some reliability and production measure indexes such as the availability, environmental accessibility ratio and production loss rate are proposed to assess the system characteristics. The maintenance cost in the long-run horizon is also derived. We solve these problems in the framework of a semi-regenerative process. To further illustrate the properties of the policy, we show how the model is adaptive to single-component systems in detail. An example concerning a two-component production system is also presented. The model can provide theoretical references for decision-makers when maintenance delay and dynamic maintenance accessibility needs to be taken into account.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111054"},"PeriodicalIF":6.7,"publicationDate":"2025-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143738622","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}
Christoph Hoppe , Thorsten Schoormann , Stephanie Winkelmann , Frederik Möller
{"title":"Tensions in implementing a circular economy – Empirical insights from the automotive industry","authors":"Christoph Hoppe , Thorsten Schoormann , Stephanie Winkelmann , Frederik Möller","doi":"10.1016/j.cie.2025.111090","DOIUrl":"10.1016/j.cie.2025.111090","url":null,"abstract":"<div><div>The automotive industry’s transition toward a circular economy (CE) presents challenges critical for achieving sustainability. Implementing circularity requires navigating through complex decisions, including legal issues, digital technologies, and organizational practices. Some of the decisions are even conflicting and lead to tensions that capture related opposites pulling in different directions. While understanding tensions is crucial, they often receive only limited attention, which is problematic because making appropriate decisions and developing coping mechanisms requires an awareness of potential tensions. This study, therefore, empirically investigates tensions in implementing CE strategies within the automotive industry. Through semi-structured interviews with 17 industry experts across diverse CE focus areas, six tensions for implementing circularity were identified that require careful management and reflection. Also, promising practices were extracted from the qualitative analysis. The presented findings contribute to the growing body of knowledge on CE by highlighting the role of transition processes, digital technologies, and data in enabling effective CE implementations. By identifying tensions, the paper provides actionable insights for scholars, practitioners, and policymakers, ultimately supporting the development of sustainable and circular economies.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111090"},"PeriodicalIF":6.7,"publicationDate":"2025-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143904547","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":"Scheduling and dynamic charging optimizations for electric buses with time-varying electricity tariffs","authors":"Dejian Feng , Ming Dong , Jiaqi Dong","doi":"10.1016/j.cie.2025.111080","DOIUrl":"10.1016/j.cie.2025.111080","url":null,"abstract":"<div><div>With the rapidly increasing popularity of electric buses (EBs), their scheduling and charging decisions have become an important issue. This paper proposes a novel approach to simultaneously optimize scheduling and dynamic charging problems for EBs considering a nonlinear charging function, time-varying electricity tariffs, stochastic energy consumption, and other realistic conditions concurrently. The framework comprises a set partitioning master problem for selecting scheduling plans and a stochastic dynamic programming subproblem for generating scheduling plans and charging policies. An efficient branch-and-price algorithm is then proposed to solve the problem of interest, and several acceleration subalgorithms are designed. Finally, the effectiveness and efficiency of the proposed method are verified through numerical experiments. The results show that the proposed method can accurately and quickly obtain near-optimal solutions for realistic scale problems, thereby providing a certain decision reference for the operation and management of EB companies.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111080"},"PeriodicalIF":6.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143814753","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}