{"title":"Research on evolution model of road network for self-driving truck in open-pit mine","authors":"Zhao Hongze , Zheng Wen , Qin Boqiang , Ding Zhen , Zhao Guanghui , Guo Pei","doi":"10.1016/j.cie.2025.111166","DOIUrl":"10.1016/j.cie.2025.111166","url":null,"abstract":"<div><div>Open-pit mining environments are complex, and the development and transportation systems dynamically evolve as mining progresses. Roads exhibit unstructured characteristics, making it essential to identify and represent road networks’ status and rapidly predict their future developments for the efficient operation of intelligent open-pit mines and the safe functioning of unmanned transportation systems. Due to the advancement of intelligent mining technology, the disadvantages of manual measurement and mapping of open-pit mine road networks, such as high costs and delays, have become increasingly evident. This study uses virtual design to extract the road network at the next time point from the perspective of road evolution, obtaining future road network information to effectively address challenges such as the difficulty in optimizing the open-pit network and subsequent planning. It introduces a node evolution prediction method based on Stacked Long Short-Term Memory by analyzing the evolutionary characteristics and patterns of transportation road networks in open-pit mines. In addition, a road network evolution model for open-pit mines is established, considering the status of road networks and the mechanisms of node and segment evolution. The specific application of this model is demonstrated with typical open-pit mining transportation systems, generating structural maps of the road network at time point t + 1. The results indicated that the root mean square error and mean absolute error of node position prediction by the model are both less than 3 m. In addition, as the dataset expands, the stability and accuracy of the model improve.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111166"},"PeriodicalIF":6.7,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143882402","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":"An integrated modeling approach for multi-class individual crew scheduling in demand channels","authors":"Deepak Kumar Kushwaha, Goutam Sen","doi":"10.1016/j.cie.2025.111168","DOIUrl":"10.1016/j.cie.2025.111168","url":null,"abstract":"<div><div>Emergencies such as airlifts, evacuations, and humanitarian missions demand immediate and precise crew scheduling solutions. Unlike classical crew scheduling, emergency missions involve heterogeneous crews with diverse qualifications, each subject to unique compatibility requirements with various aircraft types and flights. Further complexities arise from the need to balance crew availability, rest and duty hour constraints, cross-crew substitution, and crew complement at different stages. This study addresses the unique challenges of high-stake scenarios in demand channels for multi-class crews considering individual skills, duty, and rest hour requirements due to flight-specific eligibility and specificity of multi-class crew constraints. A pre-processing framework is developed to sort the eligible crew members, followed by an exact and heuristic approach to optimize crew allocation. The study introduces a novel mixed integer programming model for multi-class crew assignments, accommodating individual qualifications, rank, crew compliments, accumulated duty, and rest hours during crew engagements. For large-scale implementation, the study proposes a heuristic framework combining Orthogonal Construction (OC) and Large Neighborhood Search (LNS) to enhance solution quality and scalability.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111168"},"PeriodicalIF":6.7,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143924415","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}
Mengjiao Zhao , Songpo Yang , Danni Cao , Lishan Sun , Jianjun Wu
{"title":"A synchronous crew scheduling problem with time fairness based on a two-phrase assignment strategy in an urban rail transit network","authors":"Mengjiao Zhao , Songpo Yang , Danni Cao , Lishan Sun , Jianjun Wu","doi":"10.1016/j.cie.2025.111160","DOIUrl":"10.1016/j.cie.2025.111160","url":null,"abstract":"<div><div>Crew scheduling problem (CSP), which involves finding the optimal match between crew members and scheduling tasks, is of utmost importance for completing all train runs within a workday in an urban rail transit (URT) system. Given the variations in train runs, crew compositions, and pooled-station sets across different operational lines, companies that only consider the CSP within a single line may inadvertently cause a significant disparity in working-time fairness among crews, even if they are part of the same organization. To address these concerns, this paper initially proposes an Integer Linear Programming (ILP) model that simultaneously optimizes the two phases of task assignment and task generation, aiming to solve a synchronous crew scheduling problem (SCSP) for the URT network, with a focus on the time fairness of each crew member. Generally, ILP is a set-partitioning-based model with decision variables set to assign tasks. To solve this model, a modified Column Generation (CG) algorithm has been redesigned to generate an optimal solution. Finally, a real-life instance from Beijing is introduced to evaluate the effectiveness of the proposed method. The results demonstrate that the cross-line scheduling plan (CLSP) based on the URT network can conserve crew resources by 4.73 % (reducing 13 crews) and shorten the average working time by up to 3.48 min. compared to the single-line scheduling plan (SLSP). Moreover, the CLSP manages to keep the working time fluctuations for each crew within an acceptable range of [0 min, 8 min]. This indicates that CLSP in the URT network is effective in meeting the fairness requirements for crews.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111160"},"PeriodicalIF":6.7,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143887393","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":"Dynamic inventory sharing, ordering, and pricing strategies for perishable foods to maximize profit and minimize waste","authors":"Melda Hasiloglu-Ciftciler , Onur Kaya","doi":"10.1016/j.cie.2025.111158","DOIUrl":"10.1016/j.cie.2025.111158","url":null,"abstract":"<div><div>Effective management of perishable food products is essential for grocery retailers to balance profitability and waste reduction. This study addresses the challenge of selling perishable food products with varying ages across two branches, incorporating consumer behavior and demand shifts between old and new products. A bi-objective infinite horizon dynamic programming model is developed to optimize centralized pricing, ordering, and inventory sharing decisions, aiming to maximize profit and minimize waste. Numerical analysis demonstrates that inventory sharing effectively balances stock levels and reduces food waste. Findings indicate that prioritizing waste reduction leads to higher price discounts and increased inventory sharing, while prioritizing profit maximization results in selling newer products and reducing inventory sharing. Sensitivity analyses highlight the importance of market segmentation and price differentiation strategies. These insights provide valuable guidance for retailers in refining inventory and pricing decisions, adapting to regulatory pressures, and improving overall supply chain performance.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111158"},"PeriodicalIF":6.7,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900299","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":"Urban transit optimization: Efficient electric bus operations and vehicle-to-grid integration","authors":"Jeongmin Son , Jeongho Im , Dowon Kim","doi":"10.1016/j.cie.2025.111169","DOIUrl":"10.1016/j.cie.2025.111169","url":null,"abstract":"<div><div>The rise of electric buses (EBs) marks a significant change in urban transit, introducing operational and charging challenges. This research highlights the importance of two-stage stochastic optimization that considers uncertainties in discharging prices and energy consumption, developing cost-effective strategies focused on optimized bus dispatch and charging/discharging schedules with vehicle-to-grid (V2G) integration. An innovative linear programming model for efficient fleet management across multiple routes and depots is proposed, optimizing charging processes at the depot level. Results highlight the potential of V2G integration by demonstrating enhanced grid efficiency and profitability through strategic charging and discharging of EBs. This research provides valuable insights into EB operation strategies and V2G’s economic viability, contributing to sustainable urban mobility advancements.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111169"},"PeriodicalIF":6.7,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143887391","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}
Artur Cordeiro , Luís Freitas Rocha , José Boaventura-Cunha , Eduardo J. Solteiro Pires , João Pedro Souza
{"title":"Object segmentation dataset generation framework for robotic bin-picking: Multi-metric analysis between results trained with real and synthetic data","authors":"Artur Cordeiro , Luís Freitas Rocha , José Boaventura-Cunha , Eduardo J. Solteiro Pires , João Pedro Souza","doi":"10.1016/j.cie.2025.111139","DOIUrl":"10.1016/j.cie.2025.111139","url":null,"abstract":"<div><div>The implementation of deep learning approaches based on instance segmentation data remains a challenge for customized scenarios, owing to the time-consuming nature of acquiring and annotating real-world instance segmentation data, which requires a significant investment of semi-professional user labour. Obtaining high-quality labelled data demands expertise and meticulous attention to detail. This requirement can significantly impact the overall implementation process, adding to the complexity and resource requirements of customized scenarios with diverse objects.</div><div>The proposed work addresses the challenge of generating labelled data for large-scale robotic bin-picking datasets by proposing an easy-to-use automated framework designed to create customized data with accurate labels from CAD models. The framework leverages a photorealistic rendering engine integrated with physics simulation, minimizing the gap between synthetic and real-world data. Models trained using the synthetic data generated by this framework achieved an Average Precision of 86.95%, comparable to the performance of models trained on real-world datasets. Furthermore, this paper provides a comprehensive multi-metric analysis across diverse objects representing distinct industrial applications, including naval, logistics, and aerospace domains. The evaluation also includes the use of three distinct instance segmentation networks, alongside a comparative analysis of the proposed approach against two generative model techniques.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111139"},"PeriodicalIF":6.7,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143878424","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":"Large-scale group consensus decision making in social networks considering adverse selection in an asymmetric information environment","authors":"Yuxuan Chen , Yingming Wang","doi":"10.1016/j.cie.2025.111155","DOIUrl":"10.1016/j.cie.2025.111155","url":null,"abstract":"<div><div>In consensus-based large scale group decision making (LSGDM) problems, some experts often exhibit adverse selection behavior due to asymmetry in information availability. This may lead to results deviating from the optimum, weakening decision making fairness and reducing consensus efficiency. For this reason, this paper proposes a large group consensus decision making method based on managing adverse selection behavior in an asymmetric information environment. Firstly, the directed Louvain algorithm is introduced to achieve the decision making subgroup division based on the directed social network. On this basis, considering the different qualifications and research fields of experts, a new weight allocation method is proposed based on the authority of experts. Next, focusing on the consensus-reaching process, a mechanism for identifying and managing adverse selection behaviors is proposed. A hierarchical recognition framework is designed for behavior identification, incorporating behavioral patterns and underlying motivations. A multidimensional dynamic adjustment strategy based on weight and preference is introduced for behavior management, then a comprehensive large-group consensus decision making method based on adverse selection behavior management is developed. Finally, the feasibility and effectiveness of the proposed method are verified using case studies and parameter discussions.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111155"},"PeriodicalIF":6.7,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143887392","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 two-stage scheduling algorithm for dynamic interval multi-objective vehicle routing problem in medical waste collection","authors":"Xiaoning Shen , Hui Lou , Zhongpei Ge","doi":"10.1016/j.cie.2025.111136","DOIUrl":"10.1016/j.cie.2025.111136","url":null,"abstract":"<div><div>Proper scheduling of medical waste collection vehicles can reduce the cost of large-scale epidemic prevention and control, and improve the collecting efficiency. In this work, a multi-objective, multi-trip and multi-intermediate depot vehicle routing model for collecting medical wastes is developed, accounting for the uncertainty of vehicle speed and dynamic changes in customer requirements, as well as the differences in disposal capacity of various disposal sites. The cost and infection risk are minimized through the determination of the optimal collecting route and disposal site for each vehicle, while considering the constraints of vehicle capacity and number of vehicles. To solve the model, a novel two-stage scheduling method is proposed. In the stage of static optimization, a knowledge-guided interval multi-objective shuffled frog leaping algorithm is designed to obtain the initial collecting routes. The possibility degree of interval number is introduced to perform individual encoding and decoding for speed intervals, and also implement the interval non-dominated sorting. In the stage of dynamic optimization, a problem-specific neighborhood search method is adopted to provide a quick response to the dynamic collecting requirements. Systematic experimental studies are implemented on a real-world medical waste collection scenario and eight synthetic instances. Comparison results with state-of-the-art algorithms suggest that the proposed algorithm generates a set of interval non-dominated schedules with lower cost and infection risk.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111136"},"PeriodicalIF":6.7,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143878423","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":"Climate risk and green innovation in semi-conductor industry: Do supply chain concentration and resilience matter?","authors":"Shanyong Wang, Ling Ma","doi":"10.1016/j.cie.2025.111152","DOIUrl":"10.1016/j.cie.2025.111152","url":null,"abstract":"<div><div>Climate change presents a universal challenge affecting countries on a global scale. Given the exigencies imposed by extreme weather events and environmental degradation, corporations across diverse sectors have embraced green innovations (GI) as a strategy to address the imperatives of climate change adaptation and mitigation. This study examines the complex relationship between climate risks and corporate GI by analyzing data from 146 firms within the Chinese semiconductor industry over the period 2007 to 2022. Employing a combination of Poisson-Pseudo-Maximum-Likelihood (PPML), panel threshold, and moderating effect models, the analysis seeks to uncover the nuanced dynamics between environmental risks and corporate sustainability practices. The findings underscore that both annual and longer-term climate risks, as measured by the climate risk index (CRI), exert a significant promotional effect on GI. Additionally, the study reveals that CRI acts as a stimulus for GI by augmenting R&D intensity, attracting investments in green finance, and enhancing financial flexibility. Furthermore, the study incorporates an assessment of corporate resilience capacity through threshold analysis, shedding light on the pivotal nexus between CRI and GI. This nexus exhibits a pronounced positive association within the intermediate range delineated by two threshold values. Additionally, a moderating effect analysis, taking into consideration supply chain concentration and overall corporate production elements, underscores the reinforcing effect of both supply chain concentration and total factor productivity on the influence of CRI in promoting GI. The study also undertakes a comprehensive exploration of heterogeneity by considering various corporate and regional factors. In light of the findings articulated above, this research puts forth a series of recommendations tailored for managerial decision-making and the policy formulation process.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111152"},"PeriodicalIF":6.7,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143878352","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":"Energy-efficient and self-adaptive AGV scheduling approach based on hierarchical reinforcement learning for flexible shop floor","authors":"Xiao Chang, Xiaoliang Jia, Hao Hu","doi":"10.1016/j.cie.2025.111140","DOIUrl":"10.1016/j.cie.2025.111140","url":null,"abstract":"<div><div>Driven by the recent trend of Industry 4.0, Automated Guided Vehicles (AGVs) have been widely applied in manufacturing industry to enhance the efficiency of the logistics system. However, the application of AGVs also aroused issues such as increasing energy consumption and various costs, especially in real-time AGVs scheduling in the complex flexible shop floor. To address these issues, a hierarchical reinforcement learning (HRL) based approach is hereby proposed to achieve real-time AGVs scheduling. At first, the scheduling task is decomposed into task assignment and AGV selection subtasks with the concept of hierarchy, and the problem of real-time AGVs scheduling is formulated as a Semi-Markov decision process (SMDP), aiming to simultaneously minimize makespan and total operational cost aroused by energy consumption, delay ratio, and maintenance. Then the HRL based real-time AGVs scheduling is presented to implement task assignment and AGV selection. In the end, a case study is illustrated to validate the effectiveness and superiority of the proposed approach. The results show that the maximum reduction of energy, maintenance, and total operational cost is 33.4%, 25.9%, and 24.1% respectively.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111140"},"PeriodicalIF":6.7,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143892206","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}