The Optimization Model of Runway and Gate Assignment

Authors

  • Nahry , Department of Civil Engineering, Faculty of Engineering, Universitas Indonesia
  • Tjahjono, T. Department of Civil Engineering, Faculty of Engineering, Universitas Indonesia
  • Satiti, Y.J. Department of Civil Engineering, Faculty of Engineering, Universitas Indonesia

DOI:

https://doi.org/10.9744/ced.15.2.129-136

Keywords:

Apron gate time slot, network representation, minimum cost flow, maximum matching, Runway time slot.

Abstract

This paper is aimed to develop the optimization model of time slot utilization for both runway and apron gate of airport system. The model considers the objectives of airline company to minimize flight-taxiing-time and waiting-time for both landing and take-off. The optimization makes use of Network Representation (NR) in the form of two bipartite networks in order to transform the problem of runway and apron gate assignment into the network flow problem. Maximum Matching and Minimum Cost Flow on NR are the core of the model. An illustrative example is presented. The result shows that the model could increase both runway and apron gate capacities to as close as their theoretical capacities. Compared to the common practice which concerns only; the nearest available runway slot time, behind the scheduled time, and the nearest location of available gates to serve the flight, the model could reduce the total taxiing and waiting time.

References

Neufville, R. and Odoni, A., Airport Systems. Planning, Design and Management, McGraw Hill, USA, 2003.

Abeyratne, R.I.R., Management of Airport Congestion through Slot Allocation, Journal of Air Transport Management, 6, 2000, pp. 29-41.[CrossRef]

Madas, M.A. and Zografos, K.G., Airport Slot Alocation: From Instrument to Strategy, Journal of Air Transport Management, 12, 2006, pp. 53-62. [CrossRef]

Madas, M.A. and Zografos, K.G., Airport Capacity vs Demand: Mismatch or Mismanagement?, Transportation Research, Part A, 42, 2008, pp. 203-226.[CrossRef]

Zografos, K.G., Salouras, Y., and Madas, M.A., Dealing with the Efficient Allocation of Scarce Resources at Congested Airports, Transportation Research, Part C, 21, 2012, 244-256.

Minieka, E., Optimization Algorithms for Networks and Graphs, Marcel Dekker Inc., NewYork, 1978.

Ahuja, R.K., Magnanti, T.L., and Orlin, J.B., Network, Prentice Hall, New Jersey, 1993.

Downloads

Published

2013-09-12

How to Cite

, N., T., T., & Y.J., S. (2013). The Optimization Model of Runway and Gate Assignment. Civil Engineering Dimension, 15(2), 129–136. https://doi.org/10.9744/ced.15.2.129-136

Issue

Vol. 15 No. 2 (2013): SEPTEMBER 2013

Section

Articles

License

Authors who publish with this journal agree to the following terms:
  1. Authors retain the copyright and publishing right, and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) followingthe publication of the article, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).