Mathematical formulations for large scale check-in counter allocation problem

Lalita, T R; Manna, D. K.; Murthy, G. S. R.

doi:10.1016/j.jairtraman.2020.101796

Cited by 11 publications

(5 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A set of flights F , a set of check-in counters C located in a terminal, and a time interval of T consecutive time slots are the input of the problem. Each check-in counter is associated to a single company; hence it is assumed that the Check-in assignment problem has been already solved [ 30 , 31 ]. usually a check-in desk can be common or dedicated .…”

Section: Problem Descriptionmentioning

confidence: 99%

Optimization of airport check-in service quality focused on operational costs and passengers’ satisfaction

Adacher

Flamini

2021

PLoS ONE

View full text Add to dashboard Cite

Passengers’ requirements in relation to the Airport Service Quality is rapidly increasing and forcing companies and airport management to improve the services performances. It is clear that this enhancement can not overlook the implication of competitive issues and economic concerns. In this paper the authors deal with the optimization of the check-in area management in the international airport of Lisbon. The proposed bi-criteria objective function minimizes the operational costs plus the costs measuring the passengers’ discomfort in terms of waiting time in line. The quality of the supplied check-in service is measured and mapped into the Levels of Service system standardized by the International Air Transport Association. The type of passengers and their stochastic behavior and preferences are simulated by a discrete event model. The operational costs and the passengers’ satisfaction are optimized by an algorithm based on the Surrogate Method, the performance of which are compared to those of a greedy heuristic and of a genetic algorithm.

show abstract

Section: Problem Descriptionmentioning

confidence: 99%

Optimization of airport check-in service quality focused on operational costs and passengers’ satisfaction

Adacher

Flamini

2021

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…Bruno et al (2019) extend the model further by incorporating a staff scheduling component. Lalita et al (2020) propose an integer programming model that attempts to enforce FCFS queue discipline, by ensuring that sufficient check-in capacity is available.…”

Section: Airport Check-in Counter Allocationmentioning

confidence: 99%

Combining Optimization and Simulation Using Logic-Based Benders Decomposition

Forbes¹,

Harris²,

Jansen³

et al. 2021

Preprint

View full text Add to dashboard Cite

Operations research practitioners frequently want to model complicated functions that are difficult to encode in their underlying optimization framework. A common approach in the literature is to solve an approximate model, and to use a simulation to evaluate the true objective value of one or more solutions. We propose a new approach-Branch-and-Simulate-for integrating simulation into the optimization model itself. Branch-and-Simulate is a variant of logic-based Benders decomposition where we run a simulation at each incumbent solution to the master problem. The simulation data is then used to guide the trajectory of the optimization model, via Benders cuts. We test the approach on a class of stochastic resource allocation problems with monotonic performance measures. We derive strong Benders cuts which are valid for all problems of this form. We consider two concrete examples: an airport check-in counter allocation problem, and a nursing home shift scheduling problem. Whereas previously these problems could only be solved approximately, we solve challenging instances to optimality within a reasonable amount of time. In the appendix, we will also use Branch-and-Simulate to approximately solve an ambulance location problem.

show abstract

“…Different approaches in MILP (mixed-integer linear programming) have been proposed (Yan, Tang, and Chen 2004;Araujo and Repolho 2015). A recent survey (Lalita and Murthy 2022) presents different methods for solving this problem using integer programming or dynamic programming. Because significant improvements have been made during the last decade in Constraint Programming (CP), such as, e.g., efficient filtering (and compression) algorithms for table constraints (Le Charlier et al 2017;Demeulenaere et al 2016), or lazy clause generation (G. Chu et al 2011), tackling optimization of airport tasks with CP remains an interesting issue.…”

Section: Introductionmentioning

confidence: 99%

Check-In Desk Scheduling Optimisation at CDG International Airport

Falque,

Audemard,

Lecoutre

et al. 2024

AAAI

View full text Add to dashboard Cite

More than ever, air transport players (i.e., airline and airport companies) in an intensely competitive climate need to benefit from a carefully optimized management of airport resources to improve the quality of service and control the induced costs. In this paper, we investigate the Airport Check-in Desk Assignment Problem. We propose a Constraint Programming (CP) model for this problem, and present some promising experimental results from data coming from ADP (Aéroport de Paris). Our works are deployed in a preprod environment since 1 year.

show abstract

Mathematical formulations for large scale check-in counter allocation problem

Cited by 11 publications

References 19 publications

Optimization of airport check-in service quality focused on operational costs and passengers’ satisfaction

Optimization of airport check-in service quality focused on operational costs and passengers’ satisfaction

Combining Optimization and Simulation Using Logic-Based Benders Decomposition

Check-In Desk Scheduling Optimisation at CDG International Airport

Contact Info

Product

Resources

About