MODEL FOR FLIGHT LEVEL ASSIGNMENT PROBLEM ICRAT 2004 - International Conference on Research in Air Transportation Alfred Bashllari National & Kapodistrian.

Slides:



Advertisements
Similar presentations
Using dynamic flow network modeling for global flight plan optimization CARE workshop 14th –15th March 2001, EUROCONTROL Brussels. Dritan Nace Heudiasyc.
Advertisements

Airline Schedule Optimization (Fleet Assignment I)
Outline LP formulation of minimal cost flow problem
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
1 Lecture 2 Shortest-Path Problems Assignment Problems Transportation Problems.
Dynamic Programming In this handout A shortest path example
FTP Biostatistics II Model parameter estimations: Confronting models with measurements.
EUROCONTROL CRDS 22-24/11/2004 ICRAT 1/15 ICRAT 2004, Zilina, November 22-24, 2004 Towards the traffic synchronisation in a Functional Airspace Block Lenka.
Lecture 10: Integer Programming & Branch-and-Bound
Progress in Linear Programming Based Branch-and-Bound Algorithms
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Math443/543 Mathematical Modeling and Optimization
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
1 A Second Stage Network Recourse Problem in Stochastic Airline Crew Scheduling Joyce W. Yen University of Michigan John R. Birge Northwestern University.
Dynamic lot sizing and tool management in automated manufacturing systems M. Selim Aktürk, Siraceddin Önen presented by Zümbül Bulut.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Triple Patterning Aware Detailed Placement With Constrained Pattern Assignment Haitong Tian, Yuelin Du, Hongbo Zhang, Zigang Xiao, Martin D.F. Wong.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Toshihide IBARAKI Mikio KUBO Tomoyasu MASUDA Takeaki UNO Mutsunori YAGIURA Effective Local Search Algorithms for the Vehicle Routing Problem with General.
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.
EUROCONTROL EXPERIMENTAL CENTRE1 1st ICRAT Zilina 04/11/22-24 Frédéric Ferchaud EEC INO/LaBRI Vu Duong EEC INO Cyril Gavoille, Mohamed Mosbah LaBRI, University.
Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.
1 Chapter-4: Network Flow Modeling & Optimization Deep Medhi and Karthik Ramasamy August © D. Medhi & K. Ramasamy, 2007.
Workshop PRIXNET – 11/12 Mars CONGESTION PRICING IN AIR TRANSPORTATION Karine Deschinkel Laboratoire PRiSM – Université de Versailles.
D Nagesh Kumar, IIScOptimization Methods: M1L3 1 Introduction and Basic Concepts (iii) Classification of Optimization Problems.
Mathematical Programming for Optimisation Mike Morgan and Vic Grout Centre for Applied Internet Research (CAIR) University of Wales NEWI Plas Coch Campus,
17 th International Teletraffic Congress Topological design of telecommunication networks Michał Pióro a,b, Alpar Jüttner c, Janos Harmatos c, Áron Szentesi.
Minimum Cost Flows. 2 The Minimum Cost Flow Problem u ij = capacity of arc (i,j). c ij = unit cost of shipping flow from node i to node j on (i,j). x.
New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
Researchers: Preet Bola Mike Earnest Kevin Varela-O’Hara Han Zou Advisor: Walter Rusin Data Storage Networks.
Review for E&CE Find the minimal cost spanning tree for the graph below (where Values on edges represent the costs). 3 Ans. 18.
Hub Location Problems Chapter 12
Logical Topology Design
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
Design of Capacitated Survivable Networks With a Single Facility Author : Hervé Kerivin, Dritan Nace, and Thi-Tuyet- Loan Pham R 張耀元, R
Chapter 1. Formulations 1. Integer Programming  Mixed Integer Optimization Problem (or (Linear) Mixed Integer Program, MIP) min c’x + d’y Ax +
Models in I.E. Lectures Introduction to Optimization Models: Shortest Paths.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
Exact and heuristics algorithms
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
Robust Synchronization of Actuated Signals on Arterials Project # : Simulation-Based Robust Optimization for Actuated Signal Timing and Setting.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
1 ILA Berlin - May 2008 Marc Brochard - EEC EPATS ATM General Requirements & relative issues to be solved.
1 Inventory Control with Time-Varying Demand. 2  Week 1Introduction to Production Planning and Inventory Control  Week 2Inventory Control – Deterministic.
MODEL FOR DAILY OPERATIONAL FLIGHT SCHEDULE DESIGNING Slavica Nedeljković Faculty of Transport and Traffic Engineering, University of Belgrade Serbia and.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Stochastic Optimization
September 28, 2000 Improved Simultaneous Data Reconciliation, Bias Detection and Identification Using Mixed Integer Optimization Methods Presented by:
Review for E&CE Find the minimal cost spanning tree for the graph below (where Values on edges represent the costs). 3 Ans. 18.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
1 EUROCONTROL UMR CNRS 6599 Heuristique et Diagnostic des Systèmes Complexes © 2002 HEUDIASYC © 2002 HEUDIASYC A LINEAR PROGRAMMING APPROACH FOR ROUTE.
Aircraft Landing Problem
A Multi-Airport Dynamic Network Flow Model with Capacity Uncertainty
The minimum cost flow problem
Basic Project Scheduling
6.5 Stochastic Prog. and Benders’ decomposition
Basic Project Scheduling
Multi-Commodity Flow Based Routing
Nikola Ivanov, Fedja Netjasov, Radosav Jovanovic
Integer Programming (정수계획법)
Addressing uncertainty in a transshipment problem
Integer Programming (정수계획법)
Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh
6.5 Stochastic Prog. and Benders’ decomposition
Fast Min-Register Retiming Through Binary Max-Flow
Chapter 1. Formulations.
Presentation transcript:

