European Journal of Operational Research最新文献_第10页

When blockchain creates value? Financial leasing for the newsvendor under data source uncertainty b区块链何时创造价值？数据来源不确定条件下报贩融资租赁研究

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-09-01 DOI: 10.1016/j.ejor.2026.09.006

Wenyi Zhang,Feng Yang,Chen Bi,Ziming Wang,Dawei Wang,Stephen Shum

引用次数: 0

Optimization methods for assigning positions under multiple objectives 多目标下岗位分配的优化方法

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-08-31 DOI: 10.1016/j.ejor.2026.08.032

Leon Jendraszewski, Andreas Wiese

引用次数: 0

Repeated Near Misses and Risk Perception in Newsvendor Decisions 报贩决策中的重复未遂与风险感知

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-08-29 DOI: 10.1016/j.ejor.2026.08.054

Florian Mathis Federspiel, Robin L. Dillon, Matthias Seifert

{"title":"Repeated Near Misses and Risk Perception in Newsvendor Decisions","authors":"Florian Mathis Federspiel, Robin L. Dillon, Matthias Seifert","doi":"10.1016/j.ejor.2026.08.054","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.08.054","url":null,"abstract":"Near misses are common in inventory management, yet little is known about how they influence decision makers’ perceptions and subsequent choices. We conceptualize an inventory near miss as a situation in which a stockout <ce:italic>almost</ce:italic> occurred but did <ce:italic>not</ce:italic> because of good fortune. Drawing on theories of near misses and risk perception, we argue that repeated near misses may be misinterpreted as evidence that an inventory strategy is safe and effective, thereby reducing perceived risk. Across two experimental studies, we find consistent evidence that repeated near misses lead decision makers to evaluate outcomes more positively, perceive inventory decisions as less risky, and become less willing to protect themselves against future losses. These effects are substantially attenuated when decision makers also experience repeated stockouts, suggesting that actual losses sensitize individuals to the risks obscured by repeated close calls. We further find evidence that these perceptual shifts are associated with reductions in order quantities, although these behavioral effects are more modest than the corresponding changes in risk perception. Together, our findings identify a previously unexplored mechanism through which repeated operational success without failure increase exposure to future inventory risk.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"3 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148885497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A parameterized complexity view on robust scheduling with budgeted uncertainty 预算不确定性鲁棒调度的参数化复杂性研究

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-08-29 DOI: 10.1016/j.ejor.2026.08.046

Noam Goldberg, Dvir Shabtay

{"title":"A parameterized complexity view on robust scheduling with budgeted uncertainty","authors":"Noam Goldberg, Dvir Shabtay","doi":"10.1016/j.ejor.2026.08.046","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.08.046","url":null,"abstract":"In this study, we investigate a robust single-machine scheduling problem under processing time uncertainty. The uncertainty is modeled using the budgeted approach, where each job has a nominal and deviation processing time, and the number of deviations is bounded by <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>Γ</mml:mi></mml:math>. The objective is to minimize the number of tardy jobs where a job is considered tardy if there is some scenario in which it is completed after its due date. Since the problem is NP-hard in general, we focus on analyzing its tractability under the assumption that certain natural parameters of the problem are each bounded by a constant. We consider three parameters: the robustness parameter <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>Γ</mml:mi></mml:math>, the number of distinct due dates in the instance, and the number of jobs with nonzero deviations. Using parameterized-complexity theory, we prove that the problem is W[1]-hard with respect to <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>Γ</mml:mi></mml:math>, but can be solved in XP time with respect to the same parameter. With respect to the number of distinct due dates, we establish a stronger hardness result by showing that the problem remains NP-hard even when there are only two different due dates and is solvable in pseudo-polynomial time when the number of due dates is upper bounded by a constant. To complement these results, we show that the case of a common (single) due date reduces to a robust binary knapsack problem with equal item profits, a problem we prove to be solvable in polynomial time. Finally, we prove that the problem is fixed-parameter tractable with respect to the number of jobs with nonzero deviations.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"49 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148884971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Refining demand accuracy for competing retailers 提高竞争零售商的需求准确性

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-08-29 DOI: 10.1016/j.ejor.2026.08.019

Meng Wu, Xiaoyin Cao, Tian Bai

引用次数: 0

An exact approach for the Train Single-Routing Selection Problem 列车单路线选择问题的一种精确方法

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-08-29 DOI: 10.1016/j.ejor.2026.08.028

Anna Livia Croella, Fabio Furini, Ivana Ljubić, Bianca Pascariu, Paola Pellegrini, Pablo San Segundo

{"title":"An exact approach for the Train Single-Routing Selection Problem","authors":"Anna Livia Croella, Fabio Furini, Ivana Ljubić, Bianca Pascariu, Paola Pellegrini, Pablo San Segundo","doi":"10.1016/j.ejor.2026.08.028","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.08.028","url":null,"abstract":"Given a set of train routes with route costs and a set of compatible route pairs with pairing costs, the Train Single-Routing Selection Problem (TSRSP) seeks to assign one route to each train, minimizing the total cost while ensuring pairwise compatibility among the selected routes. This problem is of significant practical relevance in rail traffic management and it is a special case of the Train Routing Selection Problem. We introduce a Binary Quadratic Programming formulation for the TSRSP and apply a linearization technique from the literature that requires a linear number of additional variables and constraints. This yields a novel and effective Mixed Integer Linear Programming (MILP) formulation for the TSRSP. By exploiting the structure of the problem, we further propose a method to strengthen the Linear Programming (LP) relaxation of the MILP formulation, substantially improving its computational performance. The resulting formulation is the first to efficiently solve real-world TSRSP instances to optimality within short computational times—instances that, until now, have only been addressed using heuristic approaches in the literature. Extensive computational results show that our MILP model consistently outperforms existing formulations, both in terms of computational time and the number of instances solved to optimality, primarily due to the strength of its LP relaxation.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"17 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148884972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Traffic diversion vs. self-built e-commerce: The content and e-commerce platform operations considering spillover effect and consumer loyalty 导流vs自建电商：考虑溢出效应和消费者忠诚度的内容和电商平台运营

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-08-28 DOI: 10.1016/j.ejor.2026.08.035

Nenggui Zhao, Youqing Wu, Qiang Wang, Jie Wu

{"title":"Traffic diversion vs. self-built e-commerce: The content and e-commerce platform operations considering spillover effect and consumer loyalty","authors":"Nenggui Zhao, Youqing Wu, Qiang Wang, Jie Wu","doi":"10.1016/j.ejor.2026.08.035","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.08.035","url":null,"abstract":"With the rapid development of content platforms (CPs), their operational modes have become increasingly diverse. Inspired by real-world practices, CPs such as Zhihu and Douyin can choose to collaborate with traditional e-commerce platforms (TPs) by directing traffic to them (traffic diversion mode), or establish their own e-commerce to sell products competitively with TPs while continuing to provide content creation (self-built e-commerce mode). To investigate the optimal mode choice, we model a supply chain consisting of one CP and one TP, where the CP can invest in content creation efforts that generate spillover effects on the TP. Our findings indicate that the CP will enter the market and operate in the traffic diversion mode only when a certain proportion of loyal consumers exists. Conversely, it will enter the market with content creation effort and operate in the self-built e-commerce mode only under negative spillover effects, specifically when it attracts consumers away from the TP to its own marketplace. Moreover, regardless of the CP’s effort investment, both the CP and TP can achieve win-win outcomes under specific conditions in either operational mode. Additionally, the CP always benefits from efforts to enhance the content creation level, and it is consistently advantageous for the CP to operate in both modes simultaneously, whereas this is detrimental to the TP. Finally, the TP exerts effort (e.g., live streaming) in the diversion mode, benefiting itself but harming the CP, whereas it never exerts such effort in the self-built e-commerce mode.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"25 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148885005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Interval optimization coupled with statistical feasibility robust optimization for hydrogen data center microgrid scheduling 区间优化与统计可行性鲁棒优化相结合的氢数据中心微电网调度

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-08-28 DOI: 10.1016/j.ejor.2026.08.043

Juntao Duan, Yuanzheng Li, Yang Li, Wei Yao, Lin Jiang, Yang Shi

{"title":"Interval optimization coupled with statistical feasibility robust optimization for hydrogen data center microgrid scheduling","authors":"Juntao Duan, Yuanzheng Li, Yang Li, Wei Yao, Lin Jiang, Yang Shi","doi":"10.1016/j.ejor.2026.08.043","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.08.043","url":null,"abstract":"The growing power demand of data centers poses new challenges for its energy-efficient and robust operation. This paper investigates the scheduling of hydrogen-enabled data center microgrids with integrated renewable energy (RE) and hydrogen energy storage systems, under uncertainties in both renewable output and the equivalent meteorological index. To address these challenges, we propose a statistical feasibility-based robust interval optimization (SFRIO) framework that jointly minimizes operational cost and RE curtailment. The framework relaxes over-conservative constraints in traditional robust optimization by introducing statistical feasibility, and employs interval optimization with Karush-Kuhn–Tucker (KKT) reformulation. To reduce the computational burden associated with the dual variables in the KKT conditions while guaranteeing statistical feasibility, we further develop a statistical guarantee-based externally tangent (SGET) algorithm that constructs uncertainty sets involving fewer dual-related constraints. Numerical experiments validate that the proposed SFRIO framework, combined with the SGET algorithm, achieves improved solution quality and significantly reduced computational complexity. Simulation results show that the proposed method reduces the mean RE curtailment by 79.17%–87.19% compared with SO, RO, and SFRO, and reduces the average computational time from over <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mrow><mml:mn>3</mml:mn><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">×</mml:mo><mml:mn>1</mml:mn><mml:msup><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math> seconds to several seconds.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"6 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148884974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Drone-enabled early diagnosis of human immunodeficiency virus in infants 无人机对婴儿人类免疫缺陷病毒的早期诊断

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-08-28 DOI: 10.1016/j.ejor.2026.08.026

Alborz Hassanzadeh, Laurent Alfandari

{"title":"Drone-enabled early diagnosis of human immunodeficiency virus in infants","authors":"Alborz Hassanzadeh, Laurent Alfandari","doi":"10.1016/j.ejor.2026.08.026","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.08.026","url":null,"abstract":"Africa, where only one-third of the population resides within 2 km of functioning routes, carries over 85% of the world’s infant HIV burden. Drones hold great potential for transporting samples crucial to the early infant diagnosis of HIV in hard-hit regions. We consider a resource-limited environment where efficient sample transfer between scattered clinics and laboratories is indispensable. We first develop a mixed-integer non-linear program to model this complex supply chain and optimize the clinics-labs-transportation mode assignment. Despite highly non-linear objectives and constraints, we derive a tractable linear approximation. Using country-level data from Mozambique, we find that the bottleneck is caused by a confluence of prolonged transportation time, long waiting at the clinics until a transportation opportunity becomes available, and batching delay at the labs. A drone network relieves the bottleneck in three ways: (i) Drones significantly reduce sample transportation time; (ii) By eliminating waiting for transportation opportunities, drones remarkably decrease clinic delays while increasing dispatch frequencies; (iii) Increased dispatch frequency smooths clinic-lab sample flow which decreases the variation in random time between creation of two sample batches at labs. This, in turn, decreases the total lab delay. Our analysis also demonstrates that effectiveness-first designs compromise fairness less than equity-first designs do effectiveness. We finally find that optimizing fairness concentrates drones in villages rather than cities. Conversely, optimizing effectiveness allocates drones mainly to urban areas: i.e., in cities, drones impact many infants less while in villages, they impact fewer infants more. Therefore, the network structure should be tailored to the policy-maker’s needs.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"5 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148885006","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Deep Reinforcement Learning for path planning and storage policy in automated warehouses 自动化仓库中路径规划和存储策略的深度强化学习

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2026-08-27 DOI: 10.1016/j.ejor.2026.08.040

Hanzhao Wu, Zhenyong Wu, Wenyan Song, Mark Goh, Yuan Wang

{"title":"Deep Reinforcement Learning for path planning and storage policy in automated warehouses","authors":"Hanzhao Wu, Zhenyong Wu, Wenyan Song, Mark Goh, Yuan Wang","doi":"10.1016/j.ejor.2026.08.040","DOIUrl":"https://doi.org/10.1016/j.ejor.2026.08.040","url":null,"abstract":"Efficient routing of vehicles and storage assignment of stock in automated warehouses reduce the operational costs and improve service levels. However, most approaches to the Vehicle Routing Problem (VRP) in warehouses treat routing and storage assignment separately, often overlooking the effects of three-dimensional layouts, item priorities, and real-time traffic congestion. This paper addresses the VRP in three-dimensional warehouse environments through a Deep Reinforcement Learning (DRL) framework based on the Gated Recurrent Unit (GRU)-Attention network. The GRU-Attention network effectively captures complex temporal dependencies and dynamically identifies critical storage and routing features, which enables more adaptive and coordinated decisions in warehouse settings. This method jointly optimizes Automated Guided Vehicle (AGV) routing paths and item storage assignment while considering storage priorities, item turnover rates, and physical weights. In this framework, DRL handles path planning and storage assignment decisions. The proposed model integrates a dynamic storage allocation with an DRL architecture to minimize operational costs. Computational experiments are conducted on real-world and synthetic datasets across various storage policies and warehouse layouts. The experimental results suggest that the GRU-Attention network achieves reductions of 12.65%–19.60% in warehouse scenarios with 50 items compared to traditional and existing algorithms. Additionally, the semi-circle storage policy proves superior to the random, within-aisle, and across-aisle approaches by minimizing AGV travel distances and alleviating congestion within the warehouse. A comparative analysis of warehouse layouts reveals that designs without a central main aisle improve efficiency by minimizing bottlenecks. These findings offer practical insights for optimizing real-time, multi-objective warehouse management automated warehouse systems.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"51 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2026-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148885007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0