Check-In Counter Planning via a Network Flow Approach
Finding an appropriated number of open check-in counters is a typical planning problem on an airport. The problem has to take into account the flight plan, the arrival patterns of passengers and a given service level (max. waiting time of a passenger before being served). The goal is to generate a schedule for the check-in counters that uses as few as possible check-in counters per time. We present a network flow formulation for this problem and discuss additional constraints relevant for real-world scenarios. We show how to solve the model and present numerical results on artificial as well as on real-world data. The model is part of the Inform GroundStar suite that successful is in use on more than 200 airports world-wide.
KeywordsService Level Queue Length Arrival Pattern Present Numerical Result Network Simplex
Unable to display preview. Download preview PDF.
- 1.Ahuja, R.K., Magnati, T.L., Orlin, J.B.: Network Flows. Prentice Hall (1993)Google Scholar
- 2.CLP. Available from COIN-OR at http://www.coin-or.org/projects/Clp.xml. Cited 27 Jun 2011.
- 4.Loebl, A.: MCF Version 1.3 - A network simplex implementation (2004). Available for academic use free of charge http://www.zib.de. Cited 27 Jun 2011.
- 5.van Dijk, van Sluis: Check-In computation and Optimization by simulation and IP in combination, EJOR 171, 1152–1168 (2006)Google Scholar