Advertisement

Abstract

We describe a Constraint Programming model for the Tail Assignment problem in airline planning. Previous solution methods for this problem aim at optimality rather than obtaining a solution quickly, which is often a drawback in practice, where quickly obtaining solutions can be very important. We have developed constraints that use strong reachability propagation and tunneling to a column generation pricing problem to form a complete and flexible constraint model for Tail Assignment which is able to quickly find solutions. Results on real-world instances from a medium size airline are presented.

Keywords

Column Generation Vehicle Route Problem Constraint Model Crew Schedule Constraint Program Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Clarke, L.W., Johnson, E.L., Nemhauser, G.L., Zhu, Z.: The Aircraft Rotation Problem. Annals of Operations Research 69, 33–46 (1997)zbMATHCrossRefGoogle Scholar
  2. 2.
    de Backer, B., Furnon, V., Kilby, P., Prosser, P., Shaw, P.: Solving Vehicle Routing Problems using Constraint Programming and Metaheuristics. Journal of Heuristics 1(16) (1997)Google Scholar
  3. 3.
    Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Daily Aircraft Routing and Scheduling. Management Science 43(6), 841–855 (1997)zbMATHCrossRefGoogle Scholar
  4. 4.
    Desrochers, M., Soumis, F.: A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR 26(3), 191–212 (1988)zbMATHGoogle Scholar
  5. 5.
    Elf, M., Jünger, M., Kaibel, V.: Rotation Planning for the Continental Service of a European Airline. In: Jager, W., Krebs, H.-J. (eds.) Mathematics – Key Technologies for the Future. Joint Projects between Universities and Industry, pp. 675–689. Springer, Heidelberg (2003)Google Scholar
  6. 6.
    Erling, G., Rosin, D.: Tail Assignment with Maintenance Restrictions - A Constraint Programming Approach. Master’s thesis, Chalmers University of Technology, Gothenburg, Sweden (2002)Google Scholar
  7. 7.
    Fahle, T., Junker, U., Karisch, S., Kohl, N., Sellmann, M., Vaaben, B.: Constraint Programming Based Column Generation for Crew Assignment. Journal of Heuristics 8(1), 59–81 (2002)zbMATHCrossRefGoogle Scholar
  8. 8.
    Gamache, M., Soumis, F., Marquis, G., Desrosiers, J.: A Column Generation Approach for Large-Scale Aircrew Rostering Problems. Operations Research 47(2), 247–263 (1999)zbMATHCrossRefGoogle Scholar
  9. 9.
    Gopalan, R., Talluri, K.T.: The Aircraft Maintenance Routing Problem. Operations Research 46(2), 260–271 (1998)zbMATHCrossRefGoogle Scholar
  10. 10.
    Grönkvist, M.: Tail Assignment – A Combined Column Generation and Constraint Programming Approach. Lic. Thesis, Chalmers University of Technology, Gothenburg, Sweden (2003)Google Scholar
  11. 11.
    Grönkvist, M.: Using Constraint Propagation to Accelerate Column Generation in Aircraft Scheduling. In: Proceedings of CPAIOR 2003 (May 2003)Google Scholar
  12. 12.
    Halatsis, C., Stamatopoulos, P., Karali, I., Bitsikas, T., Fessakis, G., Schizas, A., Sfakianakis, S., Fouskakis, C., Koukoumpetsos, T., Papageorgiou, D.: Crew Scheduling Based on Constraint Programming: The PARACHUTE Experience. In: Proceedings of the 3rd Hellenic-European Conference on Mathematics and Informatics HERMIS 1996, pp. 424–431 (1996)Google Scholar
  13. 13.
    Hjorring, C., Hansen, J.: Column generation with a rule modelling language for airline crew pairing. In: Proceedings of the 34th Annual Conference of the Operational Research Society of New Zealand, Hamilton, New Zealand, pp. 133–142 (December 1999)Google Scholar
  14. 14.
    Kilborn, E.: Aircraft Scheduling and Operation – a Constraint Programming Approach. Master’s thesis, Chalmers University of Technology, Gothenburg, Sweden (2000)Google Scholar
  15. 15.
    Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of AAAI 1994, pp. 362–367 (1994)Google Scholar
  16. 16.
    Rousseau, L.-M., Gendreau, M., Pesant, G.: Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows. Journal of Heuristics 8(1), 43–58 (2002)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Mattias Grönkvist
    • 1
  1. 1.Carmen SystemsGöteborgSweden

Personalised recommendations