![pix4dmapper scale constraints pix4dmapper scale constraints](http://www.peruvia-gallery.com/Nasca/images/Circle_18.jpg)
Klabjan D, Johnson E, Nemhauser G, Gelman E, Ramaswamy S (2001) Solving large airline crew scheduling problems: random pairing generation and strong branching. Kasirzadeh A, Saddoune M, Soumis F (2017) Airline crew scheduling: models, algorithms, and data sets. Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) A non-robust branch-and-cut-and-price algorithm for the vehicle routing problem with time windows. In: Desaulniers G, Desrosiers J, Solomon M (eds) Column generation. Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints.
![pix4dmapper scale constraints pix4dmapper scale constraints](https://user-images.githubusercontent.com/39484220/57901391-8cd9f580-7897-11e9-952b-84b30aff0ddb.png)
Hoffman K L, Padberg M (1993) Solving airline crew scheduling problems by branch-and-cut. Gopalakrishnan B, Johnson EL (2005) Airline crew scheduling: state-of-the-art. Math Program 123(2):345–370Įlhallaoui I, Villeneuve D, Soumis F, Desaulniers G (2005) Dynamic aggregation of set partitioning constraints in column generation. Informs J Comput 23(4):569–577Įlhallaoui I, Metrane A, Soumis F, Desaulniers G (2010) Multiphase dynamic constraint aggregation for set partitioning type problems. Comput Oper Res 35(5):1713–1724Įlhallaoui I, Metrane A, Desaulniers G, Soumis F (2011) An improved primal simplex algorithm for degenerate linear programs. Public Transp 3(1):43–64Įlhallaoui I, Desaulniers G, Metrane A, Soumis F (2008) Bi-dynamic constraint aggregation and subproblem reduction. Eng Appl Artif Intel 74:54–69ĭück V, Wesselmann F, Suhl L (2011) Implementing a branch and price and cut method for the airline crew pairing optimization problem. Springer, NY, pp 1–32ĭeveci M, Demirel NÇ (2018) A survey of the literature on airline crew scheduling. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column Generation, chap. Springer, New Yorkĭesrosiers J, Lübbecke M (2005b) A primer in column generation. Elsevier, Amsterdam, pp 35–139ĭesaulniers G, Desrosiers J, Solomon MM (eds) (2005a) Column generation. In: Ball M et al (eds) Network Routing, Handbooks in Operations Research and Management Science, vol 8. In: Crainic TG, Laporte G (eds) Fleet Management and Logistics, Norwell, pp 57–93ĭesrosiers J, Dumas Y, Solomon MM, Soumis F (1995a) Time constrained routing and scheduling. European J Oper Res 97:245–259ĭesaulniers G, Desrosiers J, Ioachim I, Solomon MM, Soumis F, Villeneuve D (1998) A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. European J Oper Res 97:260–268ĭesaulniers G, Desrosiers J, Dumas Y, Marc S, Rioux B, Solomon MM, Soumis F. European J Oper Res 262:835–850Ĭhu HD, Gelman E, Johnson EL (1997) Solving large scale crew scheduling problems. Oper Res 46:316–329īouarab H, El Hallaoui I, Metrane A, Soumis F (2017) Dynamic constraint and variable aggregation in column generation. Transp Sci 32(3):221–231īarnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998b) Branch-and-price: column generation for solving huge integer programs. Comput Oper Res 36(4):1284–1298īarnhart C, Shenoi R (1998a) An approximate model and solution approach for the long-haul crew pairing problem.
#Pix4dmapper scale constraints windows
Our computational results show, first, the potential gains that can be obtained by using wider time windows and, second, the very good performance of the proposed algorithm when compared with a standard CG/RH algorithm for solving an industrial monthly CPP instance with 46,588 flights.ĪhmadBeygi S, Cohn A, Weir M (2009) An integer programming approach to generating airline crew pairings. When embedded in a rolling-horizon (RH) procedure, DCA allows to consider wider time windows in RH and yields better solutions. This algorithm combines, among others, column generation (CG) with dynamic constraint aggregation (DCA) that can efficiently exploit the CG master problem degeneracy. In this paper, we propose an effective algorithm for solving very large-scale CPP instances. Only a few papers have addressed monthly instances with up to 14,000 flights. This problem has been widely studied but most works have tackled daily or weekly CPP instances with up to 3500 flights. The monthly crew pairing problem (CPP) consists of determining a least-cost set of feasible crew pairings (sequences of flights starting and ending at a crew base) such that each flight is covered once and side constraints are satisfied.