European Journal of Operational Research最新文献

Prelim p. 2; First issue - Editorial Board 预演p. 2；第一期-编辑委员会

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-05-27 DOI: 10.1016/S0377-2217(25)00428-X

引用次数: 0

Scalarisation-based risk concepts for robust multi-objective optimisation 稳健多目标优化的基于比例化的风险概念

IF 6.4 2区管理学

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

Ben Tu, Nikolas Kantas, Robert M. Lee, Behrang Shafei

{"title":"Scalarisation-based risk concepts for robust multi-objective optimisation","authors":"Ben Tu, Nikolas Kantas, Robert M. Lee, Behrang Shafei","doi":"10.1016/j.ejor.2025.04.054","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.054","url":null,"abstract":"Robust optimisation is a well-established framework for optimising functions in the presence of uncertainty. The inherent goal of this problem is to identify a collection of inputs whose outputs are both desirable for the decision maker, whilst also being robust to the underlying uncertainties in the problem. In this work, we study the multi-objective case of this problem. We identify that the majority of all robust multi-objective algorithms rely on two key operations: robustification and scalarisation. Robustification refers to the strategy that is used to account for the uncertainty in the problem. Scalarisation refers to the procedure that is used to encode the relative importance of each objective to a scalar-valued reward. As these operations are not necessarily commutative, the order that they are performed in has an impact on the resulting solutions that are identified and the final decisions that are made. The purpose of this work is to give a thorough exposition on the effects of these different orderings and in particular highlight when one should opt for one ordering over the other. As part of our analysis, we showcase how many existing risk concepts can be integrated into the specification and solution of a robust multi-objective optimisation problem. Besides this, we also demonstrate how one can principally define the notion of a robust Pareto front and a robust performance metric based on our “robustify and scalarise” methodology. To illustrate the efficacy of these new ideas, we present two insightful case studies which are based on real-world data sets.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"39 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144133745","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

Robust optimization of a procurement and routing strategy for multiperiod multimodal transport in an uncertain environment 不确定环境下多周期多式联运采购和路线策略的鲁棒优化

IF 6.4 2区管理学

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

Fang Guo, Jingfu Liang, Runliu Niu, Zhihong Huang, Qixuan Liu

{"title":"Robust optimization of a procurement and routing strategy for multiperiod multimodal transport in an uncertain environment","authors":"Fang Guo, Jingfu Liang, Runliu Niu, Zhihong Huang, Qixuan Liu","doi":"10.1016/j.ejor.2025.05.004","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.05.004","url":null,"abstract":"This paper proposes a collaborative optimization strategy for multiperiod procurement and multimodal transportation that considers cost factors such as procurement, transportation, transshipment, and storage costs incurred for early arrival. A mixed-integer planning model is established to minimize the overall operating costs of cross-border e-commerce enterprises by arranging procurement, transportation, and storage strategies. Considering the fluctuation of procurement costs with the market environment, this study constructs robust optimization models and develops linear robust equivalence models through mathematical transformation to improve the efficiency of problem solving. A hybrid heuristic algorithm, KIGALNS, is proposed to solve this problem. Finally, a series of numerical experiments are conducted to show that our robust model can better address multimodal transportation path optimization problems such as procurement cost uncertainty. In addition, the correctness of the proposed model and the effectiveness of the algorithm and collaborative optimization strategy were verified. Finally, the case analysis shows that the early procurement strategy helps reduce total operating costs, and the robust model can effectively handle multimodal transportation path optimization problems such as uncertain procurement costs. While promoting cost reduction and efficiency improvement in transportation, the proposed approach comprehensively considers the impact of procurement plans and uncertain factors, providing theoretical guidance and scientific solutions for joint decision-making in enterprise procurement transportation.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"21 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144133746","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

Solution-hashing search based on layout-graph transformation for unequal circle packing 基于布局图变换的不等圆布局解哈希搜索

IF 6.4 2区管理学

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

Jianrong Zhou, Jiyao He, Kun He

{"title":"Solution-hashing search based on layout-graph transformation for unequal circle packing","authors":"Jianrong Zhou, Jiyao He, Kun He","doi":"10.1016/j.ejor.2025.05.003","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.05.003","url":null,"abstract":"The problem of packing unequal circles into a circular container is a classic and challenging optimization problem in the field of computational geometry. This study introduces a suite of innovative and efficient methods to tackle this problem. Firstly, we present a novel layout-graph transformation method that represents configurations as graphs, together with an inexact hash method facilitating fast comparison of configurations on isomorphism or similarity. Leveraging these advancements, we propose an iterative solution-hashing search algorithm adept at circumventing redundant exploration through efficient configuration recording. Additionally, we introduce several enhancements to refine the optimization and search processes, including an adaptive adjacency maintenance method, an efficient vacancy detection technique, and a Voronoi-based locating method. Our algorithm demonstrates excellent performance over existing state-of-the-art methods through comprehensive computational experiments across various benchmark instances, showcasing quality applicability and versatility. Notably, our algorithm improves the best-known results for 116 out of 239 benchmark instances while achieving parity with the remaining instances.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"24 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144133747","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 proximal splitting algorithm for generalized DC programming with applications in signal recovery 广义直流规划的近分裂算法及其在信号恢复中的应用

IF 6 2区管理学

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

Tan Nhat Pham , Minh N. Dao , Nima Amjady , Rakibuzzaman Shah

{"title":"A proximal splitting algorithm for generalized DC programming with applications in signal recovery","authors":"Tan Nhat Pham , Minh N. Dao , Nima Amjady , Rakibuzzaman Shah","doi":"10.1016/j.ejor.2025.04.034","DOIUrl":"10.1016/j.ejor.2025.04.034","url":null,"abstract":"<div><div>The difference-of-convex (DC) program is an important model in nonconvex optimization due to its structure, which encompasses a wide range of practical applications. In this paper, we aim to tackle a generalized class of DC programs, where the objective function is formed by summing a possibly nonsmooth nonconvex function and a differentiable nonconvex function with Lipschitz continuous gradient, and then subtracting a nonsmooth continuous convex function. We develop a proximal splitting algorithm that utilizes proximal evaluation for the concave part and Douglas–Rachford splitting for the remaining components. The algorithm guarantees subsequential convergence to a critical point of the problem model. Under the widely used Kurdyka–Łojasiewicz property, we establish global convergence of the full sequence of iterates and derive convergence rates for both the iterates and the objective function values, without assuming the concave part is differentiable. The performance of the proposed algorithm is tested on signal recovery problems with a nonconvex regularization term and exhibits competitive results compared to notable algorithms in the literature on both synthetic data and real-world data.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 1","pages":"Pages 42-53"},"PeriodicalIF":6.0,"publicationDate":"2025-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144133750","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

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