{"title":"Agricultural supply chain warehousing optimization mechanism based on CBA-NGA in the context of edge computing","authors":"Kaiyang Zhong, Yu Feng, Zehao Wang, Zhiguo Zhong, Yifei Lv","doi":"10.1007/s10479-026-07133-w","DOIUrl":"10.1007/s10479-026-07133-w","url":null,"abstract":"<div><p>With the rapid digitalization of agricultural supply chains, optimizing agricultural warehousing through edge computing has gained increasing attention. This study proposes an edge-enabled predictive optimization mechanism for agricultural product warehousing, combining edge computing and a novel CBA-NGA algorithm. Edge devices are deployed for real-time acquisition and local processing of environmental data—such as temperature, humidity, wind speed, and wind direction—providing immediate feedback for warehouse management. A forecasting model based on the CBA-NGA algorithm is constructed to address inventory loss prediction, improving convergence speed and prediction precision over traditional models. Empirical results show that the model reduces mean squared error (MSE) from 33.5614 to 17.1911, demonstrating substantial performance enhancement. Compared to standard CBA methods, the CBA-NGA model offers better adaptation to complex, nonlinear environmental interactions under edge computing conditions. This research contributes to the literature by integrating CNN-BiLSTM-Attention-based predictive modeling with edge intelligence and NGA-based optimization, providing a scalable and adaptive solution for loss prevention in dynamic agricultural storage environments. The findings have practical implications for improving the efficiency, responsiveness, and sustainability of smart warehousing systems in modern agriculture.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"361 3","pages":"1697 - 1716"},"PeriodicalIF":4.5,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148208725","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}
Amal Sakr, Andrea Araldo, Tijani Chahed, Daniel Kofman
{"title":"Co-investment under revenue uncertainty based on stochastic coalitional game theory","authors":"Amal Sakr, Andrea Araldo, Tijani Chahed, Daniel Kofman","doi":"10.1007/s10479-026-07222-w","DOIUrl":"10.1007/s10479-026-07222-w","url":null,"abstract":"<div><p>The introduction of new services, such as Mobile Edge Computing (MEC), requires a massive investment that cannot be assumed by a single stakeholder, for instance the Infrastructure Provider (<i>InP</i>). Service Providers (SPs) however also have an interest in the deployment of such services. We hence propose a co-investment scheme in which all stakeholders, i.e., the <i>InP</i> and the SPs, form the so-called grand coalition composed of all the stakeholders with the aim of sharing costs and revenues and maximizing their payoffs. The challenge comes from the fact that future revenues are uncertain. We devise in this case a novel stochastic coalitional game formulation which builds upon robust game theory and derive a lower bound on the probability of the stability of the grand coalition, wherein no player can be better off outside of it. In the presence of highly dependent fluctuations of revenues however, stability can be too conservative. In this case, we make use also of profitability, in which payoffs of players are non-negative, as a necessary condition for co-investment, and we derive a lower bound on the probability that co-investment is profitable. The proposed framework is showcased for MEC deployment, where computational resources need to be deployed in nodes at the edge of a telecommunication network. Numerical results show high lower bound on the probability of stability when the SPs’ revenues are of similar magnitude, even with high levels of uncertainty. In the case where revenues are highly variable however, the lower bound on stability can be trivially low whereas co-investment is still profitable.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"362 1-3","pages":"293 - 355"},"PeriodicalIF":4.1,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148394905","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}
{"title":"Optimizing accuracy and diversity: a multi-task approach to forecast combinations","authors":"Giovanni Felici, Antonio M. Sudoso","doi":"10.1007/s10479-026-07291-x","DOIUrl":"10.1007/s10479-026-07291-x","url":null,"abstract":"<div><p>We present a multi-task optimization approach based on a deep learning architecture for time series forecasting. We leverage large collections of time series to identify the weights of forecasting models that can be combined to produce forecasts for each series. This method jointly addresses two tasks: the selection of different forecasting models, and their effective combination. In doing so, it keeps into account, in an original way, both the accuracy and diversity of the forecasting methods. For a given time series, the model combination module extracts features and uses them to optimize the weights of the forecasting methods. Simultaneously, the model selection module extracts other features to identify the subset of methods to be used for the prediction. This selection process is framed as a classification problem, with the labels representing the set of models to be used for a series. These labels are determined by solving an auxiliary optimization problem that identifies accurate and diverse methods for each time series. The outputs of the two modules are then combined and the entire neural network is jointly trained by minimizing a custom loss function via gradient descent optimization. Experimental results on a large set of series from the M4 competition dataset and from real road traffic data show that our proposal enhances point forecast accuracy compared to state-of-the-art methods.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"362 1-3","pages":"493 - 520"},"PeriodicalIF":4.1,"publicationDate":"2026-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07291-x.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148394797","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}
Zhenkun Liu, Koen W. De Bock, Lifang Zhang, Jianzhou Wang, Liang Liang
{"title":"A heterogeneous ensemble learning framework for detecting acute viral respiratory infections via multisource data fusion","authors":"Zhenkun Liu, Koen W. De Bock, Lifang Zhang, Jianzhou Wang, Liang Liang","doi":"10.1007/s10479-026-07264-0","DOIUrl":"10.1007/s10479-026-07264-0","url":null,"abstract":"<div><p>Acute viral respiratory infections (AVRIs), including COVID-19 and SARS, present ongoing public health challenges. Traditional diagnostic methods often rely on limited inputs—typically cough or speech sounds—rarely incorporate self-reported symptoms, and still require clinical visits or medical imaging, leading to higher costs and increased exposure risks. To support affordable, contact-free self-testing, we introduce the heterogeneous ensemble framework with multisource data fusion mechanism. This framework integrates respiratory, cough, and speech audio data with self-reported information. Within this system, deep learning models are employed to extract and analyze audio features for estimating infection probability, while conventional machine learning classifiers handle the self-reported data. Finally, predictions from both data types are combined using a meta-learning strategy to enhance overall detection performance. Experiments on COVID-19 detection validate the proposed framework, and the interpretability analysis reveals the critical predictive features and classifiers. This multisource fusion strategy also provides a transferable foundation for detecting other AVRIs.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"362 1-3","pages":"521 - 551"},"PeriodicalIF":4.1,"publicationDate":"2026-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148394752","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}
{"title":"A coalitional extension of the ordinal Shapley-Shubik value","authors":"Alfredo Valencia-Toledo, Juan Vidal-Puga","doi":"10.1007/s10479-026-07287-7","DOIUrl":"10.1007/s10479-026-07287-7","url":null,"abstract":"<div><p>In cooperative game theory it is known that two-person bargaining problems have no relevant ordinal solution. For three-player bargaining problems, Shapley and Shubik propose an ordinal rule. However, this rule does not take into account the worth of proper subcoalitions of size 2. In this paper, we fill this gap by proposing a generalization of the Shapley-Shubik rule for non transferable utility games. The resulting solutions, when applied to transferable utility games, always belong to the core, which makes it a relevant alternative to other core-selectors such as the nucleolus. We also apply the new solution to a practical case related to mining and natural resources management.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"362 1-3","pages":"399 - 416"},"PeriodicalIF":4.1,"publicationDate":"2026-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07287-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148394931","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}
Serguei Maximov, Jose G. Tirado-Serrato, Margarita J. Toledo-Vazquez, Alfredo Sanchez
{"title":"Analytic renewal equation solutions for polynomial-hazard models: explicit construction and error bounds","authors":"Serguei Maximov, Jose G. Tirado-Serrato, Margarita J. Toledo-Vazquez, Alfredo Sanchez","doi":"10.1007/s10479-026-07258-y","DOIUrl":"10.1007/s10479-026-07258-y","url":null,"abstract":"<div><p>This paper develops an analytic solution framework for renewal equations arising from lifetime distributions with polynomial cumulative hazard functions. The approach builds on a recently developed inference framework for such models, enabling a consistent transition from parameter estimation to dynamic reliability analysis. Recasting the renewal equation using a zero-mass kernel yields a constructive representation of the renewal density. We show that the solution admits a decomposition into an explicit baseline term and a finite polynomial correction multiplied by the survival function. The correction coefficients are obtained from a lower-triangular linear system, providing a computable alternative to classical series expansions. A uniform error bound with stretched-exponential decay is established, together with a principled criterion for selecting the polynomial order. A case study involving circuit breaker reliability, based on Weibull parameters reported in the literature, demonstrates that the analytic approximation <b>closely matches numerical</b> convolution-based solutions while enabling efficient evaluation in maintenance cost calculations. The proposed framework provides a tractable analytic alternative to numerical methods and supports repeated evaluation scenarios arising in reliability analysis and maintenance planning.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"364 3","pages":"3131 - 3175"},"PeriodicalIF":4.1,"publicationDate":"2026-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148965328","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}
Chenhao Zhou, Xin Ding, Weiwei Chen, Lei Lei, Jacqueline Norrell, Alison Tray, Andrew M. Evens
{"title":"Enhancing efficiency and workflow in oncology outpatient services through simulation-based optimization","authors":"Chenhao Zhou, Xin Ding, Weiwei Chen, Lei Lei, Jacqueline Norrell, Alison Tray, Andrew M. Evens","doi":"10.1007/s10479-026-07181-2","DOIUrl":"10.1007/s10479-026-07181-2","url":null,"abstract":"<div><p>Outpatient chemotherapy clinics face rising demand and growing patient dissatisfaction, creating pressures to improve efficiency while sustaining quality care. This study uses an agent-based simulation of a National Cancer Institute (NCI)-designated cancer center’s infusion clinic to evaluate the effectiveness of three proposed operational changes: setting up an on-site laboratory, adapting nurse staffing based on anticipated demand increases, and balancing appointment scheduling via simulation optimization. The model, calibrated with historical data, tracks patient visit length and nurse utilization. Our study shows that combining an on-site lab with optimized scheduling reduces average visit length by about 75–90 minutes (approximately 30%) under various demand levels, smoothing workflow peaks. The study also shows that modest increases in nursing staff ensure timely patient throughput with 7–10% decreases in nurse utilization. Joint implementation of these operational changes outperforms individual changes, highlighting important synergies and the value of an integrated operations strategy. Overall, the study demonstrates a generalizable simulation-based framework to guide oncology process redesign and strategic decisions such as capacity expansion or facility relocation.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"362 1-3","pages":"457 - 482"},"PeriodicalIF":4.1,"publicationDate":"2026-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07181-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148394773","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}
{"title":"A coupled task scheduling approximation algorithm for minimizing the sum of completion times","authors":"József Békési, György Dósa, Gábor Galambos","doi":"10.1007/s10479-026-07261-3","DOIUrl":"10.1007/s10479-026-07261-3","url":null,"abstract":"<div><p>In the considered coupled task problem (CTP) we have to schedule <i>n</i> jobs on a single machine, each consisting of two tasks with exact time delay between them, while the objective is to minimize the total completion time of the jobs. We analyze a greedy type algorithm – called <i>SDF</i> (Shortest Delay First) – from worst case point of view, and we give bounds for the asymptotic behavior of SDF for the special case where each task has equal length processing time <i>p</i>. For this case, the best-known upper bound on the asymptotic performance ratio of algorithm SDF is <span>(frac{5}{3}approx 1.666ldots .)</span> We improve this bound to a general upper bound <span>(frac{21p-sqrt{3(43p^2-28p+4)}-6}{6p})</span> that holds for all <span>(pge 2.)</span> Using constructions to compute lower bounds, we give narrow intervals for the asymptotic behavior of algorithm SDF as a function of the parameter <i>p</i>.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"362 1-3","pages":"1 - 26"},"PeriodicalIF":4.1,"publicationDate":"2026-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-026-07261-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148394756","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}
{"title":"Interval extensions of the Owen value in a cooperative game with a coalition structure and augmenting system","authors":"Jing Liu, Xiaohui Yu, Shiyan Lu","doi":"10.1007/s10479-026-07253-3","DOIUrl":"10.1007/s10479-026-07253-3","url":null,"abstract":"<div><p>In a cooperative game with a coalition structure and augmenting system (CAS game), players within each priori union are restricted by an augmenting system. Some worths of coalitions (infeasible coalitions) are unknown, such as coalitions across multiple priori unions and certain sub-coalitions within each priori union. By regarding a CAS game as an incomplete information game, we evaluate unknown worths of infeasible coalitions through feasible coalitions, obtaining both the lower and upper worths of infeasible coalitions. Therefore, the interval Owen-augmenting value is proposed, which is an extension of the Owen value. By setting the Harsanyi dividends of unformed coalitions to zero, we introduce another value (i.e., the restricted Owen-augmenting value). Furthermore, we prove that the restricted Owen-augmenting value is a special case of the interval Owen-augmenting value. All proposed values can be used to solve a CAS game.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"362 1-3","pages":"219 - 246"},"PeriodicalIF":4.1,"publicationDate":"2026-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148394929","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}