#Planning a computer airflow system windows

Handler GY, Zang I (1980) A dual algorithm for the constrained shortest path problem. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, Göteborg Grönkvist M (2005) The tail assignment problem. Gopalan R, Talluri KT (1998) Mathematical models in airline schedule planning: a survey. Gopalakrishnan B, Johnson EL (2005) Airline crew scheduling: state-of-the-art. PhD thesis, Department of Information Systems and Operations Research (WINFORS). Ann Oper Res 127: 203–222įriederichs S (2010) Air Cargo Schedule Planning. Transp Sci 19(2): 127–138įreling R, Lentink RM, Wagelmans AP (2004) A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm. Numerische Mathematik 1(1): 269–271Įtschmaier MM, Mathaisel DFX (1985) Airline scheduling: an overview. Networks 14(4): 545–565ĭijkstra EW (1959) A note on two problems in connexion with graphs.

#Planning a computer airflow system windows

INFOR 26(3): 191–212ĭesrosiers J, Soumis F, Desrochers M (1984) Routing with time windows by column generation. Manag Sci 43(6): 841–855ĭesrochers M, Soumis F (1988) A generalized permanent labeling algorithm for the shortest path problem with time windows. Oper Res 2(4): 393–410ĭesaulniers G, Desrosiers J, Dumas Y, Solomon MM, Soumis F (1997) Daily aircraft routing and scheduling. Comput Oper Res 33(10): 2972–2990ĭantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. Transp Sci 37(4): 368–391Ĭhabrier A (2006) Vehicle routing problem with elementary shortest path based column generation. Oper Res 48(2): 318īarnhart C, Belobaba P, Odoni AR (2003) Applications of operations research in the air transport industry. Transp Sci 32(3): 208–220īarnhart C, Hane CA, Vance PH (2000) Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Manuf Service Oper Manag 6(1): 3–22īarnhart C, Boland NL, Clarke LW, Johnson EL, Nemhauser GL, Shenot RG (1998) Flight string models for aircraft fleeting and routing. Eur J Oper Res 202(3): 756–763īarnhart C, Cohn A (2004) Airline schedule planning: accomplishments and opportunities. Decis Support Syst 22(4): 307–324Īzi N, Gendreau M, Potvin JY (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles.

University of Cologne, CologneĪntes J, Campen L, Derigs U, Titze C, Wolle GD (1998) SYNOPSE: a model-based decision support system for the evaluation of flight schedules for cargo airlines. The results show that our approach is able to find high quality solutions to problem instances of realistic size and complexity within reasonable time.Īntes J (1998) Modellbasierte Analyse von Frachtflugplänen-Konzeption, Implementierung und Anwendungspotentiale eines Bewertungsmodells für Frachtflugpläne. Thereafter, we develop a branch and price and cut approach for solving the mathematical programs and present extensive computational results obtained for a set of generated yet highly practical problem instances for different types of carriers. First, we describe the planning problem and the specific planning paradigm, develop a set of complex mixed-integer programs representing the different subproblems, and finally present integrated problem formulations as well as several model extensions. There are two main aspects which we present in this paper. belly capacities from passenger flights or road-feeder services), cargo handling costs and constraints, and aircraft maintenance regulations. Our integrated planning models comprise several additional important planning aspects for cargo airlines such as available capacities on external flights (e.g. Then the planning goal is to identify the best combination of optional flights to be included into the schedule. For this purpose, the planner has to identify mandatory and optional flights. The approach is based on integrated models and it is based on the pragmatic planning paradigm to optimally modify an existing schedule. In our research, we have developed a planning approach which differs from other OR-based planning approaches in two aspects. At cargo airlines, the four major interdependent decision problems are flight selection, fleet assignment, rotation planning, and cargo routing. Both passenger and cargo airlines usually follow a decomposition approach and break this problem into several subproblems which are then solved consecutively and iteratively using specific but isolated models. Designing a profitable flight schedule is a highly complex planning problem.