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

An effective evolutionary algorithm for packing rectangles into a fixed size circular container 一种将矩形装箱成固定尺寸圆形容器的有效进化算法

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-05-09 DOI: 10.1016/j.ejor.2025.04.044

Xiangjing Lai, Lei Wang, Jin-Kao Hao, Qinghua Wu

引用次数: 0

Truth, trust, and trade-offs: When blockchain in supply chains backfires 真相、信任和权衡：当供应链中的区块链适得其反时

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-05-09 DOI: 10.1016/j.ejor.2025.05.011

Tal Avinadav , Noam Shamir

{"title":"Truth, trust, and trade-offs: When blockchain in supply chains backfires","authors":"Tal Avinadav , Noam Shamir","doi":"10.1016/j.ejor.2025.05.011","DOIUrl":"10.1016/j.ejor.2025.05.011","url":null,"abstract":"<div><div>We study the role of blockchain in achieving information transparency and generating trust in a dyadic supply chain with one retailer sourcing from a single supplier. The retailer has superior information regarding the demand distribution, whereas the supplier sets the capacity in preparation for the selling season. Two sources of risk are identified: information risk, which captures the incentives of the retailer to portray a favorable market condition to the supplier to encourage the supplier to secure an ample capacity, and demand risk, which captures the potential for lost sales or excess capacity investment, even when knowing the correct demand distribution. We demonstrate how blockchain eliminates information risk for the supplier. As an alternative to blockchain, we analyze a commitment contract where the retailer can order in advance a certain number of units; this commitment can serve as a signaling tool to convey market information to the supplier. We argue that the commitment contract can eliminate the information risk for the supplier (as can blockchain), but it can also reduce the supplier’s demand risk. We conclude that in many instances, the supplier and the supply chain can become worse off when blockchain is used, while the retailer favors this technology.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 3","pages":"Pages 467-480"},"PeriodicalIF":6.0,"publicationDate":"2025-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144067536","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 the real-time inventory rack storage assignment and replenishment problem 深度强化学习用于实时库存的货架存储分配和补货问题

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-05-09 DOI: 10.1016/j.ejor.2025.05.008

Sander Teck, Tú San Phạm, Louis-Martin Rousseau, Pieter Vansteenwegen

