Annals of Operations Research最新文献_第9页

Predicting energy poverty using household budget survey: a machine learning approach 使用家庭预算调查预测能源贫困：一种机器学习方法

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-04-13 DOI: 10.1007/s10479-026-07187-w

Giuseppe Scandurra, Alfonso Carfora, Antonio Thomas, Cecilia Camporeale

{"title":"Predicting energy poverty using household budget survey: a machine learning approach","authors":"Giuseppe Scandurra, Alfonso Carfora, Antonio Thomas, Cecilia Camporeale","doi":"10.1007/s10479-026-07187-w","DOIUrl":"10.1007/s10479-026-07187-w","url":null,"abstract":"<div><p>Energy poverty (EP) is considered an urgent challenge, intensified by rising energy costs, economic inequality, and the transition toward green energy, which involves many Western countries. By referring to Italy, this study employs machine learning algorithms (MLAs) to predict and classify EP using official Household Budget Survey (HBS) data. To evaluate EP, the study compares several MLAs alongside three expenditure-based indicators proposed in three seminal articles by Hills, Faiella and Lavecchia, and Betto et al. Among these, the indicator developed by Betto et al., which accounts for regional and socioeconomic disparities, consistently outperforms the others across all MLAs, demonstrating higher accuracy, precision, and recall. This ensures a more comprehensive identification of energy-poor households. The analysis highlights the significant impact of data imbalance on model performance, emphasizing the need for techniques such as SMOTE and undersampling. The superior performance of the Betto et al. indicator underscores its potential as a benchmark for EP measurement, providing a valuable tool for policymakers to design targeted interventions, allocate resources effectively, and support a just and sustainable energy transition. The study reinforces the importance of dynamic, data-driven approaches to address EP, and calls for improved data collection to enhance prediction accuracy and policy effectiveness.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"1073 - 1100"},"PeriodicalIF":4.5,"publicationDate":"2026-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07187-w.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Student assignments with preferences and maximum diversity 学生作业的偏好和最大的多样性

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-04-13 DOI: 10.1007/s10479-026-07189-8

Arne Schulz

{"title":"Student assignments with preferences and maximum diversity","authors":"Arne Schulz","doi":"10.1007/s10479-026-07189-8","DOIUrl":"10.1007/s10479-026-07189-8","url":null,"abstract":"<div><p>The paper considers the assignment of students to seminars regarding three hierarchical objectives: maximizing the students’ preferences, maximizing the within seminar diversity, minimizing the between seminar diversity variation. While the first objective pictures the students, preferences, the second and third picture the school’s preference of having comparable seminar groups. To reach this aim the paper extends the well-known Maximally Diverse Grouping Problem and its balanced version by the first objective, the students’ interests. The students’ interests are pictured by a preference sequence the students have for the offered seminars, e.g. because of the scheduled time, the topic or the lecturer. We present solution approaches that include properties from game theory in the assignment and result in an assignment of students to seminars including the students’ as well as the school’s preferences. Our results show that the presented solution approaches are able to solve instances of practical relevant size within half an hour (close to) optimality. Furthermore, in our artificial test instances, including student preferences in the assignment only led to a small reduction of the maximal diversity for instances of realistic size (2–3% difference for seminars with 20 students).</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"1101 - 1124"},"PeriodicalIF":4.5,"publicationDate":"2026-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07189-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Balancing efficiency and fairness in large-scale group decision-making: a two-stage consensus-reaching process with minimum adjustment-maximum fairness model 大规模群体决策中效率与公平的平衡：基于最小调整-最大公平模型的两阶段共识过程

IF 4.1 3区管理学

Annals of Operations Research Pub Date : 2026-04-13 DOI: 10.1007/s10479-026-07162-5

Jie Guo, Zilong Wang, Zhiwen Zhang

{"title":"Balancing efficiency and fairness in large-scale group decision-making: a two-stage consensus-reaching process with minimum adjustment-maximum fairness model","authors":"Jie Guo, Zilong Wang, Zhiwen Zhang","doi":"10.1007/s10479-026-07162-5","DOIUrl":"10.1007/s10479-026-07162-5","url":null,"abstract":"<div><p>Decision-making problems in contemporary world require the collaborative involvement of decision-makers (DMs) from multiple fields. Large-scale group decision-making (LSGDM) integrating diverse perspectives of many DMs has been widely applied across various real-world decision-making scenarios. As the scale of DMs expands, ensuring efficiency while also considering fairness becomes increasingly challenging. To address this, a two-stage consensus-reaching process (CRP) based on minimum adjustment-maximum fairness model is introduced. To balance subgroup cohesion and opinion diversity, we propose a two-phase clustering method incorporating an adaptive adjustment mechanism that promotes the formation of a more balanced subgroup structure. A weight determination method based on preference analysis is proposed to capture differences in DMs’ influence by integrating both multidimensional objective performances and subjective judgments. Furthermore, a two-stage CRP is proposed to promote consensus-reaching at both intra-subgroup and inter-subgroup levels. Specifically, a minimum adjustment-maximum fairness consensus model (MAMFCM) is proposed to ensure adjustment efficiency while better balancing fairness among DMs within subgroups. In the CRP among subgroups, a minimum adjustment consensus model (MACM) with balanced adjustment differences is constructed to generate recommended adjustments for subgroups. A maximum fairness adjustment model (MFAM) is established to guide DMs in adjusting their evaluations, aligning subgroups’ evaluations with recommended adjustments without disrupting internal consensus. Finally, the effectiveness of the proposed model is validated by a numerical example, and its properties are highlighted through comparative analysis. The results indicate that moderate concessions in efficiency to enhance fairness can significantly improve DMs’ satisfaction, thereby facilitating consensus-reaching in LSGDM.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"364 3","pages":"2899 - 2944"},"PeriodicalIF":4.1,"publicationDate":"2026-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148965275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A multi-objective memetic algorithm for energy-efficient flow shop group scheduling problem with a dynamic speed-scaling mechanism 基于动态速度缩放机制的多目标模因算法求解节能流水车间群调度问题

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-04-13 DOI: 10.1007/s10479-026-07195-w

Shuaipeng Yuan, Bailin Wang, Sihan Wang, Yihan Pei, Tieke Li

{"title":"A multi-objective memetic algorithm for energy-efficient flow shop group scheduling problem with a dynamic speed-scaling mechanism","authors":"Shuaipeng Yuan, Bailin Wang, Sihan Wang, Yihan Pei, Tieke Li","doi":"10.1007/s10479-026-07195-w","DOIUrl":"10.1007/s10479-026-07195-w","url":null,"abstract":"<div><p>This study investigates an energy-efficient flow shop group scheduling problem that incorporates a dynamic speed-scaling mechanism, where both the sequence-dependent setup times and round-trip transportation times are considered. This problem involves three deeply coupled sub-problems: the sequence of groups, the sequence of jobs within each group, and the processing speed of each job on each machine. To the best of our knowledge, this problem has not been previously explored. A mixed integer linear programming model is first formulated to simultaneously minimize makespan and total energy consumption. To solve large-scale instances, we propose a knowledge-driven multi-objective memetic algorithm (MMA) tailored to the problem’s characteristics. The MMA incorporates a knowledge-based initialization heuristic and a speed-down strategy that reduces energy consumption without increasing the makespan. Adaptive global optimization operators are designed for hierarchical exploration. Moreover, a two-stage local search strategy, combining a co-evolutionary mechanism with a speed-up heuristic for critical operations, is introduced to enhance solution quality. A diversity mechanism is also employed to prevent premature convergence. Extensive experiments confirm the effectiveness of the proposed MMA in generating a diverse and high-quality set of Pareto-optimal solutions.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"361 2","pages":"923 - 955"},"PeriodicalIF":4.5,"publicationDate":"2026-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148060625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Lifted formulations for the Target Visitation problem 改进了目标访问问题的公式

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-04-11 DOI: 10.1007/s10479-026-07168-z

Ali Balma

{"title":"Lifted formulations for the Target Visitation problem","authors":"Ali Balma","doi":"10.1007/s10479-026-07168-z","DOIUrl":"10.1007/s10479-026-07168-z","url":null,"abstract":"<div><p>In the present paper, we address the target visitation problem, aiming to deliver first-aid medicine and necessary food to regions (called targets) suffering from natural disasters or conflicts. In addition, it has many applications for security and surveillance purposes. It consists of planning the tour of an unmanned aerial vehicle, which visits each target once. The objective considers the mutual priorities between the targets and the respective distances. From a theoretical point of view, the problem combines the traveling salesman and the linear ordering problems. We present formulations adapted and lifted from the literature of the traveling salesman. We enhance two particular models. We apply the lifting technique to the first model, which is related to a well-known node-based formulation. We further strengthen it by carrying out a partial projection of an existing multi-commodity flow formulation of the traveling salesman problem in an extended space. Alternatively, we perform a partial Reformulation-Linearization Technique to the same multicommodity flow-based model and obtain a stronger new formulation. For the latter, we develop a solution approach based on a cutting-plane fashion that successfully provided optimal solutions to all benchmark instances for the first time.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"879 - 914"},"PeriodicalIF":4.5,"publicationDate":"2026-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

New DEA models for business partnerships: evidence from nonhomogeneous banking 商业伙伴关系的新DEA模型：来自非同质银行业的证据

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-04-08 DOI: 10.1007/s10479-026-07167-0

Gholam R. Amin, Mustapha Ibn Boamah

{"title":"New DEA models for business partnerships: evidence from nonhomogeneous banking","authors":"Gholam R. Amin, Mustapha Ibn Boamah","doi":"10.1007/s10479-026-07167-0","DOIUrl":"10.1007/s10479-026-07167-0","url":null,"abstract":"<div><p>Businesses often have resource constraints in their efforts to address market needs, and as a result they seek strategic alliances and various partnerships with other businesses to achieve their shared objectives. Homogeneity among decision making units (DMUs) is assumed in the standard data envelopment analysis (DEA), but there are many real-life situations where DMUs make different set of outputs that nullifies the homogeneity assumption. Moreover, business partnerships may involve DMUs that are nonhomogeneous to achieve synergies, create enhanced value, and improve competitiveness. This paper introduces new DEA models for determining beneficial business partnerships between nonhomogeneous DMUs under input and output orientations. These models reveal the mutual gains of efficiency improvement for participating partners in nonhomogeneous business partnerships by redistributing partners’ resources. The paper also presents a novel application in banking with non homogeneity in products and services, to demonstrate the practicability of the developed DEA models in this study. The findings show how partnerships between banks with nonhomogeneous activities can enhance their efficiency.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"703 - 722"},"PeriodicalIF":4.5,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimizing the vaccine distribution network design problem under uncertainty 不确定条件下疫苗配送网络优化设计问题

IF 4.1 3区管理学

Annals of Operations Research Pub Date : 2026-04-08 DOI: 10.1007/s10479-026-07175-0

Paulina Kus Ariningsih, Chandra Ade Irawan, Antony Paulraj, Jing Dai

{"title":"Optimizing the vaccine distribution network design problem under uncertainty","authors":"Paulina Kus Ariningsih, Chandra Ade Irawan, Antony Paulraj, Jing Dai","doi":"10.1007/s10479-026-07175-0","DOIUrl":"10.1007/s10479-026-07175-0","url":null,"abstract":"<div><p>This paper investigates the vaccine distribution network that is applicable in emerging countries. We propose a two-stage stochastic programming model for the multi-period vaccine network design problem, taking into account uncertain demand, product perishability, flow of products between hubs, and capacity expansion. The model is expressed using a Mixed-Integer Linear Programming model. The primary goal is to minimize the total cost by optimizing the locations of the distribution centers, the optimal period to install storage devices, and the flow of vaccines in the network. The dynamic transmission compartment model (DCM) is used to generate more accurate stochastic demand scenarios in the face of epidemic disruptions. The data preparation algorithm to transform the DCM data into demand scenarios is developed using the <i>k</i>-means clustering method. The proposed two-stage stochastic programming model is solved using the Sample Average Approximation method. The proposed framework for the solution method is assessed using datasets inspired by Indonesia’s COVID-19 vaccination project. Computational experiments demonstrate that the proposed framework obtains good solutions that can be implemented by the relevant stakeholders.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"365 1","pages":"209 - 247"},"PeriodicalIF":4.1,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"149125595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Restaurant revenue management through combinatorial auctions 通过组合拍卖实现餐厅收益管理

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-04-08 DOI: 10.1007/s10479-026-07198-7

Martina Luzzi, Francesca Guerriero, Giusy Macrina, Chefi Triki

{"title":"Restaurant revenue management through combinatorial auctions","authors":"Martina Luzzi, Francesca Guerriero, Giusy Macrina, Chefi Triki","doi":"10.1007/s10479-026-07198-7","DOIUrl":"10.1007/s10479-026-07198-7","url":null,"abstract":"<div><p>Booking a table in some popular restaurants, particularly in certain big cities, is becoming increasingly challenging. The number of requests to eat in those restaurants exceeds the available supply, resulting in a shortage of seating capacity. In recent years, the market for resale of restaurant reservations has emerged as possible solution to this problem. However, this practice does not offer to restaurateurs any protection on the certainty of booking, is unfair to customers, and can lead to a high no-show rate. This work presents an innovative framework for restaurant revenue management, which aims to optimise revenues by managing bookings at restaurants. Particularly, the concept of combinatorial auction is applied to allocate tables and menus to the customers who participate in the auction through a web platform. The winner determination problem is solved in order to assign requests to the bidding customers. Furthermore, a procedure to address the bid generation problem, based on realistic data, is also proposed. The scalability of the model is addressed with an extensive test phase. The applicability of this novel approach is also tested on a real Michelin-starred restaurant. Results of computational experiments suggest that the profitability of this practice has the potential to revolutionize the restaurant reservations sector in the near future.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"360 2-3","pages":"1043 - 1072"},"PeriodicalIF":4.5,"publicationDate":"2026-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07198-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147828614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Agency theory and higher-order risk changes 代理理论与高阶风险变化

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2026-04-07 DOI: 10.1007/s10479-026-07081-5

Claudio A. Bonilla, Hervé Roche, Marcos Vergara

引用次数: 0

Maximin share fair division of a k-uniform hypergraph k-一致超图的最大共享公平分割

IF 4.1 3区管理学

Annals of Operations Research Pub Date : 2026-04-06 DOI: 10.1007/s10479-026-07185-y

Bin Deng, Hao Guo, Weidong Li, Jinwen Ou

引用次数: 0