European Journal of Operational Research最新文献

Planning methods using data envelopment analysis and markov systems 使用数据包络分析和马尔可夫系统的规划方法

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-04-28 DOI: 10.1016/j.ejor.2025.04.050

Andreas C. Georgiou, Georgios Tsaples, Emmanuel Thanassoulis

{"title":"Planning methods using data envelopment analysis and markov systems","authors":"Andreas C. Georgiou, Georgios Tsaples, Emmanuel Thanassoulis","doi":"10.1016/j.ejor.2025.04.050","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.050","url":null,"abstract":"This paper explores the extension of a modelling framework that integrates data envelopment analysis (DEA) and markov systems, into a two-stage setting. In a recent paper in EJOR, a single-stage DEA-markov hybrid model was introduced, establishing a research direction blending these seemingly distinct approaches to address the attainability problem in workforce planning. Markov systems are widely used in scenarios where a population system (e.g., staff profiles, patients with chronic conditions) begins the planning horizon in a specific state and aims to transition to a new state by the end of the horizon. Although it is common for this horizon to encompass multiple steps, this hybrid model considered attainability within a single-step horizon. In the current study, we investigate problems in two phases and integrate a network DEA approach with markovian population systems under various assumptions, resulting into new variations of the relevant models. The decision maker (DM) can specify potential future outcomes (e.g., personnel flows) in consecutive steps in time, and use DEA to identify feasible courses of action through convexity (or even use the second stage in a normative manner to identify optimal flows). The two-stage DEA model captures the DM’s relative preferences for future states and provides measures of efficacy of potential flows relative to the ultimate desired state. Consequently, the organization can plan interventions to enhance the probability of achieving some anticipated goal. The paper includes illustrations using data from workforce planning and concludes with a discussion on relevant issues in healthcare, circular economy and social radicalization.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"11 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143901838","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

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

IF 6 2区管理学

European Journal of Operational Research Pub Date : 2025-04-28 DOI: 10.1016/S0377-2217(25)00334-0

引用次数: 0

Eliminating conflicts in group decision-making: Exploring potential information cocoon effects across varied levels of psychological resilience 消除群体决策中的冲突：探索不同心理弹性水平的潜在信息茧效应

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-04-28 DOI: 10.1016/j.ejor.2025.04.028

Siqi Zhang, Jianjun Zhu

{"title":"Eliminating conflicts in group decision-making: Exploring potential information cocoon effects across varied levels of psychological resilience","authors":"Siqi Zhang, Jianjun Zhu","doi":"10.1016/j.ejor.2025.04.028","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.028","url":null,"abstract":"In group decision-making (GDM), conflicts often arise, requiring decision-makers (DMs) to adjust their opinions. Variations in DMs’ backgrounds, expertise, and dynamic environmental interactions shape their psychological states, consequently affecting their information-processing strategies and potentially contributing to information cocoon effects. This study aims to develop a conflict-elimination framework that (1) evaluates DMs’ psychological states, (2) identifies the dual nature of information cocoon effects (ICEs) shaping their behaviors, and (3) formulates targeted conflict resolution strategies based on these insights. First, we employ a resilience model to quantify psychological resilience as an indicator of DMs’ psychological states. For highly resilient DMs — less susceptible to ICEs — a tailored conflict elimination strategy using a bi-level optimization model is introduced. For less resilient DMs — more prone to cocoon influences — we examine the conditions under which ICEs can obstruct or facilitate conflict resolution. We then design corresponding optimization models to harness these effects constructively. A numerical demonstration and sensitivity analysis confirm the proposed framework’s effectiveness. Our approach enhances decision-making efficiency and improves conflict resolution outcomes by aligning resolution strategies with DMs’ psychological states and the nature of their ICEs.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"16 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143901837","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

Optimal capital structure with earnings above a floor 盈利高于下限的最优资本结构

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-04-26 DOI: 10.1016/j.ejor.2025.04.023

Michi Nishihara, Takashi Shibata

引用次数: 0

Electric vehicle fleet charging management: An approximate dynamic programming policy 电动汽车车队充电管理：近似动态规划策略

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-04-25 DOI: 10.1016/j.ejor.2025.04.031

Ehsan Mahyari, Nickolas Freeman

{"title":"Electric vehicle fleet charging management: An approximate dynamic programming policy","authors":"Ehsan Mahyari, Nickolas Freeman","doi":"10.1016/j.ejor.2025.04.031","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.031","url":null,"abstract":"The growing prevalence of electric vehicles (EVs) requires efficient charging management strategies to tackle the challenges associated with their integration into the power grid. This requirement is particularly true for Charging-as-a-Service (CaaS) providers, who manage charging services for fleet operators in exchange for a fixed service fee. Incorporating uncertainty into optimization models for this dynamic environment further complicates the associated optimization problem, which falls into the NP-hard class. This research introduces an innovative approximate dynamic programming (ADP) policy for managing the charging of EV fleets at a charging depot equipped with diverse multi-connector chargers. A feature mapping analysis identifies critical system features that shape the future costs of a decision. A comparative analysis illustrates the effectiveness of the proposed policy in terms of cost reduction and service level. Moreover, we observe significant reductions in computation time when updating charging decisions compared to a two-stage rule-based model developed as a benchmark. In addition to benefits for EV fleet operators and CaaS providers, the proposed policy contributes to power grid sustainability by reducing charge load during peak hours, thereby enhancing overall grid stability and efficiency.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"18 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143901835","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 budget-adaptive allocation rule for optimal computing budget allocation 一种最优计算预算分配的预算自适应分配规则

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-04-22 DOI: 10.1016/j.ejor.2025.04.015

Zirui Cao, Haowei Wang, Ek Peng Chew, Haobin Li, Kok Choon Tan

{"title":"A budget-adaptive allocation rule for optimal computing budget allocation","authors":"Zirui Cao, Haowei Wang, Ek Peng Chew, Haobin Li, Kok Choon Tan","doi":"10.1016/j.ejor.2025.04.015","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.015","url":null,"abstract":"Simulation-based ranking and selection (R&S) is a popular technique for optimizing discrete-event systems (DESs). It evaluates the mean performance of system designs by simulation outputs and aims to identify the best system design from a set of alternatives by intelligently allocating a limited simulation budget. In R&S, the optimal computing budget allocation (OCBA) is an efficient budget allocation rule that asymptotically maximizes the probability of correct selection (PCS). In this paper, we first show the asymptotic OCBA rule can be recovered by considering a large-scale problem with a specific large budget. Considering a sufficiently large budget can greatly simplify computations, but it also causes the asymptotic OCBA rule ignoring the impact of budget. To address this, we then derive a budget-adaptive rule under the setting where budget is not large enough to simplify computations. The proposed budget-adaptive rule determines the ratio of total budget allocated to designs based on the budget size, and its budget-adaptive property highlights the significant impact of budget on allocation strategy. Based on the proposed budget-adaptive rule, two heuristic algorithms are developed. In the numerical experiments, the superior efficiency of our proposed allocation rule is shown.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"6 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143877946","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

Unleashing the power of text for credit default prediction: Comparing human-written and generative AI-refined texts 为信用违约预测释放文本的力量：比较人类编写的和生成人工智能精炼的文本

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-04-19 DOI: 10.1016/j.ejor.2025.04.032

Zongxiao Wu, Yizhe Dong, Yaoyiran Li, Baofeng Shi

{"title":"Unleashing the power of text for credit default prediction: Comparing human-written and generative AI-refined texts","authors":"Zongxiao Wu, Yizhe Dong, Yaoyiran Li, Baofeng Shi","doi":"10.1016/j.ejor.2025.04.032","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.032","url":null,"abstract":"This study explores the integration of a representative large language model, ChatGPT, into lending decision-making with a focus on credit default prediction. Specifically, we use ChatGPT to analyse and interpret loan assessments written by loan officers and generate refined versions of these texts. Our comparative analysis reveals significant differences between generative artificial intelligence (AI)-refined and human-written texts in terms of text length, semantic similarity, and linguistic representations. Using deep learning techniques, we show that incorporating unstructured text data, particularly ChatGPT-refined texts, alongside conventional structured data significantly enhances credit default predictions. Furthermore, we demonstrate how the contents of both human-written and ChatGPT-refined assessments contribute to the models’ prediction and show that the effect of essential words is highly context-dependent. Moreover, we find that ChatGPT’s analysis of borrower delinquency contributes the most to improving predictive accuracy. We also evaluate the business impact of the models based on human-written and ChatGPT-refined texts, and find that, in most cases, the latter yields higher profitability than the former. This study provides valuable insights into the transformative potential of generative AI in financial services.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"92 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143901836","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

Evacuation network design under road capacity improvement and uncertainty: second-order cone programming reformulations and Benders decomposition 道路容量改善和不确定性下的疏散网络设计：二阶锥规划重构和Benders分解

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-04-18 DOI: 10.1016/j.ejor.2025.04.030

Qing-Mi Hu, Shaolong Hu, Zhijie Sasha Dong, Yongjia Song

{"title":"Evacuation network design under road capacity improvement and uncertainty: second-order cone programming reformulations and Benders decomposition","authors":"Qing-Mi Hu, Shaolong Hu, Zhijie Sasha Dong, Yongjia Song","doi":"10.1016/j.ejor.2025.04.030","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.030","url":null,"abstract":"This work first presents a stochastic shelter location and evacuation planning problem with considering road capacity improvement strategies, in which the fixed setup cost of shelters and the improvement cost of road capacity are subject to a budget limit. To explicitly capture the impact of traffic volumes and road capacity improvement decisions on evacuation time, the Bureau of Public Roads function is employed. The problem is formulated as a non-convex mixed-integer nonlinear program (MINLP) model that is difficult to solve directly since the objective function is a multivariable non-convex nonlinear function. To tackle the non-convex MINLP, second-order cone programming (SOCP) reformulations that can be directly solved by using the state-of-the-art solvers are developed. Furthermore, a Benders decomposition (BD) approach that utilizes duality results of SOCP and employs acceleration strategies associated with valid inequalities, multi-cut, strengthened Benders cuts, knapsack inequalities, and callback routine, is proposed to solve large-scale problems. Moreover, extensive numerical experiments and a real-world case study (a potential hurricane risk zone in Texas, U.S.) are conducted to verify the applicability and effectiveness of the proposed model and solution approaches. Computational results show that the derived reformulations are competitive in dealing with small- and medium-scale problems, whereas BD approach demonstrates the best computational performance in solving large-scale problems. The devised acceleration strategies are effective in improving the computational efficiency of the BD approach. In addition, exerting investment for those shelters and arcs that are close to evacuation regions is useful to reduce the expected total evacuation time.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"109 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143901842","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

Reactive scheduling of uncertain jobs with maximum time lags 具有最大时间滞后的不确定作业的响应式调度

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-04-18 DOI: 10.1016/j.ejor.2025.04.013

Péter Györgyi, Tamás Kis, Evelin Szögi

{"title":"Reactive scheduling of uncertain jobs with maximum time lags","authors":"Péter Györgyi, Tamás Kis, Evelin Szögi","doi":"10.1016/j.ejor.2025.04.013","DOIUrl":"https://doi.org/10.1016/j.ejor.2025.04.013","url":null,"abstract":"This paper investigates a scheduling problem characterized by uncertain task durations and maximum time lags, a combination that has received little attention in the literature. The problem involves a set of jobs, each comprising a sequence of tasks where the penultimate task has uncertain duration, known only within a given range, and the final tasks are identical across all jobs. There must be no idle time between consecutive tasks of the same job, except for a bounded delay allowed between the penultimate and final tasks, which is consistent across all jobs. Each task requires a subset of renewable resources, and jobs have specific release dates and arrive in real time. The challenge is to determine the starting times of the tasks such that no resource or temporal constraints are violated, regardless of the realized task durations, with the goal of minimizing the total waiting time of the jobs. This problem is particularly relevant to bio-manufacturing applications. We propose a method to iteratively schedule the jobs in polynomial time, ensuring the optimal insertion of each job relative to the already scheduled ones. We also present a comprehensive computational evaluation of the proposed method.","PeriodicalId":55161,"journal":{"name":"European Journal of Operational Research","volume":"494 1","pages":""},"PeriodicalIF":6.4,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143877947","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

Flow-shop and job-shop robust scheduling problems with budgeted uncertainty 具有预算不确定性的流水车间和作业车间鲁棒调度问题

IF 6.4 2区管理学

European Journal of Operational Research Pub Date : 2025-04-18 DOI: 10.1016/j.ejor.2025.04.012

Carla Juvin, Laurent Houssin, Pierre Lopez

引用次数: 0