Annals of Operations Research最新文献

{"title":"Fresh agricultural products logistics network optimization incorporating departure time under the origin e-commerce model","authors":"Qunli Yuchi,&nbsp;Wenjing Liao,&nbsp;Juhong Chen","doi":"10.1007/s10479-025-06622-8","DOIUrl":"10.1007/s10479-025-06622-8","url":null,"abstract":"<div><p>This paper focuses on the design and optimization of the logistics network for fresh agricultural products (FAPs) e-commerce under the new origin e-commerce model. Compared to previous research, it specifically addresses the continuous and non-uniform character of orders and optimizes the departure time of vehicles. The objective is to reduce consumer waiting time costs, FAPs' quality loss costs, and logistics-related costs. We proposed a customized heuristic algorithm to solve the model and determined through numerical testing that the logistics plan with the optimal departure time is better than the fixed departure time logistics plan. Furthermore, comprehensive sensitivity analyses demonstrate that adjusting key cost parameters within feasible thresholds can offset their individual impacts on total cost, thereby maintaining cost stability. Logistics efficiency can only be constantly improved to lower time penalty costs, since it is more difficult to reduce costs connected to customer time satisfaction by coordinating other expenditures.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"349 3","pages":"1957 - 1984"},"PeriodicalIF":4.5,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145160662","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":"Social optimum in public transport networks when users choose strategies: analysis and comparison with Wardrop equilibrium","authors":"Victoria M. Orlando,&nbsp;Iván L. Degano,&nbsp;Pablo A. Lotito","doi":"10.1007/s10479-025-06604-w","DOIUrl":"10.1007/s10479-025-06604-w","url":null,"abstract":"<div><p>The effective design and management of public transport systems are essential to ensuring the best service for users. The performance of a transport system will depend heavily on users behavior and decisions. Generally, users have individual objectives, such as seeking to minimize their own travel time. These decisions can affect the performance of the entire system, making it inefficient. A measure that allows to quantify the inefficiency of the system in the face of non-cooperative behavior is the price of anarchy. Our objective is to investigate the price of anarchy in the common-lines problem. In this approach, users choose which lines to use based on the best strategy for them. While Wardrop equilibrium has been studied for the common-lines problem, no contributions have been made toward the social optimum. In this work, we propose two optimization problems to obtain this optimum on simple networks, using strategy flow and line flow formulations. In addition, we prove that both optimization problems are equivalent, and we obtain a characterization of the social optimum flows. These contributions allow us to obtain results about the behavior of the price of anarchy in simple networks as demand increases.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"349 3","pages":"1785 - 1815"},"PeriodicalIF":4.5,"publicationDate":"2025-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145170010","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":"Black–Litterman portfolio optimization based on GARCH–EVT–Copula and LSTM models","authors":"Vu Huynh,&nbsp;Bao Quoc Ta","doi":"10.1007/s10479-025-06597-6","DOIUrl":"10.1007/s10479-025-06597-6","url":null,"abstract":"<div><p>In constructing diversified portfolios, the investors might be interested in incorporating some quantifiable views or opinions. The Black–Litterman model is a useful approach to integrate investors’ views into the Markowitz allocation model. In this paper we utilize a deep learning model to estimate the investors’s views and use GARCH–EVT–Copula to model the dependence structure between stock market returns in a large portfolio. The findings show that the Black–Litterman model for portfolio optimization based on GARCH–EVT–Copula and LSTM (Long Short Term Memory) models gives better performances as compared with the traditional max-Sharpe and the original Black–Litterman portfolio problems.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"349 3","pages":"1693 - 1715"},"PeriodicalIF":4.5,"publicationDate":"2025-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145167550","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 guaranteed service model with continuous review (r,Q) policy","authors":"Abderrahim Bendadou,&nbsp;Yacine Rekik,&nbsp;Rim Kalaï,&nbsp;Zied Jemai","doi":"10.1007/s10479-025-06550-7","DOIUrl":"10.1007/s10479-025-06550-7","url":null,"abstract":"<div><p>This paper introduces a generalized Guaranteed Service Model (GSM) for production systems that operates under a continuous review inventory control policy (r,Q). The model incorporates dependencies between processing time and order quantity, as well as controllable setup times, offering a more realistic framework for inventory management. The optimization problem is formulated as a non-linear integer programming problem with a non-convex objective function. To solve this, we propose a hybrid approach that combines the Difference of Convex functions Algorithm (DCA) with a heuristic adjustment technique, enabling efficient computation of high-quality solutions. Numerical experiments demonstrate the effectiveness of the proposed method, achieving competitive performance compared to the Baron solver in terms of cost minimization.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"351 1","pages":"883 - 901"},"PeriodicalIF":4.5,"publicationDate":"2025-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145168127","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":"Data driven operational risk management","authors":"Sai-Ho Chung,&nbsp;Stein W. Wallace,&nbsp;Xin Wen","doi":"10.1007/s10479-025-06598-5","DOIUrl":"10.1007/s10479-025-06598-5","url":null,"abstract":"<div><p>Operational risks exist everywhere. With fast changes in the real world, traditional risk management measures become insufficient. Instead, the importance of data-driven approaches increases dramatically. In this special issue, we collect high quality papers on different aspects of operational risk management with data analytics. Both theoretical issues and application results are included. The publications collected cover a wide range of research topics, like the value of blockchains towards risk management in high-tech manufacturing, the convex risk measures for solving risk-averse multistage stochastic programs, the balanced weighted extreme learning machine method for imbalance learning of credit default risk and manufacturing productivity, etc. The insights generated from this special issue can provide crucial guidelines for both the academia and the industry regarding risk management with the support of data analytics.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"348 2","pages":"777 - 781"},"PeriodicalIF":4.4,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06598-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143938630","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":"Business Failure Prediction From Textual and Tabular Data With Sentence-Level Interpretations","authors":"Henri Arno,&nbsp;Klaas Mulier,&nbsp;Joke Baeck,&nbsp;Thomas Demeester","doi":"10.1007/s10479-025-06574-z","DOIUrl":"10.1007/s10479-025-06574-z","url":null,"abstract":"<div><p>Business failure prediction models are crucial in high-stakes domains like banking, insurance, and investing. In this paper, we propose an interpretable model that combines numerical and sentence-level textual features through a well-known attention mechanism. Our model demonstrates competitive performance across various metrics, and the attention weights help identify sentences intuitively linked to business failure, offering a form of interpretability. Furthermore, our findings highlight the strength of traditional financial ratios for business failure prediction while textual data—particularly when represented as keywords—is mainly useful to correctly classify corporate disclosures where the possibility of failure is explicitly mentioned.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"353 2","pages":"667 - 692"},"PeriodicalIF":4.5,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06574-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145296820","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":"Management science in the age of the internet and digital revolution","authors":"Rameshwar Dubey,&nbsp;Pierre-Luc Fournier,&nbsp;Daniel Jugend,&nbsp;David J. Bryde,&nbsp;Gary Graham,&nbsp;Cyril Foropon","doi":"10.1007/s10479-025-06608-6","DOIUrl":"10.1007/s10479-025-06608-6","url":null,"abstract":"<div><p>This special issue was organized to explore the impact of the internet and digital revolution on the field of management science (MS). Our goal was to highlight the scientific developments that have reshaped management practices and methodologies, enabling organizations to effectively navigate the increasingly complex challenges they encounter in today’s fast-paced environment. We received high-quality submissions from diverse contributors, which illustrate the broad interest and relevance of this topic. After a rigorous and thorough peer review, we successfully published 31 insightful articles. Each article provides a valuable perspective, contributing not only to theoretical frameworks but also to practical applications across various industries. This comprehensive collection serves as an essential resource, enriching the knowledge base for both scholars and practitioners in MS.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"348 3","pages":"1109 - 1125"},"PeriodicalIF":4.4,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143938721","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":"Refrigerated electric vehicle routing considering time-dependent temperature energy consumption models","authors":"Cesar David Osorio-Castañeda,&nbsp;Juan Pablo Orejuela-Cabrera,&nbsp;Juan José Bravo-Bastidas","doi":"10.1007/s10479-025-06579-8","DOIUrl":"10.1007/s10479-025-06579-8","url":null,"abstract":"<div><p>This paper introduces a novel model integrating the Traveling Salesman Problem (TSP) with time-dependent cooling energy consumption, considering external temperature variations and including an optimal route start time decision variable to enhance management capacity. Perishable items like fresh food and life science products require efficient cold chain logistics, and using zero-emission electric vehicles offers an eco-friendly alternative but with operational challenges, particularly in energy efficiency and battery autonomy. The main aim of this research is to show that introducing temperature as a time-dependent variable in route design offers a more accurate approximation of energy consumption in a refrigerated fleet that is primarily influenced by the internal–external temperature differential. Results show that considering time-dependent temperature variations provides more accurate refrigeration consumption estimates, with differences up to 16% compared to average temperature models. Refrigeration accounts for about 44% of total energy consumption, with product load and infiltration contributing 80% and 17%, respectively. Optimizing these consumptions significantly alters route planning, highlighting the importance of time-dependent temperature in effective logistics management.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"349 3","pages":"1817 - 1854"},"PeriodicalIF":4.5,"publicationDate":"2025-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06579-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145164085","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":"Two simplex-based approximate stochastic dynamic programming schemes for a real hydropower management problem","authors":"Luckny Zephyr,&nbsp;Bernard F. Lamond,&nbsp;Kenjy Demeester,&nbsp;Marco Latraverse","doi":"10.1007/s10479-025-06561-4","DOIUrl":"10.1007/s10479-025-06561-4","url":null,"abstract":"<div><p>We present an approximate stochastic dynamic programming methodology for a real-world hydropower management problem, in which water must be released from reservoirs to produce electricity to power aluminum smelters over a planning horizon of a year (three-day time step). In each period, decisions are constrained by limits on the releases and the level of the four reservoirs, among others. The approach is a revisit of our previous work on simplicial approximate stochastic dynamic programming, in which the so-called cost-to-go or value functions are approximated over grid points chosen as vertices of simplices. The latter are constructed by first partitioning the reservoir level space into simplices and then iteratively subdividing existing simplices until a desired approximation error or a fixed number of grid points is reached. For each simplex, the approximation error is given by the difference between an upper and a lower bound. This scheme requires storing the list of created simplices in memory. In each iteration, the list is searched to find the existing simplex with the highest approximation error. This may be time-consuming as the number of existing simplices may be very large. In the new proposal, we avoid creating a long list of simplices by combining the original simplicial scheme with Monte Carlo simulation, similar to an exploration strategy in reinforcement learning. We benchmark the new method against its ancestor and an internal software package developed and used by an industrial partner, based on operational metrics and the concept of super-efficiency in data envelopment analysis. The Monte Carlo simplex-based scheme (the new method) outperforms the former method on all metrics considered. In addition, we compare the computational efficiency of both methods for different grid sizes. The average CPU time (over 15 replications) of the Monte Carlo simplicial approach varies between 78% and 98% of that of the simplicial method. As the grid sizes increase above 3,000 points, the simplicial method becomes intractable, in contrast to the Monte Carlo version, which confirms the advantage of the latter. Lastly, to further justify the Monte Carlo simplicial method, we create an artificial system by duplicating each component of the original system. In contrast to the new proposal, under the simplicial approach, the problem is tractable only for relatively modest size grids (up to 1,500 points), for which the average CPU time under the Monte Carlo approach varies between 2% and 5% of that of its simplicial counterpart.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"351 1","pages":"333 - 364"},"PeriodicalIF":4.5,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145163740","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":"New trends and recent developments in OR techniques for sustainability, environment and social transition in economics and finance","authors":"Ramzi Benkraiem,&nbsp;Stéphane Goutte,&nbsp;Khaled Guesmi,&nbsp;Constantin Zopounidis","doi":"10.1007/s10479-025-06562-3","DOIUrl":"10.1007/s10479-025-06562-3","url":null,"abstract":"","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"347 1","pages":"1 - 12"},"PeriodicalIF":4.5,"publicationDate":"2025-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145121615","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}