Baoping Tao, Zifei Han, Wen Shi, Min Wang, Linhan Ouyang
{"title":"Bayesian variable selection in Kriging metamodeling for quality design","authors":"Baoping Tao, Zifei Han, Wen Shi, Min Wang, Linhan Ouyang","doi":"10.1016/j.ejor.2025.06.003","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.06.003","url":null,"abstract":"The increasing complexity of production processes and rapid developments in digital technology have fueled the adoption of metamodels in quality design. Kriging has emerged as one of the most popular emulation methods for both deterministic and stochastic simulations. Conventional Kriging models with predetermined mean functions, such as ordinary or universal Kriging, may exhibit subpar predictive performance when strong trends exist. This paper proposes a novel variable selection procedure for the mean function that ensures prediction accuracy while using only a limited number of variables to capture the potential existing trends in deterministic simulations. The proposed method integrates the benefits of Bayesian variable selection and frequentist statistical tests. Initially, a group of potential models is chosen to build the mean function, employing the Bayesian method with priors designed to guarantee sparsity. This results in a significant reduction in the number of models to be considered in the next stage. Subsequently, each candidate model undergoes rigorous frequentist tests to thoroughly assess its reliability and validity. Extensive simulation studies are conducted using the well-known Borehole function and a real-life case. The results demonstrate the superiority of the proposed method over several existing approaches, establishing its effectiveness in achieving robust parameter design.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"70 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144337665","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}
{"title":"Valuation of power purchase agreements for corporate renewable energy procurement","authors":"Roozbeh Qorbanian , Nils Löhndorf , David Wozabal","doi":"10.1016/j.ejor.2025.05.054","DOIUrl":"10.1016/j.ejor.2025.05.054","url":null,"abstract":"<div><div>Corporate renewable power purchase agreements (PPAs) are long-term contracts that enable companies to source renewable energy without having to develop and operate their own capacities. Typically, producers and consumers agree on a fixed per-unit price at which power is purchased. The value of the PPA to the buyer depends on the so called capture price defined as the difference between this fixed price and the market value of the produced volume during the duration of the contract. To model the capture price, practitioners often use either fundamental or statistical approaches to model future market prices, which both have their inherent limitations. We propose a new approach that blends the logic of fundamental electricity market models with statistical learning techniques. In particular, we use regularized inverse optimization in a quadratic fundamental bottom-up model of the power market to estimate the marginal costs of different technologies as a parametric function of exogenous factors. We compare the out-of-sample performance in forecasting the capture price using market data from three European countries and demonstrate that our approach outperforms established statistical learning benchmarks. We then discuss the case of a photovoltaic plant in Spain to illustrate how to use the model to value a PPA from the buyer’s perspective.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 3","pages":"Pages 530-543"},"PeriodicalIF":6.0,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144337657","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}
{"title":"The storage location assignment and picker routing problem: A generic branch-cut-and-price algorithm","authors":"Thibault Prunet, Nabil Absi, Diego Cattaruzza","doi":"10.1016/j.ejor.2025.05.041","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.05.041","url":null,"abstract":"The <ce:italic>Storage Location Assignment Problem</ce:italic> (SLAP) and the <ce:italic>Picker Routing Problem</ce:italic> (PRP) have received significant attention in the literature due to their pivotal role in the performance of the <ce:italic>Order Picking</ce:italic> (OP) activity, the most resource-intensive process of warehousing logistics. The two problems are traditionally considered at different decision-making levels: tactical for the SLAP, and operational for the PRP. However, this paradigm has been challenged by the emergence of modern practices in e-commerce warehouses, where decisions are more dynamic. This shift makes the integrated problem, called the <ce:italic>Storage Location Assignment and Picker Routing Problem</ce:italic> (SLAPRP), pertinent to consider. Scholars have investigated several variants of the SLAPRP, including different warehouse layouts and routing policies. Nevertheless, the available computational results suggest that each variant requires an ad-hoc formulation. Moreover, achieving a complete integration of the two problems, where the routing is solved optimally, remains out of reach for commercial solvers, even on trivial instances.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"17 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144337667","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}
Matteo Ballegeer, Matthias Bogaert, Dries F. Benoit
{"title":"Evaluating the stability of model explanations in instance-dependent cost-sensitive credit scoring","authors":"Matteo Ballegeer, Matthias Bogaert, Dries F. Benoit","doi":"10.1016/j.ejor.2025.05.039","DOIUrl":"10.1016/j.ejor.2025.05.039","url":null,"abstract":"<div><div>Instance-dependent cost-sensitive (IDCS) classifiers offer a promising approach to improving cost-efficiency in credit scoring by tailoring loss functions to instance-specific costs. However, the impact of such loss functions on the stability of model explanations remains unexplored in literature, despite increasing regulatory demands for transparency. This study addresses this gap by evaluating the stability of Local Interpretable Model-agnostic Explanations (LIME) and SHapley Additive exPlanations (SHAP) when applied to IDCS models. Using four publicly available credit scoring datasets, we first assess the discriminatory power and cost-efficiency of IDCS classifiers, introducing a novel metric to enhance cross-dataset comparability. We then investigate the stability of SHAP and LIME feature importance rankings under varying degrees of class imbalance through controlled resampling. Our results reveal that while IDCS classifiers improve cost-efficiency, they produce significantly less stable explanations compared to traditional models, particularly as class imbalance increases, highlighting a critical trade-off between cost optimization and interpretability in credit scoring. Amid increasing regulatory scrutiny on explainability, this research underscores the pressing need to address stability issues in IDCS classifiers to ensure that their cost advantages are not undermined by unstable or untrustworthy explanations.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"326 3","pages":"Pages 630-640"},"PeriodicalIF":6.0,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144304898","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}
T. van der Beek, J.T. van Essen, J. Pruyn, K. Aardal
{"title":"Machine learning assisted differential evolution for the dynamic resource constrained multi-project scheduling problem with static project schedules","authors":"T. van der Beek, J.T. van Essen, J. Pruyn, K. Aardal","doi":"10.1016/j.ejor.2025.05.059","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.05.059","url":null,"abstract":"In large modular construction projects, such as shipbuilding, multiple similar projects arrive stochastically. At project arrival, a schedule has to be created, in which future modifications are difficult and/or undesirable. Since all projects use the same set of shared resources, current scheduling decisions influence future scheduling possibilities. To model this problem, we introduce the dynamic resource constrained multi-project scheduling problem with static project schedules. To find schedules, both a greedy approach and simulation-based approach with varying scenarios are introduced. Although the simulation-based approach schedules projects proactively, the computing times are long, even for small instances. Therefore, a method is introduced that learns from schedules obtained in the simulation-based method and uses a neural network to estimate the objective function value. It is shown that this method achieves a significant improvement in objective function value over the greedy algorithm, while only requiring a fraction of the computation time of the simulation-based method.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"21 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144304897","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}
{"title":"Design and pricing of extended warranty menus with reference effects","authors":"Xiao-Lin Wang, Chenglong Li, Junjie Wang","doi":"10.1016/j.ejor.2025.05.056","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.05.056","url":null,"abstract":"Consumer durables increasingly come with extended warranty menus—beyond manufacturers’ base warranties—that offer multiple options with differentiated protection lengths and prices. When choosing from an extended warranty menu, consumers might not only evaluate the intrinsic utility of each option but also form a reference point against which the available options are compared. In this paper, we posit that consumers compare the price-length ratios of available options when determining their willingness to pay, and investigate the design and pricing of extended warranty menus under such reference effects. To this end, we adapt the standard multinomial logit choice model to incorporate two types of reference point that are generated endogenously and exogenously, respectively, with respect to the given menu. We show that if the warranty options are ordered in the protection length, then the optimal pricing policies prescribe the same adjusted markup and the same price-length ratio alternately. We further extend our analysis to price competition under reference effects, where multiple firms compete in the aftermarket, each offering a single extended warranty. We prove the existence of a unique Nash equilibrium and develop an efficient method to identify it. Numerical examples are presented to illustrate the analytical findings, and sensitivity analyses are conducted to examine the impact of reference-effect coefficients on the optimal pricing policies. Overall, this work highlights the importance of incorporating reference effects into the design and pricing of extended warranty menus.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"103 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144304900","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}
Miguel Reula, Consuelo Parreño-Torres, Carlos Lamas-Fernandez, Antonio Martinez-Sykora
{"title":"A flexible mathematical model for Home Health Care Problems","authors":"Miguel Reula, Consuelo Parreño-Torres, Carlos Lamas-Fernandez, Antonio Martinez-Sykora","doi":"10.1016/j.ejor.2025.05.055","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.05.055","url":null,"abstract":"In the health and social care sectors it is common for some specialized teams to travel to patients homes to provide care. These teams are typically made up of by a number of staff members with varying skills, starting locations and working hours. Patients require different types of care, during specific time windows, and may have special requirements, such as needing two staff members, or multiple visits with some sort of temporal dependency between them. Since teams need to decide which staff member will visit each patient, as well as the routes they will take to do so, this kind of planning problem is known in the literature as the Home Health Care Routing and Scheduling Problem (HHCRSP). We introduce a new mixed integer linear programming formulation for the HHCRSP that extends previous models. Our formulation can readily be adapted to address more specific variants in the scientific literature, proving a larger number of optimal solutions and stronger lower bounds on benchmark instances using the same computational framework. We further propose an instance generator for producing scenarios that closely resemble those of the National Health Service in the United Kingdom.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"39 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144304938","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}
Manuel Amoussou, Khaled Belahcene, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane
{"title":"Designing and computing explanations for comparisons inferred from an additive value model","authors":"Manuel Amoussou, Khaled Belahcene, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane","doi":"10.1016/j.ejor.2025.05.058","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.05.058","url":null,"abstract":"Many decision models are based on an additive representation of preferences. Recommendations obtained from such additive decision models are sometimes considered as self-evident. On the contrary, we claim that these recommendations deserve an explanation so as to be fully understood by the user/decision-maker and to foster her trust. We propose to explain a preference statement <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>x</mml:mi></mml:math> preferred to <mml:math altimg=\"si2.svg\" display=\"inline\"><mml:mi>y</mml:mi></mml:math> by decomposing this statement into simpler ones. Arguments in favor of <mml:math altimg=\"si1.svg\" display=\"inline\"><mml:mi>x</mml:mi></mml:math> (Pros), and arguments in favor of <mml:math altimg=\"si2.svg\" display=\"inline\"><mml:mi>y</mml:mi></mml:math> (Cons) are decomposed using a <ce:italic>covering scheme</ce:italic> in which each Con is covered by a Pro. We use a <ce:italic>decomposition language</ce:italic> in which elementary self-evident statements involve (<ce:italic>i</ce:italic>) one Pro against one Con, (<ce:italic>ii</ce:italic>) one pro against several Cons, or (<ce:italic>iii</ce:italic>) several Pros against one Con. We prove that computing such explanations is computationally difficult in case (<ce:italic>ii</ce:italic>) and (<ce:italic>iii</ce:italic>), and propose a mathematical programming formulation to solve it. Numerical experiments provide insights on the actual behavior of our algorithm. We also illustrate the usefulness of our approach in the context of multicriteria decision aid but also for machine learning approaches.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"21 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144304904","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}
Longlong Shao, Jinpei Liu, Chenyi Fu, Ning Zhu, Huayou Chen
{"title":"Alternative ranking in trust network group decision-making: A distributionally robust optimization method","authors":"Longlong Shao, Jinpei Liu, Chenyi Fu, Ning Zhu, Huayou Chen","doi":"10.1016/j.ejor.2025.05.052","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.05.052","url":null,"abstract":"In group decision making problems, preference information can be conveniently and productively used to express the decision-makers’ evaluations over the given set of alternatives. However, the inherent imprecision of preference information may lead to fragile priority weights and unreliable alternative ranking. In this study, we propose a distributionally robust ranking model based on social networks to derive stable priorities, which takes into account the influence of uncertain preference information and the strength of relationships among decision-makers. Specifically, to capture the true data-generating distribution of uncertain parameters, we first develop a distributionally robust ranking model with a moment-based ambiguity set that contains all possible probability distributions over a support set. Then, we verify that the solutions exhibit strong finite-sample performance guarantees. Additionally, the developed model can be reformulated into an equivalent semidefinite programming model. To account for the strength of relationships among decision-makers, we employ propagation efficiency based on Shannon’s theorem, and develop the trust propagation and aggregation operators to obtain decision-makers’ weights. Finally, a numerical experiment is provided, in which the justification and robustness of the distributionally robust ranking model outperform several benchmark models by comparative discussions and robustness analyses.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"44 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144304899","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}
{"title":"Dynamic mode decomposition for online portfolio selection task","authors":"Jiahao Li, Yong Zhang, Xiaoteng Zheng","doi":"10.1016/j.ejor.2025.04.049","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.049","url":null,"abstract":"Online portfolio selection (OPS) is a complex task aimed at maximizing investment returns through strategic allocation of capital among risky assets. Traditional Follow the Winner (FTW) strategies, grounded in the Best Constant Rebalanced Portfolios strategy, assume market is independent and identically distributed (i.i.d.), which often fails to capture real-world financial market dynamics, leading to sub-optimal performance in practical applications. To address this limitation, we propose integrating Dynamic Mode Decomposition (DMD) into FTW strategies. DMD is a powerful data-driven technique that originated in the field of fluid dynamics. It is designed to extract coherent structures and identify temporal patterns within complex data. By applying DMD to financial market data, we can uncover underlying patterns and trends that are not apparent under the i.i.d. assumption. Significantly, the integrated DMD in this paper allows for efficient recursion, which is particularly crucial for OPS task. To illustrate the effectiveness of the proposed idea, we consider the Exponential Gradient (EG) strategy as an example and proposed Exponential Gradient with Dynamic Mode Decomposition (EGDMD). The results demonstrate that the proposed EGDMD outperforms traditional EG-type strategies, significantly improves risk-adjusted returns, and maintains computational efficiency. The integration of DMD allows for more accurate identification of market patterns, leading to more effective investment decisions and enhanced portfolio performance.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"26 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144304905","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}