Annals of Operations Research最新文献

Digital manufacturing and supply chain: creating benefits through operations research and artificial intelligence 数字化制造和供应链：通过运筹学和人工智能创造效益

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-03 DOI: 10.1007/s10479-024-06450-2

Weiwei Chen, Tsan-Ming Choi, Alexandre Dolgui, Dmitry Ivanov, Erwin Pesch

引用次数: 0

Correction: Should we keep the tradition or follow the trend? The optimal live-streaming e-commerce mode selection in a sustainable and circular supply chain under competition 更正：我们应该保持传统还是跟随潮流？竞争环境下可持续循环供应链中直播电子商务模式的优化选择

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2024-12-11 DOI: 10.1007/s10479-024-06427-1

Junbin Wang, Yangyan Shi, Victor Shi, V. G. Venkatesh

引用次数: 0

Still more surveys in operations research… 更多运筹学调查...

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2024-12-09 DOI: 10.1007/s10479-024-06393-8

Yves Crama, Michel Grabisch, Silvano Martello

引用次数: 0

Supply disruptions and the problem of pricing, advertising, and sourcing strategies in a retail duopoly market 供应中断和定价问题，广告，和采购策略在零售双寡头垄断市场

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2024-12-06 DOI: 10.1007/s10479-024-06314-9

Reza Maihami, Devika Kannan, Mohammad Fattahi, Chunguang Bai

{"title":"Supply disruptions and the problem of pricing, advertising, and sourcing strategies in a retail duopoly market","authors":"Reza Maihami, Devika Kannan, Mohammad Fattahi, Chunguang Bai","doi":"10.1007/s10479-024-06314-9","DOIUrl":"10.1007/s10479-024-06314-9","url":null,"abstract":"<div><p>Retailers play a crucial role in the economy, and their ability to effectively manage supply disruptions can significantly impact their performance and competitiveness. This study delves into the complex dynamics of retail markets, particularly in duopoly settings, where two major retailers interact strategically to maximize their profits. The goal is to understand how supply disruptions influence not only pricing and advertising strategies but also sourcing decisions. Three game structures are presented to analyze interactions between retailers, aiming to maximize total profit by determining the optimal sale price and advertising investment. The paper introduces a mathematical formulation for these games and a methodology to find the optimal solution based on the sourcing strategy (single, dual, or multiple sourcing strategy).2</p><p> An extensive numerical example with discussion and sensitivity analysis is provided. The study's results can assist decision-makers in selecting the most appropriate sourcing strategy in the presence of disruptions. The optimal pricing and advertising investment in both disruption and non-disruption scenarios for retailers are identified. The study concludes that acting as the leader in the Stackelberg game rather than Nash leads to higher profits. Moreover, dual sourcing is more advantageous than multiple sourcing for retailers. The managerial insights offer useful recommendations for retailers to improve their position in the competitive market.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"344 1","pages":"217 - 266"},"PeriodicalIF":4.4,"publicationDate":"2024-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142912756","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 strategies of regular-singular mean-field delayed stochastic differential games 正则奇异平均场延迟随机微分对策的最优策略

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2024-12-04 DOI: 10.1007/s10479-024-06399-2

Jun Lu, Jinbiao Wu, Bixuan Yang

引用次数: 0

Big data for logistics decarbonization 物流脱碳大数据

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2024-12-03 DOI: 10.1007/s10479-024-06405-7

Chun-Hsien Chen, Gang Chen, Junliang He, Devika Kannan

引用次数: 0

Managing perishable inventory when strategic customers form a reference on product availability 当战略客户形成对产品可用性的参考时，管理易腐库存

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2024-11-29 DOI: 10.1007/s10479-024-06398-3

Hasan Arslan, Seokjin Kim

{"title":"Managing perishable inventory when strategic customers form a reference on product availability","authors":"Hasan Arslan, Seokjin Kim","doi":"10.1007/s10479-024-06398-3","DOIUrl":"10.1007/s10479-024-06398-3","url":null,"abstract":"<div><p>Our framework deals with stochastic dynamic inventory models for stocking decisions of a retailer selling a single perishable product in the presence of strategic customers who time their purchases. Each short period, the retailer determines a stocking quantity before random demand is realized. Strategic customers use their reference on product availability to purchase at a regular price or wait for a markdown and learn from the retailer’s stocking quantity to update their reference. We characterize the structural properties such as the concavity of single- and two-period profit functions. On an infinite horizon, we show that a steady-state reference distribution is ergodic and an optimal stocking quantity is unique for a given reference. We conduct extensive numerical studies on an infinite horizon to compare an optimal dynamic policy and the corresponding optimal static policy which sets a fixed stocking quantity over time. A near-optimal performance of optimal static policy with an average profit gap of less than 1% is remarkable and contrasts with that in the two-period model which may be far worse. Thus, a well-chosen fixed stocking quantity on a planning horizon with many short periods tends to yield a high performance without having to change stocking quantities over time.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"344 1","pages":"47 - 78"},"PeriodicalIF":4.4,"publicationDate":"2024-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142912776","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

Correction: Evolutionary game theoretic approach with deep learning for health decision-making in critical environment 修正：关键环境下健康决策的深度学习进化博弈论方法

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2024-11-27 DOI: 10.1007/s10479-024-06372-z

Yue Wu, Beiyi Chen, Helen Huifen Cai, Daojuan Wang, Qiong Yuan

引用次数: 0

A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes 一种确定固定序列飞机最优降落时间的近线性时间算法和最小成本流方法

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2024-11-23 DOI: 10.1007/s10479-024-06358-x

Bin Cao, Chao Xu

{"title":"A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes","authors":"Bin Cao, Chao Xu","doi":"10.1007/s10479-024-06358-x","DOIUrl":"10.1007/s10479-024-06358-x","url":null,"abstract":"<div><p>The aircraft landing problem (ALP) is an important issue of assigning an airport’s runways to the arrival aircrafts as well as to schedule the landing time of these aircrafts in practice. A large number of the extant studies have tried to address such a practical problem with using various algorithms for one or more runways. For a static single-runway of the ALP, this paper proposes a new approach to develop an alternative powerful algorithm. For a given sequence of planes, we develop a faster algorithm for solving the ALP with the running time <span>(O(n log n))</span>, where <i>n</i> is the number of aircrafts in the schedule. Alternatively, we reduce the proposed problem of minimizing the total cost by determining the landing times for a given landing sequence into a min-cost flow problem. We conduct a set of experimental studies to compare the performance of our near-linear time algorithm to the quadratic time algorithm whose time complexity is <span>(O(n^2))</span>, for computing the optimal landing times. The computational results show that the proposed heuristic based on our algorithm could be much faster than both such quadratic time algorithm and the one using linear programming.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"344 1","pages":"479 - 498"},"PeriodicalIF":4.4,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142912890","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 guided tour of multiple criteria sorting models and methods 多标准排序模型和方法导览

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2024-11-12 DOI: 10.1007/s10479-024-06278-w

Khaled Belahcène, Vincent Mousseau, Wassila Ouerdane, Marc Pirlot, Olivier Sobrie

引用次数: 0