Cart (Loading....) | Create Account
Close category search window
 

Solving the aircraft routing problem using network flow algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Roy, K. ; Stanford Univ., Stanford ; Tomlin, C.J.

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.

Published in:

American Control Conference, 2007. ACC '07

Date of Conference:

9-13 July 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.