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

On random weighted coherent systems based on a new structure-based performance measure 基于结构的随机加权相干系统性能评价

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-23 DOI: 10.1007/s10479-025-06663-z

Tanmay Sahoo, Nil Kamal Hazra, Narayanaswamy Balakrishnan

{"title":"On random weighted coherent systems based on a new structure-based performance measure","authors":"Tanmay Sahoo, Nil Kamal Hazra, Narayanaswamy Balakrishnan","doi":"10.1007/s10479-025-06663-z","DOIUrl":"10.1007/s10479-025-06663-z","url":null,"abstract":"<div><p>The performance level of a random weighted <i>r</i>-out-of-<i>n</i> system is measured by its total capacity. However, this measure is not meaningful for an arbitrary coherent structure as it does not involve the structure of the system. To overcome this drawback, we introduce here a new notion of performance measure (namely, the structural capacity) and then define three different notions of random weighted coherent systems, namely, Type-I, Type-II and Type-III systems. We then derive explicit formulas for computing the reliabilities of these systems. We further give a signature-based reliability representation for these systems. Further, we derive the Birnbaum marginal and joint reliability importance measures for the components of these systems and subsequently provide an algorithm for computing the same. Then, we study several ordering results based on these importance measures. For the Type-III random weighted coherent system, we introduce a new structure-based weighted importance measure and provide an algorithm for its evaluation. The developed results are illustrated through several numerical examples. Finally, we carry out the reliability estimation for a random weighted coherent system using two different simulated data sets.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"350 3","pages":"1169 - 1206"},"PeriodicalIF":4.5,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145167713","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 queueing model for time-dependent rental systems with phase-type distributed rentals and substitutions of items 具有阶段型分布式租赁和物品替换的时间依赖租赁系统的排队模型

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-21 DOI: 10.1007/s10479-025-06645-1

Anders Reenberg Andersen

{"title":"A queueing model for time-dependent rental systems with phase-type distributed rentals and substitutions of items","authors":"Anders Reenberg Andersen","doi":"10.1007/s10479-025-06645-1","DOIUrl":"10.1007/s10479-025-06645-1","url":null,"abstract":"<div><p>Society currently experiences a growing interest in renting as an alternative to exclusive ownership (Fota et al., 2019; Yeganeh, 2021). This paper supports rental companies in this transition by providing a method to evaluate rental system occupancy. The method considers time-dependent systems in which customers rent substitutes during stockouts. Specifically, the paper provides a queueing model based on a continuous-time Markov chain for systems where rentals occur according to Poisson processes and rental times follow phase-type distributions. Additionally, the paper provides a heuristic optimization algorithm to minimize inventory capacity while maintaining an upper stockout probability limit. The paper evaluates these methods through numerical experiments, including a company case. The results indicate that the queueing model adequately reflects the occupancy distributions of the investigated items, and that the optimization algorithm minimizes the inventory capacity to near-optimality. In the company case, these methods reduce the inventory capacity while simultaneously improving the maximum stockout probability.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"350 3","pages":"1143 - 1167"},"PeriodicalIF":4.5,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06645-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145168537","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

Machine learning approach to stock price crash risk 股票价格崩盘风险的机器学习方法

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-20 DOI: 10.1007/s10479-025-06596-7

Abdullah Karasan, Ozge Sezgin Alp, Gerhard-Wilhelm Weber

引用次数: 0

Covering a square with consecutive squares 用连续的正方形覆盖一个正方形

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-20 DOI: 10.1007/s10479-025-06633-5

Janos Balogh, Gyorgy Dosa, Lars Magnus Hvattum, Tomas Attila Olaj, Istvan Szalkai, Zsolt Tuza

{"title":"Covering a square with consecutive squares","authors":"Janos Balogh, Gyorgy Dosa, Lars Magnus Hvattum, Tomas Attila Olaj, Istvan Szalkai, Zsolt Tuza","doi":"10.1007/s10479-025-06633-5","DOIUrl":"10.1007/s10479-025-06633-5","url":null,"abstract":"<div><p>In this article we address the following problem. Given are a <span>(1times 1)</span> square, a <span>(2times 2)</span> square, and so on, finally a <span>(ntimes n)</span> square. What is the biggest square that can be <i>covered</i> completely by this given set of “small” squares? It is assumed that the small squares must stand parallel to the sides of the big square, and overlap is allowed. In contrast to the <i>packing</i> version of the problem (asking for the smallest square that can accommodate all small squares without overlap) which has been studied in several papers since the 1960’s, the covering version of the problem seems new. We construct optimal coverings for small values of <i>n</i>. For moderately bigger <i>n</i> values we solve the problem optimally by a commercial mathematical programming solver, and for even bigger <i>n</i> values we give a heuristic algorithm that can find near optimal solutions. We also provide an expansion-algorithm, that from a given good cover using consecutive squares up to size <i>n</i>, can generate a cover for a larger square using small squares up to size <span>(n+1)</span>. Finally we prove that a simple covering policy can generate an asymptotically optimal covering.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"350 3","pages":"911 - 926"},"PeriodicalIF":4.5,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06633-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145167887","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

An integrated approach for enhancing operating room management: capacity planning, fair scheduling, and surgeon resilience 加强手术室管理的综合方法：能力规划、公平调度和外科医生弹性

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-20 DOI: 10.1007/s10479-025-06565-0

Vahid Kayvanfar, Roberto Baldacci, Kannan Govindan

{"title":"An integrated approach for enhancing operating room management: capacity planning, fair scheduling, and surgeon resilience","authors":"Vahid Kayvanfar, Roberto Baldacci, Kannan Govindan","doi":"10.1007/s10479-025-06565-0","DOIUrl":"10.1007/s10479-025-06565-0","url":null,"abstract":"<div><p>In the realm of operating room management (ORM), several key challenges loom large, including the reduction of overtime and idle time for surgeons, avoiding overutilization and underutilization of ORs, and the equitable allocation of patients to surgeons to mitigate workload pressures. Moreover, the potential disruption risks associated with surgeons can lead to surgery cancellations. This research presents a comprehensive framework for addressing these challenges through a unified approach encompassing capacity planning and equitable scheduling within surgery departments. An essential component of this approach involves the identification of backup surgeons to minimize the surgery cancellations risk attributable to surgeon unavailability. The capacity planning phase is executed in the initial stage, leveraging Markovian queueing systems to optimize resource allocation. In the second stage, a resilient scheduling model is introduced, considering the equitable assignment of patients to surgeons. This scheduling model is developed using a goal programming approach and is solved efficiently using a novel decomposition-based heuristic method designed to expedite the optimal solution attainment. To validate the efficacy of this innovative approach, a real-world case study is undertaken, showcasing its practical application and demonstrating its proficiency in addressing the complex challenges inherent in ORM, followed by some valuable managerial insights. By implementing the proposed approach, the optimal number of operating rooms is obtained from the preceding queueing model in the capacity planning phase, and the effect of changing surgeon numbers is analyzed. Results show that optimizing unit capacity improves surgery scheduling and demonstrates the proposed framework’s efficiency.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"350 3","pages":"1385 - 1412"},"PeriodicalIF":4.5,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06565-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145167886","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

Modeling and solving an integrated periodic vehicle routing and capacitated facility location problem in the context of solid waste collection 固体废物收集环境下集成周期车辆路径和可容设施选址问题的建模与求解

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-18 DOI: 10.1007/s10479-025-06626-4

Begoña González, Diego Rossit, Mariano Frutos, Máximo Méndez

{"title":"Modeling and solving an integrated periodic vehicle routing and capacitated facility location problem in the context of solid waste collection","authors":"Begoña González, Diego Rossit, Mariano Frutos, Máximo Méndez","doi":"10.1007/s10479-025-06626-4","DOIUrl":"10.1007/s10479-025-06626-4","url":null,"abstract":"<div><p>Few activities are as crucial in urban environments as waste management. Mismanagement of waste can cause significant economic, social, and environmental damage. However, waste management is often a complex system to manage and therefore where computational decision-support tools can play a pivotal role in assisting managers to make faster and better decisions. In this sense, this article proposes, on the one hand, a unified optimization model to address two common waste management system optimization problem: the determination of the capacity of waste bins in the collection network and the design and scheduling of collection routes. The integration of these two problems is not usual in the literature since each of them separately is already a major computational challenge. Two improved exact formulations based on mathematical programming and two metaheuristic methods are provided to solve this proposed unified optimization model. It should be noted that the metaheuristics consider a mixed chromosome representation of the solutions combining binary and integer alleles, in order to solve realistic instances of this complex problem. Different parameters of the metaheuristics considered – a Genetic Algorithm and a Simulated Annealing algorithm – have been tested to study which combination of them obtained better results in execution times on the order of that of the exact solvers. The achieved results show that the proposed metaheuristic methods perform efficient on large instances, where exact formulations are not applicable, and offer feasible, high-quality solutions in reasonable calculation times.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"350 3","pages":"979 - 1015"},"PeriodicalIF":4.5,"publicationDate":"2025-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-025-06626-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145166428","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

Technology choices for polluting firms in China: the synergy between digital transformation and green transformation 中国污染企业的技术选择：数字化转型与绿色转型的协同效应

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-13 DOI: 10.1007/s10479-025-06642-4

Qianxiang Zhang, Boqiang Lin

{"title":"Technology choices for polluting firms in China: the synergy between digital transformation and green transformation","authors":"Qianxiang Zhang, Boqiang Lin","doi":"10.1007/s10479-025-06642-4","DOIUrl":"10.1007/s10479-025-06642-4","url":null,"abstract":"<div><p>Optimizing technology management for polluting firms is crucial for pollution control and climate change mitigation. In contrast to the extensive research on green innovation, technical renovation has often been overlooked, and the influence of digital technology remains ambiguous. Using a dataset of Chinese polluting industries, we employ the panel fixed effect model. Our findings are as follows: (1) When confronted with local environmental governance pressure, firms tend to rely more on technical renovation. Nevertheless, small-scale firms and those located in the eastern provinces demonstrate a markedly weaker response; (2) In exploring the underlying causes, we find that local environmental governance pressure exacerbates the financing constraints of small-scale firms. For firms in the eastern provinces, empirical evidence suggests that they have embarked on the path of independent innovation by accumulating the achievements of technical renovation; (3) Further analysis reveals a synergistic effect between digital transformation and green transformation, which implies that the integration of digital technologies can accelerate the green transformation process of polluting firms. Our findings provide targeted policy implications for optimizing technology management for polluting firms.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"350 3","pages":"1363 - 1383"},"PeriodicalIF":4.5,"publicationDate":"2025-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145165968","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

Optimal selling price and replenishment time with a limited-time free trial 最优的销售价格和补货时间，限时免费试用

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-12 DOI: 10.1007/s10479-025-06564-1

Lin Feng, Konstantina Skouri, Ya-Lan Chan

{"title":"Optimal selling price and replenishment time with a limited-time free trial","authors":"Lin Feng, Konstantina Skouri, Ya-Lan Chan","doi":"10.1007/s10479-025-06564-1","DOIUrl":"10.1007/s10479-025-06564-1","url":null,"abstract":"<div><p>Nowadays, online stores have become the choice markets for consumers. However, a main disadvantage of this choice is that consumers hardly have opportunities to inspect the product. So, a free trial period could be used as a marketing tool giving prospective customers the ability to evaluate and inspect the products before making their orders. Hence, the disadvantage of lack of product experience diminishes, contributing to sales increase. In addition, pricing is a well-known powerful and effective marketing tool towards increasing sales. As a result, pricing and free trials are two of the most powerful and effective marketing tools to increase sales and profitability. Nevertheless, in inventory management literature, the studies on the joint impact of free trial and selling price are rarely seen. Within the EOQ framework, we propose a model, in which the seller has the ability to determine whether to offer free trials or not, and then to decide the optimal selling price and replenishment cycle so that the total profit is maximized. Furthermore, we establish several theoretical results and try to answer the following important and relevant questions: (1) the conditions under which the seller should offer a free trial to prospective customers, (2) the impact of a free trial offer on the replenishment cycle and selling price, and (3) the influence of price elasticity on the selling price and order quantity. Finally, through sensitivity analysis we study the effect of several parameters on the optimal solution.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"349 3","pages":"1639 - 1661"},"PeriodicalIF":4.5,"publicationDate":"2025-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145164947","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

An extrapolation trust-region alternating least-squares algorithm for triple decomposition of third-order tensors 三阶张量三重分解的外推信赖域交替最小二乘算法

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-11 DOI: 10.1007/s10479-025-06614-8

Xuejuan Zhang, Jinling Zhao

{"title":"An extrapolation trust-region alternating least-squares algorithm for triple decomposition of third-order tensors","authors":"Xuejuan Zhang, Jinling Zhao","doi":"10.1007/s10479-025-06614-8","DOIUrl":"10.1007/s10479-025-06614-8","url":null,"abstract":"<div><p>Triple decomposition, which is a novel decomposition for the third order tensors, decomposes a third order tensor into a product of three third order low rank tensors. Alternating least-squares (ALS) is one of the most commonly used algorithms for tensor decomposition. In this paper, we combined the trust region method with the ALS algorithm to establish an extrapolation trust-region alternating least-squares algorithm for triple decomposition (TD-ETRALS). Different from the fixed regularization parameters in the modified alternating least-squares method (EMALS), TD-ETRALS adjusts the trust-region parameters in each iteration to achieve the preset accuracy of triple decomposition faster and more accurately. Theoretically, we prove that the sequence generated by TD-ETRALS converges to a critical point. Numerical experiments show that TD-ETRALS preforms better than EMALS in triple decomposition for the tensors generated by a uniform distribution in the relatively narrow interval and the tensors with Gaussian noise. In the example of image processing, TD-ETRALS also shows some advantages in low rank decomposition.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"349 3","pages":"1933 - 1955"},"PeriodicalIF":4.5,"publicationDate":"2025-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145165183","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

Biased random-key genetic algorithms for the weighted minimum broadcast time problem 加权最小广播时间问题的有偏随机密钥遗传算法

IF 4.5 3区管理学

Annals of Operations Research Pub Date : 2025-05-09 DOI: 10.1007/s10479-025-06609-5

Alfredo Lima, Luiz Satoru Ochi, Bruno Nogueira, Rian G. S. Pinheiro

引用次数: 0