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

A structured framework for supporting the participatory development of consensual scenario narratives 一个结构化的框架，用于支持参与性发展的共识情景叙述

IF 6.4 2区管理学

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

Teemu Seeve, Eeva Vilkkumaa, Alec Morton

{"title":"A structured framework for supporting the participatory development of consensual scenario narratives","authors":"Teemu Seeve, Eeva Vilkkumaa, Alec Morton","doi":"10.1016/j.ejor.2025.04.048","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.048","url":null,"abstract":"High levels of uncertainty faced by decision makers can be alleviated by characterizing multiple possible ways in which the future might unfold with scenario narratives. Aiming at describing alternative plausible chains of outcomes of key uncertainty factors, scenario narratives are often associated with graphical networks describing the relationships between the outcomes of the factors. We present a participatory framework for bottom-up development of such networks, the PACNAP (PArticipatory development of Consensual narratives through Network Aggregation and Pruning) framework. In this framework, relationships of influence between factor outcomes are judged by a group of scenario process participants. We develop an optimization model for pruning an aggregated graph based on these judgments. The model selects those edges of the aggregate graph that the participants most agree upon and can be tailored to identify compact graphs of varying degrees of cyclicity. As a result, a variety of graphical representations of varying structural richness can be explored to arrive at a succinct representation of a consensus view on the structure of a joint narrative. To this end, the main formal results are the representation of the participants’ agreement lexicographically in a linear objective function of a 0-1 program, and the translation of the requisites of the compactness and cyclicity of the resulting pruned graphs into a set of network flow constraints. The problem of identifying a consensus graphical representation is a general one and our graph pruning method has application potential outside the specific domain of narrative development as well.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"14 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144133751","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

Modeling consumer stickiness in online platform pricing 在线平台定价中的消费者粘性建模

IF 6.4 2区管理学

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

Nina Yan, Tingting Tong, Gangshu (George) Cai

{"title":"Modeling consumer stickiness in online platform pricing","authors":"Nina Yan, Tingting Tong, Gangshu (George) Cai","doi":"10.1016/j.ejor.2025.04.041","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.041","url":null,"abstract":"Motivated by the operational practice of JD.com, China’s largest online retailer, our study delves into the phenomenon of consumer stickiness. It measures the probability that consumers will remain loyal to a specific product, refraining from purchasing alternatives, even in the temporary absence of the focal product. Based on real data from JD.com, we show that consumer stickiness has a significantly positive impact on online sales, which is used to justify our formulation of the demand function in theoretical analysis. Specifically, we adopt a game-theoretical approach to analyze the impact of consumer stickiness on two-period pricing strategies in monopolistic and competitive markets. Findings reveal that incorporating consumer stickiness leads to differentiated pricing strategies, with low-quality products reducing prices in the second period and high-quality products increasing them. Stickiness enhances total sales in monopolistic markets with high-quality products and in competitive markets with high market potential. Furthermore, stickiness contributes to increased revenue and improvements in consumer surplus and social welfare under large or small market conditions, underscoring its strategic importance for pricing and welfare outcomes. These findings contribute valuable insights into the dynamics of online platform competition and highlight the strategic implications of consumer stickiness in influencing pricing and platform revenue.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"26 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144133767","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

The cost of uninformed market timing 不了解市场时机的成本

IF 6.4 2区管理学

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

Moshe Levy

引用次数: 0

First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim 首次改进还是最佳改进？一个深入的局部搜索计算研究，以阐明一个优势主张

IF 6.4 2区管理学

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

Daniel Aloise, Robin Moine, Celso C. Ribeiro, Jonathan Jalbert

{"title":"First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim","authors":"Daniel Aloise, Robin Moine, Celso C. Ribeiro, Jonathan Jalbert","doi":"10.1016/j.ejor.2025.04.019","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.019","url":null,"abstract":"Local search methods start from a feasible solution and improve it by successive minor modifications until a solution that cannot be further improved is encountered. They are a common component of most metaheuristics. Two fundamental local search strategies exist: first-improvement and best-improvement. In this work, we perform an in-depth computational study using consistent performance metrics and rigorous statistical tests on several classes of test problems considering different initialization strategies and neighborhood structures to evaluate whether one strategy is dominant over the other. The numerical results show that computational experiments previously reported in the literature claiming the dominance of one strategy over the other for the TSP given an initialization method (random or greedy) cannot be extrapolated to other problems. Still, our results highlight the need for thorough experimentation and stress the importance of examining instance feature spaces and optimization landscapes to choose the best strategy for each problem and context, as no rule of thumb seems to exist for identifying the best local search strategy in the general case.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"30 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144067535","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 branch and bound algorithm for continuous multiobjective optimization problems using general ordering cones 用一般序锥求解连续多目标优化问题的分支定界算法

IF 6 2区管理学

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

Weitian Wu , Xinmin Yang

引用次数: 0

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.4 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":"https://doi.org/10.1016/j.ejor.2025.05.011","url":null,"abstract":"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.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"71 1","pages":""},"PeriodicalIF":6.4,"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.4 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