Abstract
In this research we developed a network model that will help the airport authorities assign flights to gates both efficiently and effectively. The model was formulated as a multi-commodity network flow problem. An algorithm based on the Lagrangian relaxation, with subgradient methods, accompanied by a shortest path algorithm and a Lagrangian heuristic was developed to solve the problem. The model was tested using data from Chiang Chiek-Shek Airport.
Original language | English |
---|---|
Pages (from-to) | 176-189 |
Number of pages | 14 |
Journal | Journal of Advanced Transportation |
Volume | 32 |
Issue number | 2 |
DOIs | |
State | Published - 1998 |