×

zbMATH — the first resource for mathematics

The over-constrained airport gate assignment problem. (English) Zbl 1075.90006
Summary: We study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated flights and total walking distances or connection times. We first use a greedy algorithm to minimize ungated flights. Exchange moves are employed to facilitate the use of heuristics. Simulated annealing and a hybrid of simulated annealing and tabu search are used. Experimental results are good and exceed those previously obtained.

MSC:
90B06 Transportation, logistics and supply chain management
90B40 Search theory
90C59 Approximation methods and heuristics in mathematical programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Braaksma, J.P.; Shortreed, J.H., Improving airport gate usage with critical path method, Transportation engineering journal of ASCE, 97, 2, 187-203, (1971)
[2] Obata T. The quadratic assignment problem: evaluation of exact and heuristic algorithms. Technical Report TRS-7901, Rensselaer Polytechnic Institute, Troy, New York, 1979.
[3] Babic, O.; Teodorovic, D.; Tosic, V., Aircraft stand assignment to minimize walking, Journal of transportation engineering, 110, 55-66, (1984)
[4] Mangoubi, D.F.X.; Mathaisel, R.S., Optimizing gate assignments at airport terminals, Transportation science, 19, 173-188, (1985)
[5] Bihr, R., A conceptual solution to the aircraft gate assignment problem using 0,1 linear programming, Computers and industrial engineering, 19, 280-284, (1990)
[6] Wirasinghe, S.C.; Bandara, S., Airport gate position estimation for minimum total costs—approximate closed form solution, Transportation research B, 24B, 4, 287-297, (1990)
[7] Yan, S.; Chang, C.-.M., A network model for gate assignment, Journal of advanced transportation, 32, 2, 176-189, (1998)
[8] Baron, P., A simulation analysis of airport terminal operations, Transportation research, 3, 481-491, (1969)
[9] Cheng, Y., Network-based simulation of aircraft at gates in airport terminals, Journal of transportation engineering, 124, 188-196, (1998)
[10] Cheng, Y., A rule-based reactive model for the simulation of aircraft on airport gates, Knowledge-based systems, 10, 225-236, (1998)
[11] Hassounah, M.I.; Steuart, G.N., Demand for aircraft gates, Transportation research, 1423, 22-33, (1993)
[12] Yan, S.; Huo, C.-.M., Optimization of multiple objective gate assignments, Transportation research part A: policy and practice, 35, 413-432, (2001)
[13] Zhu Y, Lim A, Rodrigues B. Aircraft and gate scheduling with time windows. In: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence, Sacramento, Califorina, USA, 2003.
[14] Bolat, A., Assigning arriving aircraft flights at an airport to available gates, Journal of the operational research society, 50, 23-34, (1999) · Zbl 1054.90544
[15] Bolat, A., Procedures for providing robust gate assignments for arriving aircraft, European journal of operations research, 120, 63-80, (2000) · Zbl 0979.90084
[16] Gu, Y.; Chung, C.A., Genetic algorithm approach to aircraft gate reassignment problem, Journal of transportation engineering, 125, 5, 384-389, (1999)
[17] Haghani, A.; Chen, M.C., Optimizing gate assignments at airport terminals, Transportation research A, 32, 6, 437-454, (1998)
[18] Xu J, Bailey G. The airport gate assignment problem: Mathematical model and a tabu search algorithm. In: Proceedings of the 34th Hawaii International Conference on System Sciences, Island of Maui, Hawaii, USA, 2001.
[19] Ding H, Lim A, Rodrigues B, Zhu Y. Aircraft and gate scheduling optimization at airports. In: Proceedings of the 37th Hawaii International Conference on System Sciences, Big Island, Hawaii, USA, 2003.
[20] Kirkpatrick, S.; Gellatt, C.D.; Vecchi, M.P., Optimization by simulated annealing, Science, 220, 4598, 671-680, (1993) · Zbl 1225.90162
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.