Randomization in constraint programming for airline planning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4204 LNCS, Issue , 2006, Pages 406-420

  Otten, Lars ^a   Grönkvist, Mattias ^a,b   Dubhashi, Devdatt ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b Jeppesen Systems AB   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AIR TRANSPORTATION; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; PROBLEM SOLVING;

AIRLINE PLANNING; RANDOMIZED VARIABLES; REAL-WORLD INSTANCES; TAIL ASSIGNMENT PROBLEMS;

RANDOM PROCESSES;

EID: 33750293441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_30     Document Type: Conference Paper

References (15)

1. E. Bach: Realistic analysis of some randomized algorithms. Journal of Computer and System Sciences 42 (1991): 30-53.
2. C. Barnhart, N. L. Boland, L. W. Clarke, E. L. Johnson, G. L. Nemhauser, and R. G. Shenoi: Flight string models for aircraft fleeting and routing. Transportation Science 32 (1998): 208-220.
3. S. Gabteni and M. Grönkvist: A hybrid column generation and constraint programming optimizer for the tail assignment problem. In Proceedings of CPAIOR'06.
4. C. Gomes, B. Selman, N. Crato, and H. Kautz: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24 (2000): 67-100.
5. C. Gomes, B. Selman, and H. Kautz: Boosting combinatorial search through randomization. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI'98).
6. R. Gopalan and K. T. Talluri: Mathematical models in airline schedule planning: A survey. Annals of Operations Research 76 (1998): 155-185.
7. M. Grönkvist: A constraint programming model for tail assignment. In Proceedings of CPAIOR'04: 142-156.
8. M. Grönkvist: The tail assigment problem. PhD thesis, Chalmers University of Technology, Gothenburg, Sweden (2005).
9. D. H. Lehmer: Mathematical methods in large-scale computing units. In Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery (1949): 141-146.
10. M. Luby, A. Sinclair, and D. Zuckerman: Optimal speedup of Las Vegas algorithms. Information Processing Letters, Vol. 47 (1993): 173-180.
11. K. Mulmuley: Randomized Geometric Algorithms and Pseudorandom Generators. Algonthmica 16 (1996): 450-463.
12. T. Walsh: Search in a small world. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99): 1172-1177.
13. R. Williams, C. Gomes, and B. Selman: Backdoors to typical case complexity. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI'03).
14. R. Williams, C. Gomes, and B. Selman: On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search. In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT'03).
15. Gecode: Generic constraint development environment, http://www.gecode. org/