{"title":"Deep reinforcement learning for the real-time inventory rack storage assignment and replenishment problem","authors":"Sander Teck, Tú San Phạm, Louis-Martin Rousseau, Pieter Vansteenwegen","doi":"10.1016/j.ejor.2025.05.008","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.05.008","url":null,"abstract":"The e-commerce industry is quickly transforming towards more automation and technological advancements. With the growing intricacy of warehouse operations, there is a need for control systems that can efficiently handle this complexity. This study considers a Robotic Mobile Fulfillment System (RMFS), a semi-automated warehousing system. This system employs autonomous mobile robots (AMRs) to retrieve inventory racks from the storage area; this way, human activity is eliminated within the storage area itself. The fleet of robots both store and retrieve the inventory racks to either workstations, where human pickers are stationed that pick items from the racks, or replenishment stations, where depleted inventory racks can be restocked with items. An attractive characteristic of the RMFS is that it dynamically changes the positioning of the inventory racks based on the frequency of inventory rack requests and the state of their stock levels. The optimization objective considered in this study for the dynamic positioning problem of the racks within the storage area is to minimize the average cycle time of the mobile robots to perform retrieval and replenishment activities. We propose a deep reinforcement learning approach to train a decision-making agent to learn a policy for the storage assignment and replenishment of inventory racks. The learned policy is compared to the commonly used decision rules in the academic literature on this problem. The experimental results show the potential benefits of training an agent to learn a storage and replenishment policy. Cycle time improvements up to 5.4 % can be achieved over the best-performing decision rules. This research contributes to advancing the understanding of intelligent storage assignment and replenishment strategies for the real-time decision-making process within an RMFS.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"47 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144133769","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

Scatter search with path relinking for linear bilevel problems 线性双层问题的路径链接散点搜索

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-05-08 DOI: 10.1016/j.ejor.2025.04.043

Herminia I. Calvete , Carmen Galé , José A. Iranzo , Manuel Laguna

引用次数: 0

Computing the steady-state probabilities of the number of customers in the system of a tandem queueing system, a Machine Learning approach 计算串联排队系统中客户数量的稳态概率，这是一种机器学习方法

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-05-08 DOI: 10.1016/j.ejor.2025.04.040

Eliran Sherzer

{"title":"Computing the steady-state probabilities of the number of customers in the system of a tandem queueing system, a Machine Learning approach","authors":"Eliran Sherzer","doi":"10.1016/j.ejor.2025.04.040","DOIUrl":"10.1016/j.ejor.2025.04.040","url":null,"abstract":"<div><div>Tandem queueing networks are widely used to model systems where services are provided in sequential stages. In this study, we assume that each station in the tandem system operates under a general renewal process. Additionally, we assume that the arrival process for the first station is governed by a general renewal process, which implies that arrivals at subsequent stations will likely deviate from a renewal pattern.</div><div>This study leverages neural networks to approximate the marginal steady-state distribution of the number of customers based on the external inter-arrival and service time distributions.</div><div>Our approach involves decomposing each station and estimating the departure process by characterizing its first five moments and auto-correlation values without limiting the analysis to linear or first-lag auto-correlation. We demonstrate that this method outperforms existing models, establishing it as state-of-the-art.</div><div>Furthermore, we present a detailed analysis of the impact of the <em><strong>i<sup>th</sup></strong></em> moments of inter-arrival and service times on steady-state probabilities of the number of customers in the system, showing that the first five moments are nearly sufficient to determine these probabilities. Similarly, we analyze the influence of inter-arrival auto-correlation, revealing that the first two lags of the first- and second-degree polynomial auto-correlation values almost wholly determine the steady-state probabilities of the number of customers in the system of a <em><strong>G/GI/1</strong></em> queue.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 1","pages":"Pages 141-156"},"PeriodicalIF":6.0,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143932551","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

Technology choice under the cap-and-trade policy: The impact of emission cap and technology efficiency 限额与交易政策下的技术选择：排放限额与技术效率的影响

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-05-08 DOI: 10.1016/j.ejor.2025.04.029

Shuhui Dong, Xiaole Wu

{"title":"Technology choice under the cap-and-trade policy: The impact of emission cap and technology efficiency","authors":"Shuhui Dong, Xiaole Wu","doi":"10.1016/j.ejor.2025.04.029","DOIUrl":"10.1016/j.ejor.2025.04.029","url":null,"abstract":"<div><div>This paper studies how competing firms make technology choices and production decisions under the cap-and-trade policy when they engage in both product and emission trading markets. Using a two-stage game theoretical model, we analyze firms’ responses to stricter emission caps and efficiency improvements of clean technology. Interestingly, we identify a “reverse trading” phenomenon where the firm with traditional technology and hence higher emission intensity sells emission allowances to the firm with clean technology because the latter operates with a higher profit margin and can afford a higher premium for allowances. Furthermore, stricter regulations incentivize firms to adopt clean technology only if the technology efficiency exceeds a certain level. Otherwise, no matter how low the emission cap is, neither firm will adopt it due to higher production costs. Additionally, cleaner technology does not necessarily provide firms greater incentives to adopt it. The efficiency of clean technology has a non-monotonic effect on firms’ adoption incentives because it not only affects the adopting firm but also has a positive spillover effect on the firm using traditional technology through emission trading. From a regulatory perspective, we propose setting a moderate emission cap to maximize social welfare, and as clean technology becomes more efficient, the optimal cap should be further tightened when the technology is already highly efficient. These findings provide practical insights for policymakers in designing the cap-and-trade policy tailored to different levels of technology improvements.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 2","pages":"Pages 286-298"},"PeriodicalIF":6.0,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144067537","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

Optimal insurance design with Lambda-Value-at-Risk 基于风险价值的最优保险设计

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-05-08 DOI: 10.1016/j.ejor.2025.04.038

Tim J. Boonen, Yuyu Chen, Xia Han, Qiuqi Wang

{"title":"Optimal insurance design with Lambda-Value-at-Risk","authors":"Tim J. Boonen, Yuyu Chen, Xia Han, Qiuqi Wang","doi":"10.1016/j.ejor.2025.04.038","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.038","url":null,"abstract":"This paper explores optimal insurance solutions based on the Lambda-Value-at-Risk (<mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mrow><mml:mi mathvariant=\"normal\">Λ</mml:mi><mml:mi mathvariant=\"normal\">VaR</mml:mi></mml:mrow></mml:math>). Using the expected value premium principle, we first analyze a stop-loss indemnity and provide a closed-form expression for the deductible parameter. A necessary and sufficient condition for the existence of a positive and finite deductible is also established. We then generalize the stop-loss indemnity and show that, akin to the VaR model, a limited stop-loss indemnity remains optimal within the <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mrow><mml:mi mathvariant=\"normal\">Λ</mml:mi><mml:mi mathvariant=\"normal\">VaR</mml:mi></mml:mrow></mml:math> framework. Further, we examine the use of <mml:math altimg=\"si3.svg\" display=\"inline\"><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant=\"normal\">Λ</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup><mml:mi mathvariant=\"normal\">VaR</mml:mi></mml:mrow></mml:math> as a premium principle and show that full or no insurance is optimal. We also identify that a limited loss indemnity is optimal when <mml:math altimg=\"si3.svg\" display=\"inline\"><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant=\"normal\">Λ</mml:mi></mml:mrow><mml:mrow><mml:mo>′</mml:mo></mml:mrow></mml:msup><mml:mi mathvariant=\"normal\">VaR</mml:mi></mml:mrow></mml:math> is solely used to determine the risk-loading in the premium principle. Additionally, we investigate the impact of model uncertainty, particularly in scenarios where the loss distribution is unknown but lies within a specified uncertainty set. Our findings suggest that a limited stop-loss indemnity is optimal when the uncertainty set is defined using a likelihood ratio. Meanwhile, when only the first two moments of the loss distribution are available, we provide a closed-form expression for the optimal deductible in a stop-loss indemnity.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"1 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143932485","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

Distributionally robust scheduling for the two-stage hybrid flowshop with uncertain processing time 具有不确定加工时间的两阶段混合流水车间的分布式鲁棒调度

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-05-06 DOI: 10.1016/j.ejor.2025.04.037

Zhi Pei, Rong Dou, Jiayan Huang, Haimin Lu

{"title":"Distributionally robust scheduling for the two-stage hybrid flowshop with uncertain processing time","authors":"Zhi Pei, Rong Dou, Jiayan Huang, Haimin Lu","doi":"10.1016/j.ejor.2025.04.037","DOIUrl":"10.1016/j.ejor.2025.04.037","url":null,"abstract":"<div><div>In the present paper, we investigate the two-stage hybrid flowshop with uncertain processing time. The true probability distribution of the processing time is unknown, but the statistical features can be extracted from historical data, such as the mean, lower and upper bounds. To obtain the exact scheduling result, a distributionally robust optimization (DRO) model is built to minimize the worst-case expected makespan. Then the inner problem is further reformulated as a minimization problem with a fixed sequence based on duality theory and the totally unimodular property. In addition, valid lower and upper bounds are introduced to transform the DRO model into an equivalent mixed-integer linear programming (MILP) problem with McCormick inequalities, which can be handled directly with the off-the-shelf commercial solvers. The numerical analysis demonstrates the higher computational efficiency of the DRO-based model compared with its stochastic programming (SP) counterpart. In particular, the DRO model consistently outperforms the SP model in terms of worst-case indicators. And in most cases, the DRO model triumphs the SP model in terms of average, up-quartile and up-decile indicators. Moreover, the optimal schedule obtained by the DRO model demonstrates stronger stability compared with the deterministic model. These features shed light on the principles behind reliable schedules for the two-stage hybrid flowshop scheduling model, thereby enhancing the robustness of the manufacturing system in the face of process uncertainty.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 2","pages":"Pages 270-285"},"PeriodicalIF":6.0,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143932484","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

Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems 具有时间窗和随机需求的城市快速路枢纽选址问题

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-05-05 DOI: 10.1016/j.ejor.2025.05.006

Yuehui Wu , Hui Fang , Ali Gul Qureshi , Tadashi Yamada

{"title":"Capacitated hub location routing problem with time windows and stochastic demands for the design of intra-city express systems","authors":"Yuehui Wu , Hui Fang , Ali Gul Qureshi , Tadashi Yamada","doi":"10.1016/j.ejor.2025.05.006","DOIUrl":"10.1016/j.ejor.2025.05.006","url":null,"abstract":"<div><div>This work focuses on planning an intra-city express system in a practical environment. Various operation characteristics, such as vehicle capacity, hub capacity, time windows, and stochastic demands, have been considered. Therefore, we introduce a capacitated hub location routing problem with time windows and stochastic demand and formulate it using a multi-stage recourse model. In this model, long-term decisions (hub location and client-to-hub allocation) are made first, and short-term decisions (vehicle routing) are determined after revealing stochastic variables. To solve the problem, we propose a hybrid stochastic variable neighbourhood search (HSVNS) algorithm, which integrates an adaptive large neighbourhood search (ALNS) algorithm within a stochastic variable neighbourhood search (SVNS) framework. Numerical experiments and case studies indicate that the HSVNS algorithm can provide high-quality solutions within a reasonable computation time for instances with up to 70 clients and that considering stochastic factors can efficiently reduce operation costs, especially for instances with tight vehicle capacity and loose time windows.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 2","pages":"Pages 255-269"},"PeriodicalIF":6.0,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143932486","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

Infeasibility conditions and resolution strategies for super-efficiency models under weak disposability and null-jointness: A directional distance function approach with endogenous directions 弱可处置性和零连接性下超效率模型的不可行性条件及解决策略——一种具有内生方向的定向距离函数方法

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-05-05 DOI: 10.1016/j.ejor.2025.04.039

Ruiyue Lin , Zongxin Li

{"title":"Infeasibility conditions and resolution strategies for super-efficiency models under weak disposability and null-jointness: A directional distance function approach with endogenous directions","authors":"Ruiyue Lin , Zongxin Li","doi":"10.1016/j.ejor.2025.04.039","DOIUrl":"10.1016/j.ejor.2025.04.039","url":null,"abstract":"<div><div>Existing studies have not focused on the infeasibility of super-efficiency models under the weak disposability and null-jointness (WDJ) assumptions, despite the wide adoption of these two conditions in fields where undesirable outputs exist, like the evaluation of energy and environmental efficiency. This paper employs a directional distance function (DDF) approach to investigate super-efficiency feasibility under these assumptions. We note that DDF-based super-efficiency models using frequently-used exogenous directions may encounter infeasibility under the WDJ assumptions, even when constant returns to scale (CRS) are assumed. We present the specific conditions that lead to this infeasibility. By utilizing endogenous directions, we construct a feasible DDF-based CRS super-efficiency model under the WDJ assumptions, ensuring that the DDF super-efficiency scores remain within a maximum of 1. We also find that the DDF-based super-efficiency model under the WDJ assumptions is infeasible in certain cases when variable returns to scale (VRS) are assumed, regardless of whether directions are endogenous or exogenous. To address this issue, we propose a modified DDF-based VRS super-efficiency model that aims to maintain the WDJ assumptions as much as possible. This VRS model ensures feasibility and generates DDF super-efficiency scores below 1. Some properties of the models and their relationships are discussed. Finally, several examples and a real case from the literature validate the feasibility and practical applicability of the proposed models.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 3","pages":"Pages 585-596"},"PeriodicalIF":6.0,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143932501","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