Dynamic Demand-Capacity Balancing for Air Traffic Management : Using Constraint-Based Local Search

Using constraint-based local search, we effectively model and efficiently solve the problem of balancing the traffic demands on portions of the European airspace while ensuring that their capacity constraints are satisfied. The traffic demand of a portion of airspace is the hourly number of flights...

Full description

Bibliographic Details
Main Author: Hassani Bijarbooneh, Farshid
Format: Others
Language:English
Published: Uppsala universitet, Institutionen för informationsteknologi 2009
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-111079
id ndltd-UPSALLA1-oai-DiVA.org-uu-111079
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-uu-1110792013-01-08T13:48:34ZDynamic Demand-Capacity Balancing for Air Traffic Management : Using Constraint-Based Local SearchengHassani Bijarbooneh, FarshidUppsala universitet, Institutionen för informationsteknologi2009Using constraint-based local search, we effectively model and efficiently solve the problem of balancing the traffic demands on portions of the European airspace while ensuring that their capacity constraints are satisfied. The traffic demand of a portion of airspace is the hourly number of flights planned to enter it, and its capacity is the upper bound on this number under which air-traffic controllers can work. Currently, the only form of demand-capacity balancing we allow is ground holding, that is the changing of the take-off times of not yet airborne flights. Experiments with projected European flight plans of the year 2030 show that already this first form of demand-capacity balancing is feasible without incurring too much total delay and that it can lead to a significantly better demand-capacity balance. Student thesisinfo:eu-repo/semantics/masterThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-111079IT, ; 09 053application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
description Using constraint-based local search, we effectively model and efficiently solve the problem of balancing the traffic demands on portions of the European airspace while ensuring that their capacity constraints are satisfied. The traffic demand of a portion of airspace is the hourly number of flights planned to enter it, and its capacity is the upper bound on this number under which air-traffic controllers can work. Currently, the only form of demand-capacity balancing we allow is ground holding, that is the changing of the take-off times of not yet airborne flights. Experiments with projected European flight plans of the year 2030 show that already this first form of demand-capacity balancing is feasible without incurring too much total delay and that it can lead to a significantly better demand-capacity balance.
author Hassani Bijarbooneh, Farshid
spellingShingle Hassani Bijarbooneh, Farshid
Dynamic Demand-Capacity Balancing for Air Traffic Management : Using Constraint-Based Local Search
author_facet Hassani Bijarbooneh, Farshid
author_sort Hassani Bijarbooneh, Farshid
title Dynamic Demand-Capacity Balancing for Air Traffic Management : Using Constraint-Based Local Search
title_short Dynamic Demand-Capacity Balancing for Air Traffic Management : Using Constraint-Based Local Search
title_full Dynamic Demand-Capacity Balancing for Air Traffic Management : Using Constraint-Based Local Search
title_fullStr Dynamic Demand-Capacity Balancing for Air Traffic Management : Using Constraint-Based Local Search
title_full_unstemmed Dynamic Demand-Capacity Balancing for Air Traffic Management : Using Constraint-Based Local Search
title_sort dynamic demand-capacity balancing for air traffic management : using constraint-based local search
publisher Uppsala universitet, Institutionen för informationsteknologi
publishDate 2009
url http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-111079
work_keys_str_mv AT hassanibijarboonehfarshid dynamicdemandcapacitybalancingforairtrafficmanagementusingconstraintbasedlocalsearch
_version_ 1716529581491486720