A Constraint Programming Model for Tail Assignment

Grönkvist, Mattias

doi:10.1007/978-3-540-24664-0_10

Cited by 16 publications

(10 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using an upper bound on the cost of the optimal assignment in combination with the generalized cardinality constraint with cost, the cost-gcc global constraint, a CP-based preprocessing removes many more connections than previous preprocessing algorithms. To further improve the CP-based preprocessing, a pure CP model for the tail assignment problem is presented in Grönkvist (2004) that implements stronger domain filtering algorithms. The proposed model has a constraint that embeds the resource constrained shortest path algorithm previously implemented for solving the pricing subproblem of the regular column generation procedure.…”

Section: Tail Assignment Problemmentioning

confidence: 99%

Constraint programming-based column generation

Gualandi

Malucelli

2009

4OR-Q J Oper Res

View full text Add to dashboard Cite

This paper surveys recent applications and advances of the constraint programming-based column generation framework, where the master subproblem is solved by traditional OR techniques, while the pricing subproblem is solved by constraint programming (CP). This framework has been introduced to solve crew assignment problems, where complex regulations make the pricing subproblem demanding for traditional techniques, and then it has been applied to other contexts. The main benefits of using CP are the expressiveness of its modeling language and the flexibility of its solvers. Recently, the CP-based column generation framework has been applied to many other problems, ranging from classical combinatorial problems such as graph coloring and two dimensional bin packing, to application oriented problems, such as airline planning and resource allocation in wireless ad hoc networks.

show abstract

Section: Tail Assignment Problemmentioning

confidence: 99%

Constraint programming-based column generation

Gualandi

Malucelli

2009

4OR-Q J Oper Res

View full text Add to dashboard Cite

show abstract

“…In Grönkvist (2004), we present a constraint programming model for the Tail Assignment problem, which we briefly cover here as background for the following sections. The constraint model focuses only on feasibility, i.e.…”

Section: A Constraint Programming Solution Approachmentioning

confidence: 99%

“…In Grönkvist, Grönkvist (2004, 2006 we have shown how constraint programming can be used as a standalone solution method, and as a preprocessing method, for the Tail Assignment problem. The second contribution of this article is a complete solution approach, which uses a novel combination of constraint programming and column generation to address the diverse requirements of long term planning and operations management.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Combining column generation and constraint programming to solve the tail assignment problem

Gabteni

Grönkvist

2008

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

Within the area of short term airline operational planning, Tail Assignment is the problem of assigning flight legs to individual identified aircraft while satisfying all operational constraints, and optimizing some objective function. In this article, we propose that Tail Assignment should be solved as part of both the short and the long term airline planning. We further present a hybrid column generation and constraint programming solution approach. This approach can be used to quickly produce solutions for operations management, and also to produce close-to-optimal solutions for long and mid term planning scenarios. We present computational results which illustrate the practical usefulness of the approach.

show abstract

“…Among other things it has been deployed in planning for transportation: Grönkvist [7] uses constraint programming to solve the tail assignment problem, an airline planning variant. Gabteni and Grönkvist [3] combine this with techniques from integer programming, in order to obtain a complete solver and optimizer, which is currently in use at a number of medium-sized airlines.…”

Section: Introductionmentioning

confidence: 99%

Randomization in Constraint Programming for Airline Planning

Otten

Grönkvist

Dubhashi

2006

Principles and Practice of Constraint Programming - CP 2006

Self Cite

View full text Add to dashboard Cite

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.

show abstract

A Constraint Programming Model for Tail Assignment

Cited by 16 publications

References 7 publications

Constraint programming-based column generation

Constraint programming-based column generation

Combining column generation and constraint programming to solve the tail assignment problem

Randomization in Constraint Programming for Airline Planning

Contact Info

Product

Resources

About