MODEL FOR FLIGHT LEVEL ASSIGNMENT PROBLEM ICRAT International Conference on Research in Air Transportation Alfred Bashllari National & Kapodistrian University of Athens, School of Sciences, Faculty of Mathematics Athens, Greece. Dritan Nace, HEUDIASYC Laboratory, UMR CNRS 6599 University of Technology of Compiègne, France

Outline Introduction Related works Models for the Flight Level Assignment (FLA) problem A mixed integer linear programming model A constrained min-cost flow model Conflict probability estimation Numerical results Concluding Remarks

Introduction The route and the level assignment problem, aiming at global flight plan optimization, has already become a key issue owing to the growth of air traffic. The principal objective of most of research work is minimizing the delay. Obviously there is no a unique solution to this problem but there are a lot of partial solutions that could bring the actual ATM to meet all requirements. One direction to reduce congestion is to modify the Flight Plans in a way to adapt the demand to the available capacity. Our aim in this work, is to reduce the number of potential en- route conflicts through a better assignment of flight levels, called the FLA problem.

Related works Bertsimas and Stock have considered the Air Traffic Flow Management Rerouting Problem (TFMRP), treating simultaneously the time and the route assignment problem through a dynamic approach. Doan and all have presented a deterministic model intended to optimize route and flight-level assignment in a trajectory-based ATM environment. Delahaye and Odoni represent the problem of airspace congestion by the stochastic optimization point of view and particularly, using the genetic algorithm. Genetic Algorithms (GA) are problem solving systems based on principles of evolution and heredity. The level assignment problem is specifically addressed in some work at CENA, INRETS. A common idea: representing the problem as a graph coloring one.

Models for the Flight Level Assignment (FLA) problem We will introduce two models for the FLA problem. Both of them use potential conflict probabilities as input data. Thus a preliminary stage was elaborating a computation method for conflict probability. In this work, not only space but also time proximity have been taken into account. We have considered flights instead of flows and we then associate with two crossing routes the conflict probability. We are restricted to the case of fixed single routes and we do not consider the possibility of route’s change.

