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

Pareto front for two-stage distributionally robust optimization problems 两阶段分布鲁棒优化问题的Pareto前沿

IF 6 2区管理学

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

Agostinho Agra , Filipe Rodrigues

{"title":"Pareto front for two-stage distributionally robust optimization problems","authors":"Agostinho Agra , Filipe Rodrigues","doi":"10.1016/j.ejor.2025.04.053","DOIUrl":"10.1016/j.ejor.2025.04.053","url":null,"abstract":"<div><div>Two-stage distributionally robust optimization is a recent optimization technique to handle uncertainty that is less conservative than robust optimization and more flexible than stochastic programming. The probability distribution of the uncertain parameters is not known but is assumed to belong to an ambiguity set. The size of certain types of ambiguity sets - such as several discrepancy-based ambiguity sets - is defined by a single parameter that makes it possible to control the degree of conservatism of the underlying optimization problem. Finding the values to assign to this parameter is a very relevant research topic. Hence, in this paper, we propose an exact and several heuristic methods for determining the control parameter values leading to all the relevant first-stage solutions. Our algorithmic approach resembles the <span><math><mrow><mi>ϵ</mi><mo>−</mo></mrow></math></span>constrained method used to generate the Pareto front of a bi-objective problem. To demonstrate the applicability and efficacy of the proposed approaches, we conduct experiments on three different problems: scheduling, berth allocation, and facility location. The results obtained indicate that the proposed approaches provide sets of first-stage solutions very close to the optimal in a reasonable time.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 1","pages":"Pages 174-188"},"PeriodicalIF":6.0,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144133749","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

Dynamic appointment rescheduling with patient preferences 动态预约重新安排与患者的偏好

IF 6 2区管理学

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

Tine Meersman , Broos Maenhout , Dieter Fiems

{"title":"Dynamic appointment rescheduling with patient preferences","authors":"Tine Meersman , Broos Maenhout , Dieter Fiems","doi":"10.1016/j.ejor.2025.05.005","DOIUrl":"10.1016/j.ejor.2025.05.005","url":null,"abstract":"<div><div>This study examines patient-initiated appointment rescheduling with consideration of patient preferences. Online rescheduling policies are investigated for the selection and sequential offering of new appointments upon the arrival of a rescheduling request via a telephone call. Appointments are offered until the patient accepts one or the maximum number of offers is reached. The aim is to reschedule appointments using a weighted function to maximise the patients’ satisfaction, optimise the operational performance, and minimise the number of patients deferred to a future time horizon. Different patient types are taken into account characterised by their uncertainties in rescheduling, cancellation, no-show, and service duration. The rescheduling process is formulated as a stochastic dynamic scheduling problem and approximated using a Markov Decision Process (MDP). Two heuristic policies are proposed, referred to as the myopic stochastic and the MDP-based algorithms. Both policies apply a simulation-optimisation approach that considers patient preferences and expected operational performance. To determine the set of offered appointments, the MDP-based algorithm additionally accounts for expected future rescheduling requests. Computational experiments are performed on real-life instances. The results demonstrate that the two proposed policies yield solutions of high quality. The myopic stochastic policy outperforms the MDP-based policy when it is challenging to offer suitable slots due to high capacity utilisation or a lack of clear patient preferences. Conversely, the MDP-based algorithm delivers better results when capacity utilisation is lower and there is some variation in preferences across days and patients.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 3","pages":"Pages 498-514"},"PeriodicalIF":6.0,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144133748","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

Formulations and branch-and-cut algorithms for cycle covers with up to [formula omitted] cycles 循环盖的公式和分支切断算法，最多可达[公式省略]个循环

IF 6.4 2区管理学

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

Francisco Canas, Luís Gouveia

{"title":"Formulations and branch-and-cut algorithms for cycle covers with up to [formula omitted] cycles","authors":"Francisco Canas, Luís Gouveia","doi":"10.1016/j.ejor.2025.04.047","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.047","url":null,"abstract":"Given a positive integer <mml:math altimg=\"si6.svg\" display=\"inline\"><mml:mi>p</mml:mi></mml:math> and a weighted undirected graph <mml:math altimg=\"si2.svg\" display=\"inline\"><mml:mrow><mml:mi>G</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mi>V</mml:mi><mml:mo>,</mml:mo><mml:mi>E</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>, we study a problem in which the objective is to find a minimum weight set of up to <mml:math altimg=\"si6.svg\" display=\"inline\"><mml:mi>p</mml:mi></mml:math> elementary cycles partitioning the vertices of <mml:math altimg=\"si4.svg\" display=\"inline\"><mml:mi>G</mml:mi></mml:math>. We study several exponentially sized formulations including <ce:italic>(i)</ce:italic> edge variables only; <ce:italic>(ii)</ce:italic> edge and depot variables only; <ce:italic>(iii)</ce:italic> edge, depot and node-depot assignment (NDA) variables only; <ce:italic>(iv)</ce:italic> edge, depot, NDA and edge-depot assignment (EDA) variables. New flow formulations are also introduced, and relations between all the formulations are established. Branch-and-cut algorithms based on many of these formulations are proposed, and computational experiments are conducted to compare the performance of the different algorithms. The computational testing reveals that some of the formulations including edge, depot and NDA or EDA variables produce the best initial lower bounds and that the best computational times are obtained with the algorithms based on formulations including edge and depot variables only. The best performing algorithm (in terms of computational times) is capable of solving several instances with up to 442 nodes for different values of <mml:math altimg=\"si6.svg\" display=\"inline\"><mml:mi>p</mml:mi></mml:math>.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"127 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144067529","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

Does carrier collaboration require combinatorial auctions? 运营商合作需要组合拍卖吗？

IF 6 2区管理学

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

Rudolf Vetschera, Dmitriy Knyazev

{"title":"Does carrier collaboration require combinatorial auctions?","authors":"Rudolf Vetschera, Dmitriy Knyazev","doi":"10.1016/j.ejor.2025.04.021","DOIUrl":"10.1016/j.ejor.2025.04.021","url":null,"abstract":"<div><div>Carrier collaboration has emerged as an important way to increase the efficiency of the logistics sector and has attracted significant interest as a research topic in the past decades. Most frameworks for carrier collaboration rely on combinatorial auctions to allocate bundles of transportation requests to carriers. In this paper, we analyze whether combinatorial auctions are indeed needed for this purpose, or additive pricing schemes, in which requests are priced and allocated separately, could also lead to efficient allocations. Using additive pricing would considerably simplify the entire process. Starting from concepts of economic equilibria, we argue that theory does not rule out this possibility even for complex valuations. We then analyze how often additive pricing schemes can support an efficient allocation of requests by simulating capacity-constrained Traveling Salesperson Problems. Our results indicate that, depending on the geographical configuration of requests, this is indeed possible in a large fraction of problems. Thus we argue that the current focus of carrier collaboration research on bundle generation and combinatorial auctions needs to be reconsidered.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 3","pages":"Pages 481-497"},"PeriodicalIF":6.0,"publicationDate":"2025-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144067531","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

Strategic entering time of a commerce platform 一个商业平台的战略进入时间

IF 6 2区管理学

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

Chia-Li Wang , Bara Kim , Jeongsim Kim

引用次数: 0

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 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 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":"10.1016/j.ejor.2025.04.019","url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 3","pages":"Pages 413-426"},"PeriodicalIF":6.0,"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