Randomization in constraint programming for airline planning

Authors:
Lars Otten;Mattias Grönkvist;Devdatt Dubhashi
Affiliations:
Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden;Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden;Department of Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 8
Cited 1

Realistic analysis of some randomized algorithms

Journal of Computer and System Sciences
Optimal speedup of Las Vegas algorithms

Information Processing Letters
Boosting combinatorial search through randomization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

Journal of Automated Reasoning
Flight String Models for Aircraft Fleeting and Routing

Transportation Science
Search in a small world

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Backdoors to typical case complexity

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A hybrid column generation and constraint programming optimizer for the tail assignment problem

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Boosting distributed constraint satisfaction

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to real-world instances of the tail assignment problem, a certain kind of airline planning problem. We analyze the performance impact of these extensions and, in order to exploit the improvements, add restarts to the search procedure. Finally computational results of the complete approach are discussed.