Operations Research Perspectives最新文献

Multi-stage stochastic engine usage optimization for fighter jet fleet using nested decomposition algorithm 基于嵌套分解算法的战斗机机队多阶段随机发动机使用优化

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2026-06-01 Epub Date: 2026-01-14 DOI: 10.1016/j.orp.2026.100376

Dung-Ying Lin, Cing-Chen Wu

{"title":"Multi-stage stochastic engine usage optimization for fighter jet fleet using nested decomposition algorithm","authors":"Dung-Ying Lin, Cing-Chen Wu","doi":"10.1016/j.orp.2026.100376","DOIUrl":"10.1016/j.orp.2026.100376","url":null,"abstract":"<div><div>Fighter jet squadrons face a critical challenge: meeting rigorous monthly flight-hour targets while managing strict engine service life limitations. This complex task necessitates the optimal allocation of engine resources and meticulous planning of flight hours for each aircraft, thereby balancing operational demands with maintenance imperatives. Our study addressed this multifaceted challenge by proposing a novel multi-stage stochastic programming (MSSP) model. Under uncertainty considerations, the model assists engine maintenance contractors in determining when to disassemble and reassemble fighter jet engines to ensure fighter jets meet the flight-hour requirements of the air force. Unlike previous deterministic approaches, our model incorporates random factors and uncertainties inherent in aviation operations, such as weather variability and mission changes. This comprehensive approach represents a considerable advancement in the field. To tackle the exponential increase in problem complexity at practical scales, we developed a nested decomposition algorithm. This innovative algorithm efficiently decomposes large-scale problems into manageable subproblems, utilizing tight lower bounds and problem-specific cuts to enhance computational efficiency. Empirical studies based on real world planning settings show that, when compared with existing manual planning practices, the proposed approach reduces the number of engines reaching their service life limits by 15.3 percent and increases available flight hours by 465.66 hours, thereby demonstrating clear and substantial operational benefits.</div></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"16 ","pages":"Article 100376"},"PeriodicalIF":3.7,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146038740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Dynamic flexible job shop co-scheduling optimization based on graph neural network and deep reinforcement learning 基于图神经网络和深度强化学习的动态柔性作业车间协同调度优化

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2026-06-01 Epub Date: 2026-01-23 DOI: 10.1016/j.orp.2026.100379

Lan Yang, Zhong Yang, Li Bi, Xiaogang Jiao

{"title":"Dynamic flexible job shop co-scheduling optimization based on graph neural network and deep reinforcement learning","authors":"Lan Yang, Zhong Yang, Li Bi, Xiaogang Jiao","doi":"10.1016/j.orp.2026.100379","DOIUrl":"10.1016/j.orp.2026.100379","url":null,"abstract":"<div><div>With the continuous advancement of manufacturing, job shop scheduling faces complex dynamic disturbances that pose significant challenges to production. This paper investigates the dynamic flexible job shop scheduling problem with job priority and transportation time constraints (DFJSP-PT). The study considers two types of dynamic events: random job arrivals and urgent order insertions implemented through a predefined job priority mechanism. To address the limitations of traditional scheduling methods under complex dynamics, this paper proposes a hybrid scheduling framework based on graph neural network (GNN) and deep reinforcement learning (DRL). The method constructs a Markov Decision Process (MDP) and employs a heterogeneous graph neural network to model the job scheduling state. When new jobs arrive, it enables incremental dynamic expansion of the graph structure, thereby avoiding the need to reconstruct the entire state space. The framework integrates transport time and job urgency into the decision-making process. It dynamically adjusts priorities through a weighting mechanism to achieve joint optimization of operation sequencing and machine allocation. Furthermore, the method introduces a priority experience replay (PER) mechanism based on temporal difference error. This mechanism is combined with composite dispatching rules and a global elite retention strategy, which enhances the algorithm's adaptive learning capability for random job arrivals and emergency order insertion events. Experimental results demonstrate that the proposed algorithm significantly outperforms traditional methods in both convergence performance and solution quality. The algorithm provides an effective technical pathway for intelligent job shop scheduling in dynamic production environments.</div></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"16 ","pages":"Article 100379"},"PeriodicalIF":3.7,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146078487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Assessing the impact of environmental factors on emergency healthcare quality: A benchmarking approach 评估环境因素对急救医疗质量的影响：一种基准方法

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2026-06-01 Epub Date: 2026-01-13 DOI: 10.1016/j.orp.2026.100377

Marc Aliana , Diego Prior , Emili Tortosa-Ausina

{"title":"Assessing the impact of environmental factors on emergency healthcare quality: A benchmarking approach","authors":"Marc Aliana , Diego Prior , Emili Tortosa-Ausina","doi":"10.1016/j.orp.2026.100377","DOIUrl":"10.1016/j.orp.2026.100377","url":null,"abstract":"<div><div>Evaluating the quality of emergency departments in hospitals is crucial for optimizing healthcare and allocating resources effectively. Existing metrics predominantly focus on internal variables (e.g., bed occupancy or time to treatment), disregarding possible external environmental factors beyond their control. In order to address this issue, in this paper we have a threefold objective. First, we introduce a Quality Composite Indicator (QCI) for benchmarking emergency departments quality, considering the specific impact of demographic, socio-economic, and behavioral factors. This metric minimizes the influence of outliers, facilitating a comparison among emergency departments, and enabling the identification of top performers based on quality indicators. Second, our study, conducted across 85 health trusts in England, reveals that emergency departments in areas with higher population density, a larger elderly population, increased birth rates, and more disadvantaged households generally provide lower-quality services. Furthermore, a higher incidence of depression and anxiety, combined with elevated crime levels, further worsens the quality of urgent healthcare services in these regions. Third, our analysis highlights differences in how certain environmental factors affect overall hospital performance versus specialized units like emergency departments. These results uncovered significant regional disparities in healthcare quality, contradicting the goal of nationwide uniformity.</div></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"16 ","pages":"Article 100377"},"PeriodicalIF":3.7,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146038741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A diagonal Hestenes–Stiefel conjugate gradient algorithm with iterative complexity analysis and its application in robotic model 具有迭代复杂度分析的对角线Hestenes-Stiefel共轭梯度算法及其在机器人模型中的应用

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2026-06-01 Epub Date: 2025-12-20 DOI: 10.1016/j.orp.2025.100375

Hassan Mohammad , Sulaiman Mohammed Ibrahim , Hayoung Choi , Rabiu Bashir Yunus

{"title":"A diagonal Hestenes–Stiefel conjugate gradient algorithm with iterative complexity analysis and its application in robotic model","authors":"Hassan Mohammad , Sulaiman Mohammed Ibrahim , Hayoung Choi , Rabiu Bashir Yunus","doi":"10.1016/j.orp.2025.100375","DOIUrl":"10.1016/j.orp.2025.100375","url":null,"abstract":"<div><div>This paper presents a novel diagonal Hestenes–Stiefel conjugate gradient (DHS-CG) algorithm for solving large-scale unconstrained optimization problems. Building on the approaches presented in Dong et al. (2015) and Mohammad and Santos (2018), the proposed algorithm integrates a computationally efficient diagonal Hessian approximation into the HS-CG scheme. The algorithm constructs search directions that enjoy sufficient descent, trust region, and conjugacy properties without imposing restrictive line search conditions, thus ensuring efficiency robustness under Wolfe and Armijo-type line search strategies. We establish the global convergence and iterative complexity of the proposed algorithm under standard bounds and Lipschitz gradient assumptions. Extensive numerical experiments on benchmark problems, including large-scale cases with up to 500,000 variables, demonstrated that DHS-CG consistently outperformed state-of-the-art CG variants, such as CG_DESCENT and classical Hestenes–Stiefel (HS). In both low and high dimensional settings, the proposed algorithm achieves faster convergence, fewer function evaluations, and lower CPU time, highlighting its suitability for high performance scientific and engineering computations.</div></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"16 ","pages":"Article 100375"},"PeriodicalIF":3.7,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145897989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Integrated production and quality dynamics under organizational learning: A hybrid continuous–discrete framework 组织学习下的集成生产与质量动力学：一个连续-离散混合框架

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2026-06-01 Epub Date: 2025-12-26 DOI: 10.1016/j.orp.2025.100374

Balázs Szabó , Zsolt Nemeskéri

{"title":"Integrated production and quality dynamics under organizational learning: A hybrid continuous–discrete framework","authors":"Balázs Szabó , Zsolt Nemeskéri","doi":"10.1016/j.orp.2025.100374","DOIUrl":"10.1016/j.orp.2025.100374","url":null,"abstract":"<div><div>This paper presents a hybrid continuous–discrete framework for optimizing production, pricing, quality, and learning investments under organizational learning, defined as efficiency gains through accumulated experience. Extending prior work on price-quality dynamics and production optimization, the model integrates real-time operational decisions with periodic strategic planning to address dynamic market challenges. It incorporates a stochastic initial learning rate to capture uncertainty in learning processes. In contrast to conventional discrete models that may exhibit qualitatively different dynamics (Vörös 2021), the hybrid framework is constructed to converge rigorously to the continuous-time optimum, ensuring consistent decision-making across planning horizons. Monte Carlo simulations provide insights into production increases, gradual price reductions, and quality improvements, with profit gains up to 14.7% in scenarios with high learning and quality sensitivity. The framework offers actionable guidance for industries like automotive, electronics, aerospace, and pharmaceuticals, enhancing cost efficiency and competitiveness through integrated strategic and operational optimization, though without explicit competitive interactions.</div></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"16 ","pages":"Article 100374"},"PeriodicalIF":3.7,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145897988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Concise Review of Home Health Care Routing and Scheduling Problem 家庭健康照护路线与排程问题简评

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2025-12-01 Epub Date: 2025-07-12 DOI: 10.1016/j.orp.2025.100347

Soumen Atta , Vítor Basto-Fernandes , Michael Emmerich

{"title":"A Concise Review of Home Health Care Routing and Scheduling Problem","authors":"Soumen Atta , Vítor Basto-Fernandes , Michael Emmerich","doi":"10.1016/j.orp.2025.100347","DOIUrl":"10.1016/j.orp.2025.100347","url":null,"abstract":"<div><div>The Home Health Care Routing and Scheduling Problem (HHCRSP) plays a crucial role in optimizing the delivery of home-based healthcare services by efficiently allocating caregivers to patient locations while adhering to logistical, operational, and regulatory constraints. This concise review provides an analysis of HHCRSP, discussing its key objectives, constraints, and solution methodologies. The study examines various optimization approaches, including exact algorithms, heuristics, and metaheuristic techniques. Furthermore, the impact of HHCRSP on healthcare delivery efficiency is explored, highlighting its role in reducing operational costs, improving service quality, and ensuring continuity of care. The article also discusses the regulatory requirements affecting HHCRSP, addressing compliance with legal and organizational requirements, quality assurance frameworks, economic constraints, and patient prioritization mandates. The challenges associated with HHCRSP, including logistical complexities, workload balancing, and technological barriers, are also reviewed. To align HHCRSP with regulatory frameworks, this review discusses various strategies such as adaptive scheduling, advanced algorithmic solutions, and the integration of environmental and social sustainability considerations. Additionally, emerging technological advancements, including the use of Artificial Intelligence (AI), Internet of Things (IoT), and intelligent transport systems, are evaluated for their potential to enhance HHCRSP efficiency. The article concludes by summarizing key findings, discussing the practical implications of HHCRSP for healthcare providers, and outlining future research directions. Addressing existing gaps, such as AI explainability, blockchain integration for secure scheduling, and sustainable healthcare logistics, remains a critical avenue for further exploration. As the demand for home healthcare services grows, innovative HHCRSP solutions will be essential to ensuring high-quality, cost-effective, and patient-centered care.</div></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"15 ","pages":"Article 100347"},"PeriodicalIF":3.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144632898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multi commodity network design problem with minimum flow constraints 具有最小流量约束的多商品网络设计问题

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2025-12-01 Epub Date: 2025-10-17 DOI: 10.1016/j.orp.2025.100359

Luuk van Rijthoven

{"title":"Multi commodity network design problem with minimum flow constraints","authors":"Luuk van Rijthoven","doi":"10.1016/j.orp.2025.100359","DOIUrl":"10.1016/j.orp.2025.100359","url":null,"abstract":"<div><div>This research presents a fast heuristic method for solving large-scale real-life Stock Rebalancing problems with minimum transfer constraints on the arcs, as well as a maximum supply and demand limitation on the nodes, which can be considered as a variation of the multi-commodity network design (MCND) problems. The proposed Rank-based Greedy Heuristic with Swapping (RGHS) ranks all feasible flow combinations according to a profit criteria. Then, the algorithm greedily considers the combinations until demand and supply constraints are met, followed by a flow swapping mechanism to further improve the solution. Furthermore, the RGHS is extended to a Reduced Set Hybrid Model (RSHM) that combines the heuristic approach with a commercial solver on the reduced solution space. The proposed methods are evaluated against the published Modified Greedy (MG) algorithm that showed good results on benchmark instances with a significantly improved computation time compared to other state-of-the-art methods. This study contributes by proposing a fast algorithm tailored for the real-life instances on considerably larger instances compared to existing literature, and introduces the concept of minimum transfer restrictions in contrast to the more common maximum capacities. This paper reports the results on various large-scale real-life instances and larger simulated instances and shows the scalability and solution quality compared to existing methods.</div></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"15 ","pages":"Article 100359"},"PeriodicalIF":3.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145361539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A cost and emission optimization framework for strategic intermodal freight transportation infrastructure development 战略性多式联运基础设施发展的成本与排放优化框架

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2025-12-01 Epub Date: 2025-11-29 DOI: 10.1016/j.orp.2025.100369

Ayoub Abusalih, Zeyu Liu

{"title":"A cost and emission optimization framework for strategic intermodal freight transportation infrastructure development","authors":"Ayoub Abusalih, Zeyu Liu","doi":"10.1016/j.orp.2025.100369","DOIUrl":"10.1016/j.orp.2025.100369","url":null,"abstract":"<div><div>The freight transportation sector is critical to the economic prosperity in the US, but it also constitutes a major source of carbon emissions. Although intermodal transportation has been shown to increase operating efficiency and reduce carbon emissions, research on infrastructural support for intermodal transportation is still insufficient. In this study, we establish a mixed integer programming model to jointly optimize strategic infrastructure development decisions and freight transportation decisions over a long horizon. Our model features a mixture of traditional single-mode facilities and hybrid hubs that facilitate rail–water transportation integration. A branch-and-cut decomposition algorithm is developed to solve large-scale problems. We collect real-world freight, infrastructure, and operations data to conduct computational studies on the model performance and algorithm efficiency. We provide insights for practitioners to address infrastructure planning and budgetary concerns. A case study using the established model at the national scale shows that well-optimized transportation infrastructure investment could have over 300% return during a 25-year horizon. In addition, fully capitalizing on the maturing clean vehicle technologies could reduce carbon emissions by 73.56 million tons at an annual rate.</div></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"15 ","pages":"Article 100369"},"PeriodicalIF":3.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145690179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A meta-analysis of set partitioning/set covering based matheuristics for vehicle routing problems 基于集划分/集覆盖的车辆路径问题数学元分析

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2025-12-01 Epub Date: 2025-10-29 DOI: 10.1016/j.orp.2025.100357

Alejandro Arenas-Vasco , Daniela Alcázar , Juan G. Villegas

引用次数: 0

A two-period model of counterterrorism with terrorist sponsoring and the role of hatred 恐怖分子支持和仇恨作用下的两期反恐模式

IF 3.7 4区管理学

Operations Research Perspectives Pub Date : 2025-12-01 Epub Date: 2025-10-15 DOI: 10.1016/j.orp.2025.100358

Kjell Hausken

{"title":"A two-period model of counterterrorism with terrorist sponsoring and the role of hatred","authors":"Kjell Hausken","doi":"10.1016/j.orp.2025.100358","DOIUrl":"10.1016/j.orp.2025.100358","url":null,"abstract":"<div><div>A two-period counterterrorism model is developed. One special case without terrorist sponsoring enables the government to degrade the terrorist’s resources substantially, especially with low unit counterterrorism cost or high asset valuations. If the terrorist in a second special case is sponsored proportionally to its resources, the government increases its counterterrorism in both periods, even at a higher unit cost. Degrading the terrorist’s resources becomes more challenging. If the terrorist in a third special case is sponsored proportionally to the government’s counterterrorism, due to developing hatred, and proportionally to its resources, counterterrorism is high in both periods, even at a high unit cost. Two contrasts with the two other special cases are that the terrorist’s resources are U shaped in both the government’s unit counterterrorism cost and their asset valuations. Both low unit counterterrorism cost and high asset valuations cause high counterterrorism and substantial terrorist sponsoring due to hatred. The government’s counterterrorism is inverse V shaped in the proportionality parameter for how counterterrorism causes hatred and terrorist sponsoring. An intermediate parameter causes maximum counterterrorism where the government strikes a balance between degrading the terrorist’s resources while constraining terrorist sponsoring due to hatred. The three special cases illustrate the government’s counterterrorism dilemmas.</div></div>","PeriodicalId":38055,"journal":{"name":"Operations Research Perspectives","volume":"15 ","pages":"Article 100358"},"PeriodicalIF":3.7,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145525285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0