Solving the aircraft routing problem using network flow algorithms
Roy, K.
Tomlin, C.J.
Stanford Univ., Stanford;
This paper appears in: American Control Conference, 2007. ACC '07
Publication Date: 9-13 July 2007
On page(s): 3330-3335
Location: New York, NY,
ISSN: 0743-1619
ISBN: 1-4244-0988-8
INSPEC Accession Number: 9886857
Digital Object Identifier: 10.1109/ACC.2007.4282854
Current Version Published: 2007-07-30
Abstract
The aircraft routing problem (ARP) is formulated as a time-dependent network flow problem and proved to be NP-hard, using a reduction from the NP-complete 3-dimensional matching problem (3DM). Flow scheduling and dynamic network theory concepts are used to develop an Integer Program (IP) formulation of the ARP, which can be solved exactly through software such as CPLEX. Linear program (LP) relaxation and rounding techniques are used to solve this formulation in pseudo-polynomial time. A heuristic first-come-first-served (FCFS) is also implemented. Scenarios of routing under congestion and rerouting due to weather show that the FCFS has the fastest run-time but worst performance, while the IP formulation is optimal but has no guarantees on run-time. For a given time horizon, the LP formulation runs in polynomial time and is often optimal, with bounded suboptimality otherwise.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
