Column Generation for Outbound Baggage Handling at Airports

The planning of outbound baggage handling at international airports is challenging. Outgoing flights have to be assigned and scheduled to handling facilities at which the outgoing baggage is loaded into containers. To avoid disruptions of the system the objective is to minimize workload peaks over the entire system. The resource demand of the jobs that have to be scheduled depends on the arrival process of the baggage. In this paper we present a time-indexed mathematical programming formulation for planning the outbound baggage. We propose an innovative decomposition procedure in combination with a column generation scheme to solve practical problem instances. The decomposition significantly reduces the symmetry effect in the time-indexed formulation and also speeds up the computational time of the corresponding Dantzig–Wolfe formulation. To further improve our column generation algorithm we propose state-of-the-art acceleration techniques for the primal problem and the pricing problem. Computational resu...

[1]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Raik Stolletz Analysis of passenger queues at airport terminals , 2011 .

[4]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[5]  Rainer Kolisch,et al.  Scheduling of Outbound Baggage at Airports , 2010 .

[6]  Kin F. Li,et al.  Solving the Knapsack Problem for Adaptive Multimedia Systems , 2002, Stud. Inform. Univ..

[7]  Julia Rieck,et al.  Mixed-integer linear programming for resource leveling problems , 2012, Eur. J. Oper. Res..

[8]  B. De Schutter,et al.  Predictive route control for automated baggage handling systems using mixed-integer linear programming , 2011 .

[9]  Sungsoo Park,et al.  Chebyshev center based column generation , 2011, Discret. Appl. Math..

[10]  Mariem Gzara,et al.  A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts , 2011, INFORMS J. Comput..

[11]  Jacques Desrosiers,et al.  Dual-Optimal Inequalities for Stabilized Column Generation , 2003, Oper. Res..

[12]  M. Lübbecke Column Generation , 2010 .

[13]  Edmund K. Burke,et al.  An analysis of constructive algorithms for the airport baggage sorting station assignment problem , 2014, J. Sched..

[14]  Khaled Abdelghany,et al.  Scheduling baggage-handling facilities in congested airports , 2006 .

[15]  Dimitris Bertsimas,et al.  An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems , 2002, Manag. Sci..

[16]  Ruslan Sadykov,et al.  Column Generation based Primal Heuristics , 2010, Electron. Notes Discret. Math..

[17]  Mohammad Sohel Rahman,et al.  Solving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls , 2006, Comput. Oper. Res..

[18]  Laurence A. Wolsey,et al.  An exact algorithm for IP column generation , 1994, Oper. Res. Lett..

[19]  Edmund K. Burke,et al.  The Airport Baggage Sorting Station Allocation Problem , 2011 .

[20]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[21]  M. Frey,et al.  Scheduling and planning the outbound baggage process at international airports , 2010, 2010 IEEE International Conference on Industrial Engineering and Engineering Management.

[22]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..