A novel constraint propagation approach for airline schedule design problem

Sumit Raut, Viswanath Kumar Ganesan and J.K. Jha

International Journal of Mathematics in Operational Research, 2017, vol. 10, issue 4, 485-501

Abstract: In this paper, we propose a novel finite domain constraint programming formulation using constraint propagation (CP) approach with variable and value ordering for solving flight scheduling problem. We subsequently model the same problem using time-space network representation and integer linear programming (ILP) technique. The performance of the CP and ILP models are evaluated on simulated and a real life case. The ILP and CP models are solved using CPLEX 12.2 solver and CP optimiser 12.2, respectively. We observe that the ILP model generates better first feasible solutions, while the CP model produces faster feasible solutions. In few cases, the CP model takes longer time compared to the ILP model. For the case data with 600 aircrafts and 1,000 markets, the CP model generates feasible solution rather faster, while the ILP model could not find feasible solution in a day for defined time-space network flow problem with some additional constraints.

Keywords: airlines schedule design; constraint propagation; variable and value ordering. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=84162 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:10:y:2017:i:4:p:485-501

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().