European Journal of Operational Research最新文献

{"title":"Super conflict resolution approach based on minimum loss considering altruistic behavior and fairness concern","authors":"Qin Jiang ,&nbsp;Yong Liu ,&nbsp;Jia-qi An","doi":"10.1016/j.ejor.2025.03.018","DOIUrl":"10.1016/j.ejor.2025.03.018","url":null,"abstract":"<div><div>Due to difference in strength, power, or status among decision makers (DMs), traditional strategic conflict may be evolved into a super conflict problem where a powerful DM can force others to approach his strategy although other DMs suffer loss. For instance, the government can mobilize relevant enterprises to engage in ecological and environmental governance. Also, DMs may conduct irrational behaviors during negotiations, such as altruistic behavior and fairness concern. To guarantee interests of DMs and sustainable development of decision system, exploring the equilibrium strategy and state that resolves such conflict problem becomes necessary. Therefore, based on theories of conflict analysis, group consensus, Nash bargaining, Berge equilibrium and fairness theory, this paper constructs a super conflict resolution model. Firstly, this paper defines a super conflict information system by introducing the concept of ‘strategy’ and DMs’ information vectors containing DMs’ evaluation values regarding conflict states. Then from the perspective of group negotiation and consensus, we divide the super conflict resolution into three stages and construct a super conflict resolution model based on minimum loss. Considering coalitions’ altruistic behavior and fairness concern, we optimize the model by defining Berge equilibrium and fairness utility function. Finally, a case study of river basin pollution treatment verifies the validity and rationality of the proposed model.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 1","pages":"Pages 147-166"},"PeriodicalIF":6.0,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143678365","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":"Optimizing Asia–Europe container network: The Suez Canal and Cape of Good Hope routes in a changing world","authors":"Sadeque Hamdan ,&nbsp;Dominique Feillet ,&nbsp;Ali Cheaitou ,&nbsp;Pierre Cariou ,&nbsp;Nadjib Brahimi","doi":"10.1016/j.ejor.2025.03.008","DOIUrl":"10.1016/j.ejor.2025.03.008","url":null,"abstract":"<div><div>The aim of this paper is to develop an approach for evaluating various maritime transportation routes in light of ongoing disruptions and evolving global factors, including changes in demand, fluctuations in fuel prices, geopolitical shifts, and environmental considerations. For each alternative route, a profit maximization liner shipping problem with speed optimization is solved. Both edge-based speed optimization and maximum transit time of commodities are considered. We have proposed a mathematical programming formulation followed by an efficient hybrid approach for the optimization problem. The hybrid approach utilizes a population-based heuristic to optimize the route and an exact algorithm to optimize commodities and speed. A thorough analysis is made on the costs associated with the different alternative routes. Although the approach can be applied to different regions of the world and under the variation of several factors, we focus on the Asia–Europe trade route and on the evolution of the market demand. The comparison is made between a route going through Suez Canal and the alternative route of going through the Cape of Good Hope. Besides the high efficiency of the solution procedure, we have found that the Cape of Good Hope route can be economically interesting especially if there is demand in some African ports and if vessels of less than 20,000 TEU capacity are used.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 1","pages":"Pages 167-188"},"PeriodicalIF":6.0,"publicationDate":"2025-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143678368","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":"Profit-based uncertainty estimation with application to credit scoring","authors":"Yong Xu ,&nbsp;Gang Kou ,&nbsp;Daji Ergu","doi":"10.1016/j.ejor.2025.03.007","DOIUrl":"10.1016/j.ejor.2025.03.007","url":null,"abstract":"<div><div>Credit scoring is pivotal in financial risk management and has attracted significant research interest. While existing studies primarily concentrate on enhancing model predictive power and economic value, they often overlook the crucial aspect of predictive uncertainty, especially in the context of deep neural networks applied to credit scoring. This study addresses uncertainty estimation in credit scoring and evaluates three widely used uncertainty methods across various credit datasets. Additionally, guided by the maximum profit criterion, we propose two profit-based uncertainty metrics to assess profit uncertainties stemming from predictive uncertainty, specifically targeting class-dependent and instance-dependent cost scenarios. Subsequently, we develop a classification system with a rejection mechanism based on these metrics. Our approach aims to improve model profitability and reduce predictive uncertainty, specifically regarding model profit. Empirical results across several benchmark credit datasets indicate that our proposed framework outperforms existing methods in terms of increasing model profit in different credit-scoring scenarios. Furthermore, sensitivity analyses of varying cost parameter settings highlight the robustness of our framework.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 2","pages":"Pages 303-316"},"PeriodicalIF":6.0,"publicationDate":"2025-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143678369","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":"A nonparametric online control chart for monitoring crowd density using relative density-ratio estimation","authors":"Wenhui Zhou ,&nbsp;Yibin Xie ,&nbsp;Zhibin Zheng","doi":"10.1016/j.ejor.2025.03.006","DOIUrl":"10.1016/j.ejor.2025.03.006","url":null,"abstract":"<div><div>With the increasing incidence of fatal crowd stampede disasters at public events due to rapid urbanization and escalating population density, there is an urgent need for real-time monitoring of crowd flow to prevent such tragic incidents. This paper proposes a novel nonparametric online control chart for crowd density monitoring, called the RDR-CUSUM chart. This chart utilizes a new statistic based on the principles of cumulative sum (CUSUM) and relative density ratio (RDR). We present an RDR estimation method for deriving this statistic, which is enhanced by an S-M Invertor algorithm to ensure the efficiency required for real-time application. Numerical analyses demonstrate that the proposed chart can quickly respond to the distribution’s mean, variance, pattern, and different distribution parameter shifts. Moreover, the effectiveness of the method has been validated through two application examples, which illustrate its proficiency in detecting changes in crowd density and providing early warnings of potential crowd stampede disasters.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 1","pages":"Pages 132-146"},"PeriodicalIF":6.0,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143640992","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":"Cyclic stochastic two-echelon inventory routing for an application in medical supply","authors":"Alexander Rave ,&nbsp;Pirmin Fontaine ,&nbsp;Heinrich Kuhn","doi":"10.1016/j.ejor.2025.02.032","DOIUrl":"10.1016/j.ejor.2025.02.032","url":null,"abstract":"<div><div>Drug availability in clinics is essential for patient services, whose demand for medication is uncertain. Thus, clinics must have a variety of drugs available, leading to high inventory holding costs. In Germany, it is common for a larger central clinic to take over the procurement of drugs and distribute them to smaller surrounding clinics, which results in a two-echelon network structure. The clinics, however, operate according to their inventory policy as they plan independently. Additionally, the inventory policies include instant replenishment orders to avoid shortages, which can be executed by various vehicles, such as vans or aerial drones, because the orders only involve a few medications.</div><div>We present a two-stage stochastic program for a multi-product two-echelon inventory routing problem with stochastic demands. We decide on the cost-optimal cyclic delivery patterns and reorder points for the clinics with instant replenishment orders as recourse decision. Further, we introduce an adaptive large neighborhood search with problem-specific operators that modify the routing, delivery periods, and reorder points. We present a case study at a large German clinic that supplies multiple surrounding clinics and plans to integrate drone instead of van deliveries for emergency resupply. Our integrated approach leads to cost savings of 57% for the surrounding clinics and 18% for the central clinic. Using drone delivery compared to van delivery, the average stock of medication at surrounding clinics can be reduced, resulting in a total cost decrease of 29% while maintaining medication availability.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 1","pages":"Pages 81-99"},"PeriodicalIF":6.0,"publicationDate":"2025-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143640990","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":"A logic-based Benders decomposition approach for a fuel delivery problem with time windows, unsplit compartments, and split deliveries","authors":"Rafael A. Melo ,&nbsp;Celso C. Ribeiro ,&nbsp;Sebastián Urrutia ,&nbsp;Pieter Vansteenwegen","doi":"10.1016/j.ejor.2025.03.003","DOIUrl":"10.1016/j.ejor.2025.03.003","url":null,"abstract":"<div><div>We consider a single-period fuel delivery problem in which a distribution company has to transport multiple types of fuel from a depot to a set of service stations using a heterogeneous set of multi-compartment vehicles. Among other characteristics, the problem includes time windows, a limit on the duration of each route, unsplit compartments, and split deliveries. We propose two mixed integer programming (MIP) formulations and a logic-based Benders decomposition approach. The first formulation is an arc-based model while the second is based on the possible trips. The logic-based Benders decomposition follows a trip-based principle and breaks down the problem into a generalized assignment master problem and a subproblem responsible for identifying violated feasibility cuts implicated by the time-related constraints. It takes advantage of the problem-specific characteristics that allow efficiently solving the resulting subproblems. The logic-based Benders decomposition also serves as a heuristic, which works by limiting the number of trips generated throughout the process. Symmetry breaking constraints and preprocessing procedures are also proposed to help solving the formulations. The computational experiments using synthetic instances show that the logic-based Benders decomposition outperforms the other formulations and is very effective in solving the considered benchmark instances. It solved to optimality instances with up to 20 customers. The MIP heuristic obtained solutions within 7.2% of the optimal cost for all but one of the tested instances with up to 25 customers. Furthermore, it proved to be a viable approach for medium-sized instances where the exact logic-based Benders decomposition encountered difficulties.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 1","pages":"Pages 100-117"},"PeriodicalIF":6.0,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143640989","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":"Data envelopment analysis fixed cost allocation based on dynamic bargaining game and the Nash equilibrium","authors":"Junfei Chu ,&nbsp;Yanhua Dong ,&nbsp;Weijiao Wang ,&nbsp;Yuting Rui ,&nbsp;Zhe Yuan","doi":"10.1016/j.ejor.2025.03.009","DOIUrl":"10.1016/j.ejor.2025.03.009","url":null,"abstract":"<div><div>Fixed cost allocation (FCA) poses a significant challenge for decision-making units (DMUs) contributing to a shared cost. Each DMU aims to allocate the minimum possible cost to itself. As a result, different DMUs hold varying and often conflicting allocation proposals and preferences, which prevents them from reaching a consensus on the FCA outcome. This paper develops a dynamic bargaining game-based fixed cost allocation (DBG-FCA) approach within the data envelopment analysis (DEA) framework to address this issue. The DBG-FCA approach employs an iterative process where each DMU proposes its preferred allocation during each iteration. All DMUs gradually converge on a consensus FCA outcome through dynamic negotiations and gradual compromise. Notably, this consensus upholds the individual rationality of each DMU, allowing them to align their proposals with their specific interests. Furthermore, the analysis establishes that the resulting FCA solution constitutes a Nash equilibrium, guaranteeing stability and universal acceptance among the DMUs. The effectiveness of the proposed approach is further illustrated through a numerical example and a case study involving FCA across 14 bank branches, along with a comparison to existing FCA methods.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 2","pages":"Pages 317-328"},"PeriodicalIF":6.0,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143744780","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":"Heteroscedasticity-aware stratified sampling to improve uplift modeling","authors":"Björn Bokelmann ,&nbsp;Stefan Lessmann","doi":"10.1016/j.ejor.2025.02.030","DOIUrl":"10.1016/j.ejor.2025.02.030","url":null,"abstract":"<div><div>Randomized controlled trials (RCTs) are conducted in many business applications including online marketing or customer churn prevention to investigate the effect of specific treatments (coupons, retention offers, mailings, etc.). RCTs allow for the estimation of average treatment effects and the training of (uplift) models for the heterogeneity of treatment effects across individuals. The problem with RCTs is that they are costly, and this cost increases with the number of individuals included. These costs have inspired research on how to conduct experiments with a small number of individuals while still obtaining precise treatment effect estimates. We contribute to this literature a <em>heteroskedasticity-aware stratified sampling</em> (HS) scheme. We leverage the fact that different individuals have different noise levels in their outcome and that precise treatment effect estimation requires more observations from the “high-noise” individuals than from the “low-noise” individuals. We show theoretically and empirically that HS sampling yields significantly more precise estimates of the ATE, improves uplift models, and makes their evaluation more reliable compared to RCT data sampled completely randomly. Due to these benefits and the simplicity of our approach, we expect HS sampling to be valuable in many real-world applications in business and beyond.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 1","pages":"Pages 118-131"},"PeriodicalIF":6.0,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143640991","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":"Solving a multi-resolution model of the train platforming problem using Lagrangian Relaxation with dynamic multiplier aggregation","authors":"Qin Zhang ,&nbsp;Richard Martin Lusby ,&nbsp;Pan Shang ,&nbsp;Chang Liu ,&nbsp;Wenqian Liu","doi":"10.1016/j.ejor.2025.03.004","DOIUrl":"10.1016/j.ejor.2025.03.004","url":null,"abstract":"<div><div>High-speed railway stations are crucial junctions in high-speed railway networks. Compared to operations on the tracks between stations, trains have more routing possibilities within stations. As a result, track allocation at a station is relatively complicated. In this study, we aim to solve the train platforming problem for a busy high-speed railway station by considering comprehensive track resources and interlocking configurations. A multi-resolution space–time network is constructed to capture infrastructure information from a macroscopic and a microscopic perspective. Additionally, we propose a nonlinear programming model that minimizes a weighted sum of total travel time and total deviation time for trains at the station. We apply Lagrangian Relaxation combined with dynamic multiplier aggregation to a linearized version of the model and demonstrate how this induces a decomposable, macroscopic train-specific path choice problem that is guided by aggregated Lagrange multipliers, which are dynamically generated based on microscopic resource capacity violations. As case studies, the proposed model and solution approach are applied to a small virtual railway station and two high-speed railway hub stations located on two of the busiest high-speed railway lines in China. Through a comparison of other approaches that include Logic-based Benders Decomposition, we highlight the superiority of the proposed method; on realistic instances, the proposed method finds solution that are, on average, approximately 2% from optimality for one station and less than 5% from optimality for the other.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"324 3","pages":"Pages 981-1001"},"PeriodicalIF":6.0,"publicationDate":"2025-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143640993","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":"Managing supply chains facing extreme weather: Supplier’s nature and investment","authors":"Indranil Biswas ,&nbsp;Dewang Pagare ,&nbsp;Sunil Tiwari ,&nbsp;Tsan-Ming Choi","doi":"10.1016/j.ejor.2025.02.026","DOIUrl":"10.1016/j.ejor.2025.02.026","url":null,"abstract":"<div><div>In recent times, extreme weather conditions have been playing havoc on supply chains. Companies are investing in climate-specific assets to mitigate weather-related risks and ensure continuous supply chain activities. In this paper, we analytically investigate a supplier’s decision regarding climate-specific investment to understand how the probability of weather disruption, its effort during extreme weather, and its reciprocal behavior influence the buyer’s optimal order decision. We develop a dynamic game model to capture and examine the nature of the supplier–buyer interaction. We also investigate the impact of the supplier’s nature on this interaction during an extreme weather event. Our key findings are as follows: (i) With a higher probability of extreme weather disruption, the supplier prefers generic investment over climate-specific investment. (ii) With a decrease in the probability of extreme weather events, the non-proactive supplier prefers generic investment, whereas the proactive supplier prefers climate-specific investment. This situation allows proactive suppliers to reveal themselves and buyers to recognize the nature of suppliers by observing their investment type. The buyer chooses to source from the proactive supplier when it anticipates extreme weather scenarios. (iii) A downstream buyer orders less from the non-proactive supplier and orders the required quantity from the proactive supplier. There exists a pooling equilibrium for the supplier–buyer interaction where all types of suppliers choose a climate-specific investment, and the buyer orders its required order quantity. Subsequently, through extended analysis, we demonstrate that the proactive supplier charges a higher per-unit price to the buyer in the case of a higher possibility of extreme weather events. The proactive supplier charges a reduced per-unit price only if it exhibits reciprocal behavior. From our analysis, we also find that, with an increase in the cost of climate-specific investment, a non-proactive supplier tends to choose a generic investment and a proactive supplier tends to choose a climate-specific investment.</div></div>","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"325 3","pages":"Pages 457-473"},"PeriodicalIF":6.0,"publicationDate":"2025-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143678370","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}