Multi-Aircraft Flight Planning Under Uncertainty Zehra Akyurt.

Slides:



Advertisements
Similar presentations
PowerPoint Slides by Robert F. BrookerCopyright (c) 2001 by Harcourt, Inc. All rights reserved. Linear Programming Mathematical Technique for Solving Constrained.
Advertisements

Airline Schedule Optimization (Fleet Assignment I)
Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.
1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
Chapter 19 – Linear Programming
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Lesson 11 Multicriteria Decisions within LP Framework.
Basic Feasible Solutions: Recap MS&E 211. WILL FOLLOW A CELEBRATED INTELLECTUAL TEACHING TRADITION.
Applications of Stochastic Programming in the Energy Industry Chonawee Supatgiat Research Group Enron Corp. INFORMS Houston Chapter Meeting August 2, 2001.
Math443/543 Mathematical Modeling and Optimization
Network Optimization Models: Maximum Flow Problems In this handout: The problem statement Solving by linear programming Augmenting path algorithm.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Linear Programming Integer Linear Models. When Variables Have To Be Integers Example – one time production decisions –Fractional values make no sense.
Linear Programming – Max Flow – Min Cut Orgad Keller.
MODEL FOR FLIGHT LEVEL ASSIGNMENT PROBLEM ICRAT International Conference on Research in Air Transportation Alfred Bashllari National & Kapodistrian.
Airline Schedule Optimization (Fleet Assignment II) Saba Neyshabouri.
FORMULATION AND GRAPHIC METHOD
Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
Optimization sheet (1).
1 Capacity Planning under Uncertainty Capacity Planning under Uncertainty CHE: 5480 Economic Decision Making in the Process Industry Prof. Miguel Bagajewicz.
MIT ICAT ICATMIT M I T I n t e r n a t i o n a l C e n t e r f o r A i r T r a n s p o r t a t i o n Virtual Hubs: A Case Study Michelle Karow
Section 2.9 Maximum Flow Problems Minimum Cost Network Flows Shortest Path Problems.
D Nagesh Kumar, IIScOptimization Methods: M1L3 1 Introduction and Basic Concepts (iii) Classification of Optimization Problems.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Introduction to Linear Programming BSAD 141 Dave Novak.
Discriminant Functions
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Optimal Content Delivery with Network Coding Derek Leong, Tracey Ho California Institute of Technology Rebecca Cathey BAE Systems CISS 2009 March 19, 2009.
Chapter 1. Formulations 1. Integer Programming  Mixed Integer Optimization Problem (or (Linear) Mixed Integer Program, MIP) min c’x + d’y Ax +
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
Network Flow. Network flow formulation A network G = (V, E). Capacity c(u, v)  0 for edge (u, v). Assume c(u, v) = 0 if (u, v)  E. Source s and sink.
Goal Programming Linear program has multiple objectives, often conflicting in nature Target values or goals can be set for each objective identified Not.
DISTRIBUTION AND NETWORK MODELS (1/2)
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
8/14/04 J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 6 – Integer Programming Models Topics.
Lecture 6 – Integer Programming Models Topics General model Logic constraint Defining decision variables Continuous vs. integral solution Applications:
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
Linear Programming Chapter 1 Introduction.
Computationally speaking, we can partition problems into two categories. Easy Problems and Hard Problems We can say that easy problem ( or in some languages.
Management Science 461 Lecture 4b – P-median problems September 30, 2008.
St. Edward’s University
Introduction to Linear Programs
6.5 Stochastic Prog. and Benders’ decomposition
Basic Project Scheduling
Chapter 1. Introduction Mathematical Programming (Optimization) Problem: min/max
Linear Programming Wyndor Glass Co. 3 plants 2 new products
EMIS 8373: Integer Programming
1.3 Modeling with exponentially many constr.
1.206J/16.77J/ESD.215J Airline Schedule Planning
1.206J/16.77J/ESD.215J Airline Schedule Planning
Integer Programming (정수계획법)
Stochastic Network Interdiction
1.206J/16.77J/ESD.215J Airline Schedule Planning
L12. Network optimization
Introduction Basic formulations Applications
Chapter 1. Formulations (BW)
1.3 Modeling with exponentially many constr.
Integer Programming (정수계획법)
EE 458 Introduction to Optimization
Chapter 6 Network Flow Models.
1 1 Find a maximum Matching ? Women Men.
6.5 Stochastic Prog. and Benders’ decomposition
Dr. Arslan Ornek DETERMINISTIC OPTIMIZATION MODELS
Chapter 1. Formulations.
Network Optimization Models: Maximum Flow Problems
EMIS The Maximum Flow Problem: Flows and Cuts Updated 6 March 2008
Presentation transcript:

Multi-Aircraft Flight Planning Under Uncertainty Zehra Akyurt

Problem Description Multiple aircraft belonging to different airlines Possibility of facing Temporary Flight Restrictions (TFR)s en route TFR reduces capacity of airspace which it covers Need to find optimal routes for aircraft given stochastic travel conditions.

Example

Multi-Objectives Minimize Cost: Minimize total expected travel time of all aircraft. Maximize Equity: Minimize the expected differences of total time traveled, between airlines.

Stochastic Program Will use a multi-stage scenario based stochastic program formulation. What will a scenario be? A joint realization of all the TFRs. What will a stage be? Any point at which new decisions must be made

Assumptions Aircraft are assumed to have equal velocity TFRs are assumed independent Stochastic program formulation not totally correct.

Space –Time Network x2x2 x1x1 x3x3 y1y1 y2y2 y3y3 z1z1 z3z3 z5z5 z2z2 z4z4 z6z6

Program Formulation Objective-1 Objective-2 Conservation of Flow Constraints Arc Capacity Constraints Non- Anticipativity Constraints

Obstacles in Formulation Used Xpress-MP to test model Second objective contains absolute value Added additional constraints to overcome this obstacle (see Chvatal) Example:

Program is now linear! Had to add integer constraints Program is no longer linear, nor convex Used two general methods to solve the two-objective integer program: Weighting method Constraint method Obstacles in Formulation

Sample Problem Set p 1 =1,p 2 =0 c 1 =2,c 2 =3, all other arcs have capacity=5 3 airlines with 2,3 and 4 aircraft respectively = 9 aircraft (4,5) (2,2) (3,5) (4,5) (6,5) (8,5) (11,5) (7,5) F=9

Results

Recall : Objectives were Min Total Travel Time Min Total Deviations

Questions?