Check-In Counter Planning via a Network Flow Approach

Torsten Fahle ()
Additional contact information
Torsten Fahle: Inform GmbH, Airport System Division

A chapter in Operations Research Proceedings 2011, 2012, pp 395-400 from Springer

Abstract: Abstract 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.

Keywords: Service Level; Queue Length; Arrival Pattern; Present Numerical Result; Network Simplex (search for similar items in EconPapers)
Date: 2012
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:oprchp:978-3-642-29210-1_63

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

DOI: 10.1007/978-3-642-29210-1_63

Access Statistics for this chapter

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