Computers & Operations Research最新文献_第10页

Airline recovery problem under disruptions: A review 中断情况下的航空公司恢复问题：综述

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-21 DOI: 10.1016/j.cor.2024.106915

Shuai Wu , Enze Liu , Rui Cao , Qiang Bai

Flights are vulnerable to unforeseen factors, such as adverse weather, airport flow control, crew absence, unexpected aircraft maintenance, and pandemic, all of which can cause disruptions in flight schedules. Consequently, managers need to reallocate relevant resources to ensure that the airport can return to normal operations on the basis of minimum cost, a challenge known as the airline recovery problem. Airline recovery is an active research area, with a lot of publications in recent years. To provide a comprehensive overview of airline recovery, first, keywords are selected to search for relevant studies, then existing studies are analyzed in terms of the number of papers, keywords, and sources. The study then delves into an analysis of passenger-oriented airline recovery problems on both traditional and novel recovery strategies. A detailed exploration of novel recovery strategies is conducted to uncover new insights and potential solutions for addressing airline recovery problems. Furthermore, this study investigates recovery strategies for cargo-oriented airline operations, comparing them with those designed for passenger-oriented airline recovery to offer insights for future studies on airline recovery problems. Finally, conclusions are drawn and future study directions are provided. For future studies, it is recommended to conduct more in-depth studies on dynamic and real-time recovery, incorporating human factors into the modeling, multi-modal transportation coupling, optimization of other airport processes, combination of robust scheduling and airline recovery, addressing the stochasticity of parameters, and optimization algorithm improvement.

航班很容易受到不可预见因素的影响，如恶劣天气、机场流量控制、机组人员缺勤、飞机意外维修和大流行病等，所有这些因素都可能导致航班计划中断。因此，管理者需要重新分配相关资源，确保机场能以最低成本恢复正常运营，这就是所谓的航空公司恢复问题。航空公司恢复是一个活跃的研究领域，近年来发表了大量论文。为了全面介绍航空公司恢复问题，首先选择关键词搜索相关研究，然后从论文数量、关键词和来源等方面对现有研究进行分析。然后，研究从传统和新型恢复策略两个方面深入分析了以乘客为导向的航空公司恢复问题。本研究对新型恢复策略进行了详细探讨，以揭示解决航空公司恢复问题的新见解和潜在解决方案。此外，本研究还调查了面向货运的航空公司运营恢复策略，并将其与面向客运的航空公司恢复策略进行了比较，从而为今后研究航空公司恢复问题提供启示。最后，本研究得出了结论，并提供了未来的研究方向。对于未来的研究，建议在动态和实时恢复、将人为因素纳入建模、多式联运耦合、机场其他流程优化、稳健调度与航空公司恢复相结合、解决参数的随机性以及优化算法改进等方面进行更深入的研究。

