Solving the aircraft routing problem using network flow algorithms

Roy, Kaushik; Tomlin, Claire J.

doi:10.1109/acc.2007.4282854

Cited by 9 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Much effort has been put into developing advanced traffic flow management techniques. [59,63,16,47,65,14,56,57] Currently, Traffic Management Coordinators (TMCs) monitor congested traffic situations using flight data from the Enhanced Traffic Management System (ETMS) and restrict incoming traffic flows into the sector, if necessary. The restrictions on incoming traffic flows can be implemented either by changing the arrival times of incoming aircraft, which is called metering, or imposing the proper distances between aircraft, which is called spacing.…”

Section: Motivation and Backgroundmentioning

confidence: 99%

Describing Airspace Complexity: Airspace Response to Disturbances

Lee

Féron

Pritchett

2009

Journal of Guidance, Control, and Dynamics

View full text Add to dashboard Cite

show abstract

Section: Motivation and Backgroundmentioning

confidence: 99%

Describing Airspace Complexity: Airspace Response to Disturbances

Lee

Féron

Pritchett

2009

Journal of Guidance, Control, and Dynamics

View full text Add to dashboard Cite

show abstract

“…Roy and Tomlin leverage network flow algorithms for the aircraft routing problem by initializing the network as a timeexpanded directed graph [21]. After proving that the resulting problem is NP-hard, they introduce sub-optimal solution algorithms that can be efficiently applied to large airspace problems.…”

Section: Introductionmentioning

confidence: 99%

Electric Aircraft Assignment, Routing, and Charge Scheduling Considering the Availability of Renewable Energy

Vehlhaber,

Salazar

2023

IEEE Control Syst. Lett.

View full text Add to dashboard Cite

published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User

show abstract

“…Multi-commodity flows over time are a useful tool for modelling problems that involve non-instantaneous transportation through some kind of network. Some recent examples for such problems include aircraft routing [1], cloud computing [2,3], road traffic networks [4], disaster management [5,6], evacuations [7], logistics [8,9], packet routing [10] and shared-ride systems [11].…”

Section: Introductionmentioning

confidence: 99%

A tight bound on the speed-up through storage for quickest multi-commodity flows

Groíß

Skutella

2015

Operations Research Letters

View full text Add to dashboard Cite

Multi-commodity flows over time exhibit the non-intuitive property that letting flow wait can allow us to send flow faster overall. Fleischer and Skutella (IPCO 2002) show that the speed-up through storage is at most a factor of 2, and that there are instances where the speed-up is as large as a factor of 4/3. We close this gap by presenting a family of instances for which the speed-up factor through storage converges to 2.

show abstract

Solving the aircraft routing problem using network flow algorithms

Cited by 9 publications

References 8 publications

Describing Airspace Complexity: Airspace Response to Disturbances

Describing Airspace Complexity: Airspace Response to Disturbances

Electric Aircraft Assignment, Routing, and Charge Scheduling Considering the Availability of Renewable Energy

A tight bound on the speed-up through storage for quickest multi-commodity flows

Contact Info

Product

Resources

About