基于松弛两两问题闭型解析解的飞机冲突求解启发式算法

IF 0.9 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2025-09-16 DOI:10.1016/j.orl.2025.107368

Fernando H.C. Dias , Hassan L. Hijazi , David Rey

{"title":"基于松弛两两问题闭型解析解的飞机冲突求解启发式算法","authors":"Fernando H.C. Dias , Hassan L. Hijazi , David Rey","doi":"10.1016/j.orl.2025.107368","DOIUrl":null,"url":null,"abstract":"<div><div>Given a set of aircraft, the objective of the aircraft conflict resolution problem is to determine least-deviating conflict-free trajectories. Efficient algorithms for conflict resolution problems are fundamental for automation in air traffic control. We develop a fast heuristic based on the closed-form analytical solutions of convex, bound-relaxed, two-aircraft problems. We leverage this knowledge to constructs feasible and efficient solutions to multi-aircraft problems. Computational benchmarking reveals that the proposed approach is able to find near-optimal solutions in competitive time.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"63 ","pages":"Article 107368"},"PeriodicalIF":0.9000,"publicationDate":"2025-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A heuristic algorithm for aircraft conflict resolution based on closed-form analytical solutions of relaxed pairwise problems\",\"authors\":\"Fernando H.C. Dias , Hassan L. Hijazi , David Rey\",\"doi\":\"10.1016/j.orl.2025.107368\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Given a set of aircraft, the objective of the aircraft conflict resolution problem is to determine least-deviating conflict-free trajectories. Efficient algorithms for conflict resolution problems are fundamental for automation in air traffic control. We develop a fast heuristic based on the closed-form analytical solutions of convex, bound-relaxed, two-aircraft problems. We leverage this knowledge to constructs feasible and efficient solutions to multi-aircraft problems. Computational benchmarking reveals that the proposed approach is able to find near-optimal solutions in competitive time.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"63 \",\"pages\":\"Article 107368\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637725001294\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637725001294","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}

引用次数: 0

摘要

给定一组飞机，飞机冲突解决问题的目标是确定偏离最小的无冲突轨迹。有效的冲突解决算法是实现空中交通管制自动化的基础。本文提出了一种基于凸、界松弛、双平面问题的闭型解析解的快速启发式算法。我们利用这些知识来构建可行和高效的解决方案，多飞机的问题。计算基准测试表明，所提出的方法能够在竞争时间内找到接近最优的解决方案。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A heuristic algorithm for aircraft conflict resolution based on closed-form analytical solutions of relaxed pairwise problems

Given a set of aircraft, the objective of the aircraft conflict resolution problem is to determine least-deviating conflict-free trajectories. Efficient algorithms for conflict resolution problems are fundamental for automation in air traffic control. We develop a fast heuristic based on the closed-form analytical solutions of convex, bound-relaxed, two-aircraft problems. We leverage this knowledge to constructs feasible and efficient solutions to multi-aircraft problems. Computational benchmarking reveals that the proposed approach is able to find near-optimal solutions in competitive time.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Operations Research Letters 管理科学-运筹学与管理科学

CiteScore

2.10

自引率

9.10%

发文量

111

审稿时长

83 days

期刊介绍： Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.