Randomization in Constraint Programming for Airline Planning

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.

• Type: Conference
• Year: 2006
• Where: CP
• Authors: Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi
• Keywords: Artificial Intelligence, Constraint Satisfaction Problems, CP 2006, Depth-first Backtrack Search, Tail Assignment Problem