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

A note on the complexity of the picker routing problem in multi-block warehouses and related problems 关于多块仓库中拣选机路由问题的复杂性及相关问题的说明

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-24 DOI: 10.1007/s10479-025-06481-3

Thibault Prunet, Nabil Absi, Diego Cattaruzza

引用次数: 0

Optimizing wireless sensor networks deployment with coverage and connectivity requirements 优化覆盖和连接要求的无线传感器网络部署

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-23 DOI: 10.1007/s10479-025-06487-x

Luigi Di Puglia Pugliese, Francesca Guerriero, Nathalie Mitton

{"title":"Optimizing wireless sensor networks deployment with coverage and connectivity requirements","authors":"Luigi Di Puglia Pugliese, Francesca Guerriero, Nathalie Mitton","doi":"10.1007/s10479-025-06487-x","DOIUrl":"10.1007/s10479-025-06487-x","url":null,"abstract":"<div><p>The wireless sensor networks are widely studied in the scientific literature due to their practical importance. They are used for monitoring and surveillance of strategic areas, and tracking targets in several fields, such as military, battlefields, health care, agriculture, and industry. Challenges in wireless sensor networks are related to localization, routing, limited storage, and deployment of sensors. In this paper, we focus on deployment issues. While the main aim is to use the smallest number of sensors, a wireless sensor network has to ensure full coverage of the area of interest, collect the proper data, and guarantee that such data are available at a sink node, that plays the role of the central base station. We consider the problem of deploying the minimum number of sensors that are able to fully cover the area of interest, ensuring the connectivity of each sensor with the sink node. We propose a new formulation, based on both the set covering problem and the shortest paths problem from a single source to all destinations. The proposed model has been compared with the state-of-the-art considering instances inspired by the scientific literature. The numerical results highlight the superiority of the proposed formulation in terms of both efficiency and effectiveness.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"346 3","pages":"1997 - 2008"},"PeriodicalIF":4.4,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698597","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

Scheduling problems on parallel machines with machine-dependent generalized due-dates 具有机器相关广义到期日的并行机器调度问题

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-23 DOI: 10.1007/s10479-025-06468-0

Baruch Mor, Gur Mosheiov, Dvir Shabtay

引用次数: 0

Short-term interval-valued load forecasting with a combined strategy of iHW and multioutput machine learning 基于iHW和多输出机器学习相结合策略的短期区间值负荷预测

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-22 DOI: 10.1007/s10479-024-06446-y

Feng Gao, Jie Song, Xueyan Shao

{"title":"Short-term interval-valued load forecasting with a combined strategy of iHW and multioutput machine learning","authors":"Feng Gao, Jie Song, Xueyan Shao","doi":"10.1007/s10479-024-06446-y","DOIUrl":"10.1007/s10479-024-06446-y","url":null,"abstract":"<div><p>Interval-valued load forecasting is an important risk management tool for the utility companies and can provide more comprehensive and richer information to assist in decision-making. However, the existing literature mainly focused on point-valued load forecasting, neglecting the significance of interval-valued load forecasting. In this paper, we propose a combined framework based on interval Holt-Winters and multioutput machine leaning method to predict daily interval-valued load. Firstly, we improve the traditional Holt-Winters and propose interval Holt-Winters that takes account of the seasonal characteristics of daily load. Secondly, interval Holt-Winters is applied to predict daily interval-valued load series and obtain the forecasting results and residual series. Thirdly, multioutput machine learning models including multioutput support vector regression, interval multilayer perceptron and interval long short-term memory are employed to predict residual series and obtain the forecasting results of residual series, respectively. Finally, the final forecasting results of the daily interval-valued load are obtained by summing the forecasting results of interval Holt-Winters and residual series. Empirical results show that the proposed combined interval model outperforms the corresponding single interval model and has excellent robustness. Besides, compared with point forecasting models, the interval models have better performance.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"346 3","pages":"2009 - 2033"},"PeriodicalIF":4.4,"publicationDate":"2025-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698595","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 exact approach for bi-objective non-identical batch processing machines scheduling 双目标非同构批处理机器调度的精确方法

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-21 DOI: 10.1007/s10479-025-06485-z

Shaoxiang Zheng, Naiming Xie, Qiao Wu

{"title":"An exact approach for bi-objective non-identical batch processing machines scheduling","authors":"Shaoxiang Zheng, Naiming Xie, Qiao Wu","doi":"10.1007/s10479-025-06485-z","DOIUrl":"10.1007/s10479-025-06485-z","url":null,"abstract":"<div><p>Batch scheduling aims to allocate jobs into several batches on batch-processing machines, and thus increases the production efficiency and has pervasive applications. This paper investigates a novel batch-processing machine scheduling problem, in which non-identical machines are capable of processing a batch of jobs simultaneously only if the knapsack constraints are fulfilled. The objectives are to minimize makespan and total energy consumption. The mixed-integer linear programming (MILP) is established, and an exact algorithm is then proposed to tackle such a bi-objective optimization problem. In each step, the makespan is treated as a <span>(epsilon )</span>-constraint, and the problem can be thus regarded as a non-identical batch processing machine scheduling problem with a common deadline (NBPMP-DL), aiming to minimize the total energy consumption. A branch-and-price approach along with some acceleration strategies is devised to solve NBPMP-DL efficiently. The novel aspects of our branch-and-price algorithm are the introduction of the new branching scheme, the design of the label-setting method and the branch-and-bound algorithm for the pricing problem. In computational experiments, the presented method’s performance is tested on randomly generated instances, and the results show that, on average, they outperform the off-the-shelf solver and some state-of-art algorithms from literature in a statistical sense.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"346 3","pages":"2307 - 2347"},"PeriodicalIF":4.4,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698557","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 5-approximation algorithm for the traveling tournament problem 巡回赛问题的5逼近算法

IF 4.4 3区管理学

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

Jingyang Zhao, Mingyu Xiao

引用次数: 0

Multi-stage stochastic districting: optimization models and solution algorithms 多阶段随机分区：优化模型及求解算法

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-17 DOI: 10.1007/s10479-024-06459-7

Anika Pomes, Antonio Diglio, Stefan Nickel, Francisco Saldanha-da-Gama

{"title":"Multi-stage stochastic districting: optimization models and solution algorithms","authors":"Anika Pomes, Antonio Diglio, Stefan Nickel, Francisco Saldanha-da-Gama","doi":"10.1007/s10479-024-06459-7","DOIUrl":"10.1007/s10479-024-06459-7","url":null,"abstract":"<div><p>This paper investigates a Multi-Stage Stochastic Districting Problem (MSSDP). The goal is to devise a districting plan (i.e., clusters of Territorial Units—TUs) accounting for uncertain parameters changing over a discrete multi-period planning horizon. The problem is cast as a multi-stage stochastic programming problem. It is assumed that uncertainty can be captured by a finite set of scenarios, which induces a scenario tree. Each node in the tree corresponds to the realization of all the stochastic parameters from the root node—the state of nature—up to that node. A mathematical programming model is proposed that embeds redistricting recourse decisions and other recourse actions to ensure that the districts are balanced regarding their activity. The model is tested on instances generated using literature data containing real geographical data. The results demonstrate the relevance of hedging against uncertainty in multi-period districting. Since the model is challenging to tackle using a general-purpose solver, a heuristic algorithm is proposed based on a restricted model. The computational results obtained give evidence that the approximate algorithm can produce high-quality feasible solutions within acceptable computation times.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"346 3","pages":"2225 - 2251"},"PeriodicalIF":4.4,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10479-024-06459-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143698513","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

A note on valid inequalities for a service center location problem with a type of decision-dependent customer demand 关于客户需求决策依赖型服务中心选址问题有效不等式的说明

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-17 DOI: 10.1007/s10479-025-06475-1

Fengqiao Luo

引用次数: 0

Heterogeneous business network based interpretable competitive firm identification: a graph neural network method 基于异构商业网络的可解释竞争企业识别：一种图神经网络方法

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-16 DOI: 10.1007/s10479-025-06476-0

Xiaoqing Ye, Dun Liu, Tianrui Li, Wenjie Li

{"title":"Heterogeneous business network based interpretable competitive firm identification: a graph neural network method","authors":"Xiaoqing Ye, Dun Liu, Tianrui Li, Wenjie Li","doi":"10.1007/s10479-025-06476-0","DOIUrl":"10.1007/s10479-025-06476-0","url":null,"abstract":"<div><p>Competitor identification at the firm-level is a crucial aspect of business strategy. In general, we can identify competitive firms based on market commonality and resource similarity. However, previous studies predominantly focus on market commonality, seldom consider the resource similarity. To bridge this gap, we attempt to use three types of business relationships, namely, customer relationships, supplier relationships and alliance relationships to identify competitors from the perspective of resource similarity. First, we consider the connectivity and heterogeneity of business relationships and build a heterogeneous business network (HBN) to transform hybrid and complex business relationships into a heterogeneous information network. Then, to identify competitors from the HBN and improve the interpretation of prediction results, we further develop a heterogeneous graph neural network based competitive firm identification (HGNN-CFI) method. Finally, extensive experiments on 3371 firms reveal that HGNN-CFI can not only identify competitors but also offer interpretability for the prediction results. This paper provides a novel perspective and method to identify competitive firms.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"347 2","pages":"1133 - 1161"},"PeriodicalIF":4.4,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143925609","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 stochastic algorithm for deterministic multistage optimization problems 确定性多阶段优化问题的随机算法

IF 4.4 3区管理学

Annals of Operations Research Pub Date : 2025-01-13 DOI: 10.1007/s10479-024-06153-8

Marianne Akian, Jean-Philippe Chancelier, Benoît Tran

{"title":"A stochastic algorithm for deterministic multistage optimization problems","authors":"Marianne Akian, Jean-Philippe Chancelier, Benoît Tran","doi":"10.1007/s10479-024-06153-8","DOIUrl":"10.1007/s10479-024-06153-8","url":null,"abstract":"<div><p>Several attempts to dampen the curse of dimensionality problem of the Dynamic Programming approach for solving multistage optimization problems have been investigated. One popular way to address this issue is the Stochastic Dual Dynamic Programming method (<span>Sddp</span>) introduced by Pereira and Pinto (Math Program 52(1–3):359–375. https://doi.org/10.1007/BF01582895). Assuming that the value function is convex (for a minimization problem), one builds a non-decreasing sequence of lower (or outer) convex approximations of the value function. Those convex approximations are constructed as a supremum of affine cuts. On continuous time deterministic optimal control problems, assuming that the value function is semiconvex, Zheng Qu, inspired by the work of McEneaney, introduced in 2013 a stochastic max-plus scheme that builds a non-increasing sequence of upper (or inner) approximations of the value function. In this note, we build a common framework for both the <span>Sddp</span> and a discrete time version of Zheng Qu’s algorithm to solve deterministic multistage optimization problems. Our algorithm generates a monotone sequence of approximations of the value function as a pointwise supremum, or infimum, of basic (affine or quadratic for example) functions which are randomly selected. We give sufficient conditions on the way basic functions are selected in order to ensure almost sure convergence of the approximations to the value function on a set of interest.</p></div>","PeriodicalId":8215,"journal":{"name":"Annals of Operations Research","volume":"345 1","pages":"1 - 38"},"PeriodicalIF":4.4,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143108667","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