Using a set packing formulation to solve airline seat allocation/reallocation problems

9Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

We report our experience in developing prototype solutions for two optimization problems faced by an airline company. Whereas previous work has focused on minimizing direct costs or maximizing direct profits, both problems in this case involve maximizing customer satisfaction. One is the seat allocation problem: given a set of groups of passengers, find the optimal assignment of passengers to seats in an aircraft so that each member of a group sits as near to the others as possible. The other is the seat reallocation problem, which arises when the aircraft is changed just before departure. It consists in finding the optimal reallocation of passengers in a new aircraft so that the original seat configuration is retained as far as possible. We formulate both as instances of the set packing problem and propose efficient methods for generating promising candidate subsets. We show through numerical experiments with real-life data that our approach is practical as regards both the computation time and the quality of solutions.

Cite

CITATION STYLE

APA

Tajima, A., & Misono, S. (1999). Using a set packing formulation to solve airline seat allocation/reallocation problems. Journal of the Operations Research Society of Japan, 42(1), 32–44. https://doi.org/10.15807/jorsj.42.32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free