A mixed integer linear programming model Notation L denotes the set of possible flight-levels l and Li the set of eligible flight levels for flight i. The set of flights is noted with F. x i,l : binary variable (0,1), takes 1 when the flight i, fly on level l and 0 otherwise. p i,l : gives the penalty associated with flight i flying on level l. a i,j : is a given constant that shows the probability of conflict for a pair of flights (flights i and j). l i,j : binary variable (0,1), takes 1 when the flight i and j fly on the same level and 0 otherwise.

A mixed integer linear programming model Mathematical formulation Minimize subject to: (1) (2) (3) (4) Mathematical formulation Minimize subject to: (1) (2) (3) (4) the number of potential conflicts global cost induced by chosen level unique level for each flight l i,j to be a binary one

A constrained min-cost flow model We propose in the following to model the FLA problem as a min-cost flow problem augmented with a certain number of additional constraints, called constrained min-cost flow model.

A constrained min-cost flow model Let G=(N, A) be a directed network defined by a set N of nodes and a set A of directed arcs c ij is the cost associated with each arc (i,j ) corresponding to a level choice or a conflict arc. Let F be the set of flights, L the set of eligible flight levels and S the set of potential conflicts (f i, f j ) involving flights f i and f j. Capacity u ij for each arc (i,j ) is u ij =1. x ij is flow variable and represents the flow on (i,j). Mathematical formulation: Minimize Subject to: (!) Kirchoff constraints; (!!) constrained conflict path constraints; (!!!) binary constraints;

Conflict probability estimation In this annex we present a method for estimating the conflict probability between two aircraft by taking into account the uncertainties in their flight trajectories. Initially we calculate the «minimum distance» between them: where ρ =, d 2 and d 1 distances of aircrafts from conflict point at the moment t 0 = 0 and  the angle between their trajectories. Then we integrate in it the along-track and cross-track errors (inspired by works of Herzberg, Pajelli, Irvine). Under certain assumptions, it is shown that the «minimum distance» is a random variable with normal distribution. Consequently the probability of conflict can be calculated as the cumulative probability with known distribution.

Conflict probability estimation The probability of conflict corresponds to the part of the distribution of the «minimum distance» that lies between -s and +s, where s is the minimum allowed horizontal separation for on-route airspace. P conflict = were the mean μ and variance σ 2 are given by: μ = λ( – ρ), σ 2 = λ 2 a(τ) 2 (1 + ρ 2 ) + λ 2 b 2 ((ρcot  – cosec  ) 2 + (cot  - ρcosec  ) 2 ) and erf(x) =

Numerical Results These numerical results are for the mixed integer linear programming model The test data, provided by EUROCONTROL, correspond to a real instance for a French and a European air transportation network, both as of August 12th The granularities of time used for the tests was 10 min. We considered just one preferred route for each flight. The number of candidate levels is limited to 3. Test Instances Number of Flights Used Airports Used WayPoints NET_FR NET_EU

Numerical Results The program we developed is composed of two parts: Network modeling, finding conflicts and calculation of conflict probability for each conflict. Computing the optimized level assignment, using the ILOG MIP solver CPLEX 8.0 In the case of European network from conflicts detected before the optimization, we reduce to 5275 conflicts, about 67% of conflicts are removed. In the case of French network from 756 conflicts before the optimization, remain 229 conflicts after optimization, about 69% of conflicts been eliminated thanks to optimization.

Concluding Remarks We propose in this study two mathematical models for the FLA problem. The first model is an O-1 linear programming problem and doesn’t seem to be appropriate for large instances. The experience of implementation has shown that the first model becomes infeasible for larger instances, as European network. We are now studying how to build appropriate cutting planes. The second model for the FLA problem is formulated as a min- cost flow problem augmented with additional constraints. We believe that the second model can deal with larger instances of FLA problem, at least provide an efficient heuristic.