{"title":"Airline recovery problem under disruptions: A review","authors":"Shuai Wu , Enze Liu , Rui Cao , Qiang Bai","doi":"10.1016/j.cor.2024.106915","DOIUrl":"10.1016/j.cor.2024.106915","url":null,"abstract":"<div><div>Flights are vulnerable to unforeseen factors, such as adverse weather, airport flow control, crew absence, unexpected aircraft maintenance, and pandemic, all of which can cause disruptions in flight schedules. Consequently, managers need to reallocate relevant resources to ensure that the airport can return to normal operations on the basis of minimum cost, a challenge known as the airline recovery problem. Airline recovery is an active research area, with a lot of publications in recent years. To provide a comprehensive overview of airline recovery, first, keywords are selected to search for relevant studies, then existing studies are analyzed in terms of the number of papers, keywords, and sources. The study then delves into an analysis of passenger-oriented airline recovery problems on both traditional and novel recovery strategies. A detailed exploration of novel recovery strategies is conducted to uncover new insights and potential solutions for addressing airline recovery problems. Furthermore, this study investigates recovery strategies for cargo-oriented airline operations, comparing them with those designed for passenger-oriented airline recovery to offer insights for future studies on airline recovery problems. Finally, conclusions are drawn and future study directions are provided. For future studies, it is recommended to conduct more in-depth studies on dynamic and real-time recovery, incorporating human factors into the modeling, multi-modal transportation coupling, optimization of other airport processes, combination of robust scheduling and airline recovery, addressing the stochasticity of parameters, and optimization algorithm improvement.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"175 ","pages":"Article 106915"},"PeriodicalIF":4.1,"publicationDate":"2024-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142701941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A decomposition scheme for Wasserstein distributionally robust emergency relief network design under demand uncertainty and social donations 需求不确定和社会捐赠条件下瓦塞尔斯坦分布稳健型紧急救援网络设计的分解方案

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-19 DOI: 10.1016/j.cor.2024.106913

Weiqiao Wang , Kai Yang , Lixing Yang , Ziyou Gao , Jianjun Dong , Haifeng Zhang

Social donations have played a crucial role in providing effective emergency relief and need to be particularly valued and used wisely. In this study, we address a Wasserstein distributionally robust emergency relief network design problem with demand uncertainty by taking into account the social donations. Specifically, we first formulate the problem into a two-stage stochastic programming model that requires the probability distribution information of the uncertain demand is completely known in advance, where the first stage decides on the location and pre-positioning of resources, and the second stage optimizes the delivery volume of the reserved and donated supplies offered by social organizations and individual. As the probability distribution of the demand cannot be known precisely (i.e., ambiguous) in reality, we further extend the stochastic model to a Wasserstein distributionally robust optimization model, in which the ambiguous demand is captured by the Wasserstein ambiguity set. Theoretically, we derive the tractable deterministic reformulations of the proposed distributionally robust optimization model under Type-

\infty

and Type-1 Wasserstein metrics. To solve the extensive reformulations, we design a decomposition scheme on the basis of the Benders decomposition framework by adopting aggregated multiple cuts, cut-loop stabilization at root node and stabilized k-opt local branching acceleration strategies. Finally, we carry out numerical experiments to illustrate the computational advantage of the proposed solution method over the single acceleration implementation on hypothetical instances, and demonstrate the superiority of the proposed modeling approach compared with the traditional stochastic programming and robust optimization models on a real case study. The results show that the distributionally robust optimization approach used better trade-offs between cost and risk.

社会捐赠在提供有效的紧急救援方面发挥了至关重要的作用，需要特别重视并合理使用。在本研究中，我们通过考虑社会捐赠，解决了一个具有需求不确定性的 Wasserstein 分布稳健型紧急救援网络设计问题。具体来说，我们首先将该问题表述为一个两阶段随机编程模型，要求事先完全知道不确定需求的概率分布信息，其中第一阶段决定资源的位置和预置，第二阶段优化社会组织和个人提供的预留和捐赠物资的交付量。由于现实中需求的概率分布无法精确获知（即模糊性），我们进一步将随机模型扩展为瓦瑟斯坦分布稳健优化模型，其中模糊需求由瓦瑟斯坦模糊集捕捉。从理论上讲，我们推导出了所提出的分布稳健优化模型在 Type-∞ 和 Type-1 Wasserstein 度量下的可操作性确定性重构。为了解决广泛的重构问题，我们在本德斯分解框架的基础上设计了一种分解方案，采用了聚合多重切割、根节点切割环稳定和稳定的 k-opt 局部分支加速策略。最后，我们进行了数值实验，在假设实例上说明了所提求解方法相对于单一加速实现的计算优势，并在实际案例研究中证明了所提建模方法相对于传统随机编程和鲁棒优化模型的优越性。结果表明，分布稳健优化方法能更好地权衡成本和风险。

{"title":"A decomposition scheme for Wasserstein distributionally robust emergency relief network design under demand uncertainty and social donations","authors":"Weiqiao Wang , Kai Yang , Lixing Yang , Ziyou Gao , Jianjun Dong , Haifeng Zhang","doi":"10.1016/j.cor.2024.106913","DOIUrl":"10.1016/j.cor.2024.106913","url":null,"abstract":"<div><div>Social donations have played a crucial role in providing effective emergency relief and need to be particularly valued and used wisely. In this study, we address a Wasserstein distributionally robust emergency relief network design problem with demand uncertainty by taking into account the social donations. Specifically, we first formulate the problem into a two-stage stochastic programming model that requires the probability distribution information of the uncertain demand is completely known in advance, where the first stage decides on the location and pre-positioning of resources, and the second stage optimizes the delivery volume of the reserved and donated supplies offered by social organizations and individual. As the probability distribution of the demand cannot be known precisely (i.e., ambiguous) in reality, we further extend the stochastic model to a Wasserstein distributionally robust optimization model, in which the ambiguous demand is captured by the Wasserstein ambiguity set. Theoretically, we derive the tractable deterministic reformulations of the proposed distributionally robust optimization model under Type-<span><math><mi>∞</mi></math></span> and Type-1 Wasserstein metrics. To solve the extensive reformulations, we design a decomposition scheme on the basis of the Benders decomposition framework by adopting aggregated multiple cuts, cut-loop stabilization at root node and stabilized k-opt local branching acceleration strategies. Finally, we carry out numerical experiments to illustrate the computational advantage of the proposed solution method over the single acceleration implementation on hypothetical instances, and demonstrate the superiority of the proposed modeling approach compared with the traditional stochastic programming and robust optimization models on a real case study. The results show that the distributionally robust optimization approach used better trade-offs between cost and risk.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"175 ","pages":"Article 106913"},"PeriodicalIF":4.1,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142701939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Scheduling AMSs with generalized Petri nets and highly informed heuristic search 利用广义 Petri 网和高度知情的启发式搜索安排 AMS

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-18 DOI: 10.1016/j.cor.2024.106912

FengLian Yuan , Bo Huang , JianYong Lv , MeiJi Cui

The design of the heuristic function in a Petri-net(PN)-based A

^{*}

search significantly impacts search efficiency and schedule quality for automated manufacturing systems (AMSs). In Luo et al. (2015), two admissible heuristic functions were formulated for an A

^{*}

search based on place-timed PNs to schedule AMSs. To broaden its application scenarios and enhance search efficiency, this paper proposes a new heuristic function whose calculations take account of multiple resource acquisitions, weighted arcs, redundant resource units, and outdated resources, which are commonly encountered in practical AMSs but usually not considered. The proposed one can deal with generalized PNs, offering broader application scenarios than ordinary PNs. In addition, it is proven to be admissible and more informed than its counterparts, ensuring that the obtained schedules are optimal and making the timed PN-based A

^{*}

search more efficient. To validate the efficacy and efficiency of the proposed method, several benchmark systems are tested.

在基于 Petri 网（PN）的 A∗ 搜索中，启发式函数的设计对自动制造系统（AMS）的搜索效率和排程质量有很大影响。在 Luo 等人（2015 年）的研究中，为基于位置定时 PN 的 A∗ 搜索制定了两个可接受的启发式函数，以调度 AMS。为了拓宽其应用场景并提高搜索效率，本文提出了一种新的启发式函数，其计算考虑了实际 AMS 中经常遇到但通常不考虑的多资源获取、加权弧、冗余资源单元和过时资源。所提出的计算方法可以处理广义 PN，提供比普通 PN 更广泛的应用场景。此外，它还被证明是可接受的，并且比同类算法更有信息量，从而确保获得的计划是最优的，并使基于定时 PN 的 A∗ 搜索更有效率。为了验证所提方法的功效和效率，对几个基准系统进行了测试。

{"title":"Scheduling AMSs with generalized Petri nets and highly informed heuristic search","authors":"FengLian Yuan , Bo Huang , JianYong Lv , MeiJi Cui","doi":"10.1016/j.cor.2024.106912","DOIUrl":"10.1016/j.cor.2024.106912","url":null,"abstract":"<div><div>The design of the heuristic function in a Petri-net(PN)-based A<span><math><msup><mrow></mrow><mrow><mo>∗</mo></mrow></msup></math></span> search significantly impacts search efficiency and schedule quality for automated manufacturing systems (AMSs). In Luo et al. (2015), two admissible heuristic functions were formulated for an A<span><math><msup><mrow></mrow><mrow><mo>∗</mo></mrow></msup></math></span> search based on place-timed PNs to schedule AMSs. To broaden its application scenarios and enhance search efficiency, this paper proposes a new heuristic function whose calculations take account of multiple resource acquisitions, weighted arcs, redundant resource units, and outdated resources, which are commonly encountered in practical AMSs but usually not considered. The proposed one can deal with generalized PNs, offering broader application scenarios than ordinary PNs. In addition, it is proven to be admissible and more informed than its counterparts, ensuring that the obtained schedules are optimal and making the timed PN-based A<span><math><msup><mrow></mrow><mrow><mo>∗</mo></mrow></msup></math></span> search more efficient. To validate the efficacy and efficiency of the proposed method, several benchmark systems are tested.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"175 ","pages":"Article 106912"},"PeriodicalIF":4.1,"publicationDate":"2024-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142701937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server 在带共用服务器的并行计算机上实现最小间隔的高效弧流计算公式

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-17 DOI: 10.1016/j.cor.2024.106911

Alessandro Druetto , Andrea Grosso , Jully Jeunet , Fabio Salassa

We consider the problem of scheduling non preemptively a set of jobs on parallel identical machines with prior setup operations on a single shared server, where the objective is to minimise the makespan. We develop an arc-flow formulation to the problem with two multigraphs, one for the machines and one for the server, with a same set of nodes representing points in time, and arcs associated with job execution, and with machines or server idleness. The resulting formulation, called Flow–Flow formulation (FFF), and its tuned version (FFT) are compared with the best existing model in the literature, a time-indexed variable formulation (

F 2

), on benchmark instances with up to 200 jobs and 10 machines. Computational results showed that our Flow–Flow models outperformed

F 2

especially for instances with more than 50 jobs and optimally solved a majority of problems with 150 and 200 jobs for which

F 2

found only very few optimal solutions.

我们考虑的问题是在并行的相同机器上对一组作业进行非抢占式调度，并在单个共享服务器上进行事先设置操作，目标是最小化作业间隔。我们用两个多图（一个是机器多图，另一个是服务器多图）对该问题进行了弧流表述，其中同一组节点代表时间点，弧与作业执行相关，弧与机器或服务器闲置相关。在多达 200 个作业和 10 台机器的基准实例上，我们将得出的公式（称为流-流公式（FFF））及其调整版本（FFT）与文献中现有的最佳模型（时间索引变量公式（F2））进行了比较。计算结果表明，Flow-Flow 模型的性能优于 F2，尤其是在作业量超过 50 个的实例中，并且优化解决了作业量为 150 和 200 个的大多数问题，而 F2 只找到了极少数的最优解。

{"title":"Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server","authors":"Alessandro Druetto , Andrea Grosso , Jully Jeunet , Fabio Salassa","doi":"10.1016/j.cor.2024.106911","DOIUrl":"10.1016/j.cor.2024.106911","url":null,"abstract":"<div><div>We consider the problem of scheduling non preemptively a set of jobs on parallel identical machines with prior setup operations on a single shared server, where the objective is to minimise the makespan. We develop an arc-flow formulation to the problem with two multigraphs, one for the machines and one for the server, with a same set of nodes representing points in time, and arcs associated with job execution, and with machines or server idleness. The resulting formulation, called Flow–Flow formulation (FFF), and its tuned version (FFT) are compared with the best existing model in the literature, a time-indexed variable formulation (<span><math><mrow><mi>F</mi><mn>2</mn></mrow></math></span>), on benchmark instances with up to 200 jobs and 10 machines. Computational results showed that our Flow–Flow models outperformed <span><math><mrow><mi>F</mi><mn>2</mn></mrow></math></span> especially for instances with more than 50 jobs and optimally solved a majority of problems with 150 and 200 jobs for which <span><math><mrow><mi>F</mi><mn>2</mn></mrow></math></span> found only very few optimal solutions.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"174 ","pages":"Article 106911"},"PeriodicalIF":4.1,"publicationDate":"2024-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142704697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

50 years of Computers & Operations Research: A bibliometric analysis 计算机与运筹学 50 年：文献计量分析

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-15 DOI: 10.1016/j.cor.2024.106910

Li Guan , Gilbert Laporte , José M. Merigó , Stefan Nickel , Iman Rahimi , Francisco Saldanha-da-Gama

Computers & Operations Research (COR) is a leading international journal in the field of Operations Research, established with a vision to provide a platform for emphasising and promoting the application of computers and operations research techniques to problems of world concern and general interest. The journal published its first issue in 1974 and in 2024 celebrated its 50th anniversary. Motivated by this special event, this paper aims to present a complete bibliometric overview of the most significant development patterns and trends of the journal during its first half-century of publishing history from 1974 to 2023. The study uses the Web of Science Core Collection database to collect bibliographic information and analyse the data, complemented by the Scopus database and the journal’s webpage. Based on a wide range of bibliometric indicators, the results of the bibliometric analysis highlight the publication and citation structure of COR, the most cited documents, the leading authors, institutions, countries/territories, and supranational regions, and the most popular keywords and research topics in the journal. Additionally, the work also graphically maps the bibliographic material with techniques of co-citation, bibliographic coupling, and co-occurrence of author keywords by using the Visualization of Similarities (VOS) viewer software. The findings of the study provide strong evidence of the significant growth of COR through its lifetime development and its international diversity having publications from all over the world. The study is also useful for understanding the substantial contributions of the journal it has made to the scientific community.

计算机与运筹学》（COR）是运筹学领域的国际领先期刊，其创办宗旨是提供一个平台，强调和促进计算机与运筹学技术在世界关注和普遍感兴趣的问题上的应用。该期刊于 1974 年出版创刊号，2024 年庆祝创刊 50 周年。在这一特殊事件的推动下，本文旨在对该期刊从 1974 年到 2023 年的半个世纪出版史上最重要的发展模式和趋势进行全面的文献计量学概述。本研究利用 Web of Science Core Collection 数据库收集书目信息并进行数据分析，同时辅以 Scopus 数据库和期刊网页。基于多种文献计量指标，文献计量分析结果突出显示了 COR 的出版和引用结构，被引用最多的文献，主要作者、机构、国家/地区和超国家地区，以及期刊中最热门的关键词和研究课题。此外，该研究还通过使用相似性可视化（VOS）查看软件，利用共引、书目耦合和作者关键词共现等技术，对书目资料进行了图解。研究结果有力地证明了 COR 在其整个发展过程中的显著增长及其来自世界各地出版物的国际多样性。这项研究还有助于了解该期刊对科学界做出的重大贡献。

{"title":"50 years of Computers & Operations Research: A bibliometric analysis","authors":"Li Guan , Gilbert Laporte , José M. Merigó , Stefan Nickel , Iman Rahimi , Francisco Saldanha-da-Gama","doi":"10.1016/j.cor.2024.106910","DOIUrl":"10.1016/j.cor.2024.106910","url":null,"abstract":"<div><div><em>Computers & Operations Research</em> (COR) is a leading international journal in the field of Operations Research, established with a vision to provide a platform for emphasising and promoting the application of computers and operations research techniques to problems of world concern and general interest. The journal published its first issue in 1974 and in 2024 celebrated its 50th anniversary. Motivated by this special event, this paper aims to present a complete bibliometric overview of the most significant development patterns and trends of the journal during its first half-century of publishing history from 1974 to 2023. The study uses the Web of Science Core Collection database to collect bibliographic information and analyse the data, complemented by the Scopus database and the journal’s webpage. Based on a wide range of bibliometric indicators, the results of the bibliometric analysis highlight the publication and citation structure of COR, the most cited documents, the leading authors, institutions, countries/territories, and supranational regions, and the most popular keywords and research topics in the journal. Additionally, the work also graphically maps the bibliographic material with techniques of co-citation, bibliographic coupling, and co-occurrence of author keywords by using the Visualization of Similarities (VOS) viewer software. The findings of the study provide strong evidence of the significant growth of COR through its lifetime development and its international diversity having publications from all over the world. The study is also useful for understanding the substantial contributions of the journal it has made to the scientific community.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"175 ","pages":"Article 106910"},"PeriodicalIF":4.1,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142701936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem 最大值动态网络流量调度问题的混合整数编程模型和启发式算法

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-12 DOI: 10.1016/j.cor.2024.106897

Tanner Nixon , Robert M. Curry , Phanuel Allaissem B.

Various applications in contested logistics and infrastructure restoration require dynamic flow solutions characterized by a schedule of network flows consecutively transmitted over a sequence of successive periods. For these schedules, we assume flows transmit via arcs during periods while flows reside at nodes from one period to the next. Within this context, we introduce the Maximum Value Dynamic Network Flow Problem (MVDFP) in which we seek to maximize the cumulative value of a non-simultaneous network flow schedule that accumulates node value whenever some minimum amount of flow resides at a node between periods. For solving the MVDFP, we first introduce a large mixed-integer program (MIP). As this MIP can become computationally-expensive for large networks, we present a trio of computationally-effective, easy to implement heuristic approaches that solve a series of smaller, more manageable MIPs. These heuristic approaches typically determine high-quality solutions significantly faster than the MIP obtains an optimal solution by dividing the full network flow schedule into a sequence of consecutive shorter network flow subschedules. In many cases, at least one of our heuristic approaches produces an optimal solution in a fraction of the MIP’s computational time. We present extensive computational results to highlight our heuristics’ efficacy, discuss for what instances each approach may be most applicable, and detail future research avenues.

有争议的物流和基础设施恢复领域的各种应用都需要动态流量解决方案，其特点是在一系列连续时段内连续传输网络流量的时间表。对于这些时间表，我们假定流量在周期内通过弧线传输，而流量从一个周期到下一个周期停留在节点上。在此背景下，我们引入了最大值动态网络流量问题（MVDFP），即寻求最大化非同步网络流量计划的累积值，该计划可在各周期之间的节点上驻留最小流量时累积节点值。为了求解 MVDFP，我们首先引入了一个大型混合整数程序（MIP）。对于大型网络来说，这种 MIP 的计算成本会很高，因此我们提出了三种计算高效、易于实现的启发式方法，用于求解一系列更小、更易于管理的 MIP。这些启发式方法通过将完整的网络流量计划划分为一系列连续的较短网络流量子计划，通常比 MIP 获得最优解的速度快得多。在许多情况下，我们的启发式方法中至少有一种方法只需 MIP 计算时间的一小部分就能得到最优解。我们展示了大量计算结果，以突出启发式方法的功效，讨论每种方法最适用于哪些情况，并详细介绍了未来的研究方向。

{"title":"Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem","authors":"Tanner Nixon , Robert M. Curry , Phanuel Allaissem B.","doi":"10.1016/j.cor.2024.106897","DOIUrl":"10.1016/j.cor.2024.106897","url":null,"abstract":"<div><div>Various applications in contested logistics and infrastructure restoration require dynamic flow solutions characterized by a schedule of network flows consecutively transmitted over a sequence of successive periods. For these schedules, we assume flows transmit via arcs <em>during</em> periods while flows <em>reside</em> at nodes from one period to the next. Within this context, we introduce the Maximum Value Dynamic Network Flow Problem (MVDFP) in which we seek to maximize the cumulative <em>value</em> of a non-simultaneous network flow schedule that accumulates node <em>value</em> whenever some minimum amount of flow resides at a node between periods. For solving the MVDFP, we first introduce a large mixed-integer program (MIP). As this MIP can become computationally-expensive for large networks, we present a trio of computationally-effective, easy to implement heuristic approaches that solve a series of smaller, more manageable MIPs. These heuristic approaches typically determine high-quality solutions significantly faster than the MIP obtains an optimal solution by dividing the full network flow schedule into a sequence of consecutive shorter network flow subschedules. In many cases, at least one of our heuristic approaches produces an optimal solution in a fraction of the MIP’s computational time. We present extensive computational results to highlight our heuristics’ efficacy, discuss for what instances each approach may be most applicable, and detail future research avenues.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"175 ","pages":"Article 106897"},"PeriodicalIF":4.1,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142701938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Distributionally robust single machine scheduling with release and due dates over Wasserstein balls 在瓦瑟斯坦球上具有发布和到期日期的分布式稳健单机调度

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-12 DOI: 10.1016/j.cor.2024.106892

Haimin Lu, Jiayan Huang, Chenxu Lou, Zhi Pei

Single machine scheduling aims at determining the job sequence with the best desired performance, and provides the basic building block for more advanced scheduling problems. In the present study, a single machine scheduling model with uncertain processing time is considered by incorporating the job release time and due date. The job processing time follows unknown probability distribution, and can be estimated via the historical data. To model the uncertainty, the processing time distribution is defined over a Wasserstein ball ambiguity set, which covers all feasible probability distributions within the confidence radius of the empirical distribution, known as the center of the ball. Then a data-driven distributionally robust scheduling model is constructed with individual chance constraints. In particular, two equivalent reformulations are derived with respect to the

ℓ_{1}

-norm and

ℓ_{2}

-norm metrics of the Wasserstein ball, namely, a mixed-integer linear programming and a mixed-integer second order cone programming model, respectively. To accelerate the solving of large-scale instances, a tailored constraint generation algorithm is introduced. In the numerical analysis, the proposed distributionally robust scheduling approach is compared with the state-of-the-art methods in terms of out-of-sample performance.

单机调度的目的是确定具有最佳预期性能的作业序列，并为更高级的调度问题提供基本构件。在本研究中，考虑了处理时间不确定的单机调度模型，将作业发布时间和到期日期纳入其中。作业处理时间遵循未知概率分布，可通过历史数据进行估算。为了对不确定性进行建模，处理时间分布被定义在一个 Wasserstein 球模糊集上，该模糊集涵盖了经验分布置信半径（即球心）内的所有可行概率分布。然后，构建一个数据驱动的分布稳健调度模型，其中包含单个机会约束。特别是，针对 Wasserstein 球的ℓ1-norm 和 ℓ2-norm 度量，推导出了两种等价重构，即混合整数线性规划模型和混合整数二阶圆锥规划模型。为了加速大规模实例的求解，引入了一种定制的约束生成算法。在数值分析中，就样本外性能而言，将所提出的分布稳健调度方法与最先进的方法进行了比较。

{"title":"Distributionally robust single machine scheduling with release and due dates over Wasserstein balls","authors":"Haimin Lu, Jiayan Huang, Chenxu Lou, Zhi Pei","doi":"10.1016/j.cor.2024.106892","DOIUrl":"10.1016/j.cor.2024.106892","url":null,"abstract":"<div><div>Single machine scheduling aims at determining the job sequence with the best desired performance, and provides the basic building block for more advanced scheduling problems. In the present study, a single machine scheduling model with uncertain processing time is considered by incorporating the job release time and due date. The job processing time follows unknown probability distribution, and can be estimated via the historical data. To model the uncertainty, the processing time distribution is defined over a Wasserstein ball ambiguity set, which covers all feasible probability distributions within the confidence radius of the empirical distribution, known as the center of the ball. Then a data-driven distributionally robust scheduling model is constructed with individual chance constraints. In particular, two equivalent reformulations are derived with respect to the <span><math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>-norm and <span><math><msub><mrow><mi>ℓ</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>-norm metrics of the Wasserstein ball, namely, a mixed-integer linear programming and a mixed-integer second order cone programming model, respectively. To accelerate the solving of large-scale instances, a tailored constraint generation algorithm is introduced. In the numerical analysis, the proposed distributionally robust scheduling approach is compared with the state-of-the-art methods in terms of out-of-sample performance.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"174 ","pages":"Article 106892"},"PeriodicalIF":4.1,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142704702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A novel mixed-integer linear programming formulation for continuous-time inventory routing 连续时间库存路由的新型混合整数线性规划公式

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-10 DOI: 10.1016/j.cor.2024.106883

Akang Wang , Xiandong Li , Jeffrey E. Arbogast , Zachary Wilson , Chrysanthos E. Gounaris

Inventory management, vehicle routing, and delivery scheduling decisions are simultaneously considered in the context of the inventory routing problem. This paper focuses on the continuous-time version of this problem where, unlike its more traditional discrete-time counterpart, the distributor is required to guarantee that inventory levels are maintained within the desired intervals at any moment of the planning horizon. In this work, we develop a compact mixed-integer linear programming formulation to model the continuous-time inventory routing problem. We further discuss means to expedite its solution process, including the adaptation of well-known rounded capacity inequalities to tighten the formulation in the context of a branch-and-cut algorithm. Through extensive computational studies on a suite of 90 benchmark instances from the literature, we show that our branch-and-cut algorithm outperforms the state-of-the-art approach. We also consider a new set of 63 instances adapted from a real-life dataset and show our algorithm’s practical value in solving instances with up to 20 customers to guaranteed optimality.

在库存路由问题中，库存管理、车辆路由和交货调度决策被同时考虑。与传统的离散时间问题不同的是，在连续时间问题中，配送商需要保证库存水平在计划范围内的任何时刻都保持在所需的区间内。在这项工作中，我们开发了一种紧凑的混合整数线性规划公式来模拟连续时间库存路由问题。我们进一步讨论了加快其求解过程的方法，包括在分支切割算法的背景下，对著名的轮回能力不等式进行调整，以收紧公式。通过对文献中的 90 个基准实例进行广泛的计算研究，我们表明我们的分支-切割算法优于最先进的方法。我们还考虑了一组新的 63 个实例，这些实例改编自现实生活中的一个数据集，并展示了我们的算法在解决多达 20 个客户的实例时保证最优性的实用价值。

{"title":"A novel mixed-integer linear programming formulation for continuous-time inventory routing","authors":"Akang Wang , Xiandong Li , Jeffrey E. Arbogast , Zachary Wilson , Chrysanthos E. Gounaris","doi":"10.1016/j.cor.2024.106883","DOIUrl":"10.1016/j.cor.2024.106883","url":null,"abstract":"<div><div>Inventory management, vehicle routing, and delivery scheduling decisions are simultaneously considered in the context of the inventory routing problem. This paper focuses on the continuous-time version of this problem where, unlike its more traditional discrete-time counterpart, the distributor is required to guarantee that inventory levels are maintained within the desired intervals at any moment of the planning horizon. In this work, we develop a compact mixed-integer linear programming formulation to model the continuous-time inventory routing problem. We further discuss means to expedite its solution process, including the adaptation of well-known rounded capacity inequalities to tighten the formulation in the context of a branch-and-cut algorithm. Through extensive computational studies on a suite of 90 benchmark instances from the literature, we show that our branch-and-cut algorithm outperforms the state-of-the-art approach. We also consider a new set of 63 instances adapted from a real-life dataset and show our algorithm’s practical value in solving instances with up to 20 customers to guaranteed optimality.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"174 ","pages":"Article 106883"},"PeriodicalIF":4.1,"publicationDate":"2024-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142652254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The min max multi-trip drone location arc routing problem 最小最大多趟无人机定位弧线路由问题

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-09 DOI: 10.1016/j.cor.2024.106894

Teresa Corberán , Isaac Plana , José María Sanchis

This paper studies the Min Max Multi-Trip drone Location Arc Routing Problem (MM-MT-dLARP), an arc routing problem that combines trucks and drones. We have a set of lines (usually curved) that have to be flown over by drones to perform a service (inspection, for example). There is a depot from which the trucks leave, each one carrying a drone, and a set of potential launching points where the truck can launch and pick up the drone. Drones have limited autonomy, but they can make several flights. We consider a min–max objective, in which the makespan, or time necessary to complete the service, must be minimized. Using aerial drones instead of ground vehicles allows to travel off the network: drones can enter a line through any of its points, service only a portion of that line and then exit through another of its points, without following the lines of the network. This allows for finding better solutions but also increases the difficulty of the problem. This issue can be addressed by digitizing the MM-MT-dLARP instances, approximating each line by a polygonal chain with a finite number of intermediate points, and requiring that drones can only enter and exit a line through those intermediate points. Thus, an instance of a discrete Min Max Multi-Trip Location Arc Routing Problem (MM-MT-LARP) is obtained. Here, an integer formulation for the MM-MT-LARP is proposed, some families of valid inequalities are proved to be facet-inducing of a relaxed polyhedron, and a branch-and-cut algorithm based on the strengthened formulation is developed. This algorithm has only been applied to small instances without intermediate points on the lines. In addition, we have developed a matheuristic algorithm for the MM-MT-dLARP that combines a construction phase, four local search procedures integrated into a Variable Neighborhood Descent (VND) algorithm, and a set of rules for selecting intermediate points to improve the solutions. We present the results obtained on a set of randomly generated instances involving up to 6 launching points and 88 original lines.

本文研究了最小最大多程无人机定位弧线路由问题（MM-MT-dLARP），这是一个结合了卡车和无人机的弧线路由问题。我们有一组线路（通常是弯曲的），需要无人机飞越这些线路来执行服务（例如检查）。卡车从一个仓库出发，每辆卡车都载有一架无人机，还有一组潜在的发射点，卡车可以在这些发射点发射并接收无人机。无人机的自主性有限，但可以进行多次飞行。我们考虑的是最小-最大目标，即必须将完成服务所需的时间（makespan）最小化。使用空中无人机而非地面车辆可以脱离网络：无人机可以通过任何一个点进入一条线路，只为该线路的一部分提供服务，然后通过另一个点离开，而无需遵循网络线路。这样可以找到更好的解决方案，但也增加了问题的难度。要解决这个问题，可以将 MM-MT-dLARP 实例数字化，用中间点数量有限的多边形链条来近似每条线路，并要求无人机只能通过这些中间点进出线路。这样，就得到了离散最小最大多行程定位弧形路由问题（MM-MT-LARP）的实例。本文提出了 MM-MT-LARP 的整数公式，证明了一些有效不等式族是松弛多面体的面诱导，并开发了一种基于强化公式的分支切割算法。该算法仅适用于线上无中间点的小实例。此外，我们还开发了一种 MM-MT-dLARP 的数学启发式算法，该算法结合了一个构造阶段、四个局部搜索程序（集成到一个可变邻域后裔算法中）以及一套用于选择中间点以改进解的规则。我们介绍了在一组随机生成的实例中获得的结果，这些实例最多涉及 6 个发射点和 88 条原始线路。

{"title":"The min max multi-trip drone location arc routing problem","authors":"Teresa Corberán , Isaac Plana , José María Sanchis","doi":"10.1016/j.cor.2024.106894","DOIUrl":"10.1016/j.cor.2024.106894","url":null,"abstract":"<div><div>This paper studies the Min Max Multi-Trip drone Location Arc Routing Problem (MM-MT-dLARP), an arc routing problem that combines trucks and drones. We have a set of lines (usually curved) that have to be flown over by drones to perform a service (inspection, for example). There is a depot from which the trucks leave, each one carrying a drone, and a set of potential launching points where the truck can launch and pick up the drone. Drones have limited autonomy, but they can make several flights. We consider a min–max objective, in which the makespan, or time necessary to complete the service, must be minimized. Using aerial drones instead of ground vehicles allows to travel off the network: drones can enter a line through any of its points, service only a portion of that line and then exit through another of its points, without following the lines of the network. This allows for finding better solutions but also increases the difficulty of the problem. This issue can be addressed by digitizing the MM-MT-dLARP instances, approximating each line by a polygonal chain with a finite number of intermediate points, and requiring that drones can only enter and exit a line through those intermediate points. Thus, an instance of a discrete Min Max Multi-Trip Location Arc Routing Problem (MM-MT-LARP) is obtained. Here, an integer formulation for the MM-MT-LARP is proposed, some families of valid inequalities are proved to be facet-inducing of a relaxed polyhedron, and a branch-and-cut algorithm based on the strengthened formulation is developed. This algorithm has only been applied to small instances without intermediate points on the lines. In addition, we have developed a matheuristic algorithm for the MM-MT-dLARP that combines a construction phase, four local search procedures integrated into a Variable Neighborhood Descent (VND) algorithm, and a set of rules for selecting intermediate points to improve the solutions. We present the results obtained on a set of randomly generated instances involving up to 6 launching points and 88 original lines.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"174 ","pages":"Article 106894"},"PeriodicalIF":4.1,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142652253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Facility location and restoration games 设施位置和修复游戏

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research

Pub Date : 2024-11-09 DOI: 10.1016/j.cor.2024.106896

Suzan Iloglu , Laura A. Albert , Carla Michini

Effective recovery of interdependent infrastructure systems after natural disasters requires coordination between multiple infrastructure owners, such as power and telecommunications utilities. If infrastructure owners make restoration decisions in isolation from one another, then recovery may be piecemeal. A fundamental understanding of these interdependencies can provide insights to incentivize shared restoration that benefit all infrastructure users, with the goal to maximize the social welfare even in a non-cooperative setting. We introduce a non-cooperative facility location and restoration game on a layered network, where each layer belongs to a player, to model the recovery of interdependent infrastructure systems after disasters. The goal of the model is to plan short term post-disaster recovery. The players want to minimize the cost to satisfy their own demand by restoring network components, and each player can serve the other players’ demands if they are paid a fee to do so. We propose exact and approximate algorithms to set incentives (fees) so that the players’ actions at equilibrium are aligned with a social optimum of the system, which minimizes the total cost. We present a case study in which we consider the recovery efforts of telecommunication infrastructure companies and provide results for the facility location and restoration games. The models and proposed algorithms can be used to set policy, inform the structure of inter-agency mutual aid partnerships to support disaster recovery, and negotiate inter-agency usage fees prior to a disaster to ease shared recovery efforts.

自然灾害发生后，要有效恢复相互依存的基础设施系统，需要电力和电信公用事业等多个基础设施所有者之间进行协调。如果基础设施所有者彼此孤立地做出恢复决定，那么恢复可能是零敲碎打的。从根本上了解这些相互依存关系，可以为激励共同恢复提供启示，从而使所有基础设施用户受益，即使在非合作环境下也能实现社会福利最大化的目标。我们在分层网络上引入了一个非合作设施定位和恢复博弈，其中每一层都属于一个博弈方，以模拟灾后相互依赖的基础设施系统的恢复。该模型的目标是规划短期灾后恢复。每个参与者都希望通过恢复网络组件最大限度地降低满足自身需求的成本。我们提出了设定激励机制（费用）的精确和近似算法，使参与者在均衡状态下的行动与系统的社会最优值一致，从而使总成本最小化。我们在案例研究中考虑了电信基础设施公司的恢复工作，并提供了设施选址和恢复博弈的结果。这些模型和建议的算法可用于制定政策、为机构间互助合作结构提供信息以支持灾后恢复，以及在灾难发生前协商机构间使用费以减轻共同的恢复工作。

{"title":"Facility location and restoration games","authors":"Suzan Iloglu , Laura A. Albert , Carla Michini","doi":"10.1016/j.cor.2024.106896","DOIUrl":"10.1016/j.cor.2024.106896","url":null,"abstract":"<div><div>Effective recovery of interdependent infrastructure systems after natural disasters requires coordination between multiple infrastructure owners, such as power and telecommunications utilities. If infrastructure owners make restoration decisions in isolation from one another, then recovery may be piecemeal. A fundamental understanding of these interdependencies can provide insights to incentivize shared restoration that benefit all infrastructure users, with the goal to maximize the social welfare even in a non-cooperative setting. We introduce a non-cooperative facility location and restoration game on a layered network, where each layer belongs to a player, to model the recovery of interdependent infrastructure systems after disasters. The goal of the model is to plan short term post-disaster recovery. The players want to minimize the cost to satisfy their own demand by restoring network components, and each player can serve the other players’ demands if they are paid a fee to do so. We propose exact and approximate algorithms to set incentives (fees) so that the players’ actions at equilibrium are aligned with a social optimum of the system, which minimizes the total cost. We present a case study in which we consider the recovery efforts of telecommunication infrastructure companies and provide results for the facility location and restoration games. The models and proposed algorithms can be used to set policy, inform the structure of inter-agency mutual aid partnerships to support disaster recovery, and negotiate inter-agency usage fees prior to a disaster to ease shared recovery efforts.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"174 ","pages":"Article 106896"},"PeriodicalIF":4.1,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142652247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0