| Type of Document |
Master's Thesis |
| Author |
Brown, Eric L
|
| URN |
etd-07212009-040541 |
| Title |
A quadratic partial assignment and packing model and algorithm for the airline gate assignment problem |
| Degree |
Master of Science |
| Department |
Industrial and Systems Engineering |
| Advisory Committee |
| Advisor Name |
Title |
| Sherali, Hanif D. |
Committee Chair |
| Sarin, Subhash C. |
Committee Member |
| Trani, Antonio A. |
Committee Member |
|
| Keywords |
|
| Date of Defense |
1995-03-05 |
| Availability |
restricted |
Abstract
This thesis is concerned with an Airline Gate Assignment problem that seeks to allocate gates to aircraft at an airport, using the objective of minimizing passenger walking distances. The problem is modeled as a variant of the quadratic assignment problem with set packing constraints. The quadratic objective function is then transformed into an equivalent linearized form by applying the first-order linearization technique of Sherali and Adams [1989, 1990]. In addition to linearizing the problem, the application of this technique generates additional constraints that provide a tighter linear programming representation. A suitable solution process that exploits the structure of the linearized problem is developed. Test results are presented using realistic data obtained from USAIR.
|
| Files |
| Filename |
Size |
Approximate Download Time
(Hours:Minutes:Seconds) |
| 28.8 Modem |
56K Modem |
ISDN (64 Kb) |
ISDN (128 Kb) |
Higher-speed Access |
![[VT]](http://scholar.lib.vt.edu/images/ETD-db/restricted.gif) |
LD5655.V855_1995.B769.pdf |
3.78 Mb |
00:17:30 |
00:09:00 |
00:07:52 |
00:03:56 |
00:00:20 |
![[BTD]](http://scholar.lib.vt.edu/images/ETD-db/btd.gif)
next to an author's name indicates that all
files or directories associated with their ETD
are accessible from the Virginia Tech campus network only.
|