Allocation of Airport Check-in Counters Using a Simulation-Optimization Approach

Miguel Mujica Mota () and Catya Zuniga Alcaraz ()
Additional contact information
Miguel Mujica Mota: Amsterdam University of Applied Sciences, Aviation Academy
Catya Zuniga Alcaraz: Universidad Popular Autonoma del Estado de Puebla, Logistics & Supply Chain Management Department

A chapter in Applied Simulation and Optimization, 2015, pp 203-229 from Springer

Abstract: Abstract The aviation industry is expected to grow at a pace of 4 % per annum in the coming years, therefore it is necessary to have techniques that support the management of the resources at hand in the best possible way so that facility expansion is delayed as much as possible with the corresponding capital savings. This chapter presents a methodology that combines evolutionary algorithms and simulation for performing the allocation of the check-in desks in such a way that the different stochastic and deterministic variables are taken into account for a more robust solution. The evolutionary algorithm is developed to satisfy the different mandatory restrictions for the allocation problem such as minimum and maximum number of check-in desks per flight, load balance at the counters, opening times of check-in desks, and other restrictions imposed by the level of service agreement. Once the solutions are obtained, a second evaluation is performed using a simulation model of the terminal that takes into account the stochastic aspects of the problem such as passenger arrival profiles, passenger profile, layout of the facility, among others, with the purpose of determining an airport terminal’s check-in area which allocation is the most efficient in real situations to keep the quality indicators at the desired level. The example presented is for an airport terminal’s check-in area, but the methodology can be used for similar allocation problems in the aviation industry and in other industries such as logistics or manufacturing.

Keywords: Evolutionary Algorithm; Constraint Satisfaction Problem; Flight Plan; Terminal Area; Integer Programming Approach (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-15033-8_7

Ordering information: This item can be ordered from
http://www.springer.com/9783319150338

DOI: 10.1007/978-3-319-15033-8_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().