THE TRAFFIC FLOW MANAGEMENT REROUTING PROBLEM IN AIR TRAFFIC CONTROL: A DYNAMIC NETWORK FLOW APPROACH

In this paper, the authors address the problem of determining how to reroute aircraft in the air traffic control system (ATCS) when faced with dynamically changing weather conditions. The overall aim of this problem is minimization of delay costs. This problem is of primary concern in the European ATCS and especially in regions within the U.S. ATCS. An integrated mathematical programming approach consisting of several methodologies is presented. To address the high dimensionality, an aggregate model is first presented in which the problem is formulated as a dynamic, multicommodity, integer network flow problem with certain side constraints. Using Lagrangian relaxation, aggregate flows are generated. The aggregate flows are decomposed into a collection of flight paths for individual aircraft using a randomized rounding heuristic. This collection of paths is then used in a packing integer programming formulation, the solution of which generates feasible and near-optimal routes for flights. The overall Lagrangian Generation Algorithm is used to solve actual problems in the southwestern U.S. In computational experiments, the solutions returned by the algorithm presented here are within 1% of corresponding lower bounds.

  • Availability:
  • Corporate Authors:

    Institute for Operations Research and the Management Sciences (INFORMS)

    901 Elkridge Landing Road, Suite 400
    Linthicum, MD  United States  21090-2909
  • Authors:
    • Bertsimas, D
    • Patterson, S S
  • Publication Date: 2000-8

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00798671
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Sep 5 2000 12:00AM