HYBRID HEURISTIC NATIONAL AIRSPACE FLIGHT PATH OPTIMIZATION
First Claim
1. A method for optimizing a plurality of competing portfolios of flight paths for flights through one or more sectors of an airspace represented by an air traffic system, said method comprising:
- executing at least one heuristic-based process to construct successive portfolios of the flight paths for consideration, wherein the at least one heuristic-based process includes one or more configurable parameters that are applied in selecting the successive portfolios;
applying a genetic optimization process to identify the at least one heuristic-based process according to its one or more configurable parameters;
evaluating each successive portfolio constructed by the at least one heuristic-based process with an approximation model that approximates the air traffic system;
selecting an optimal portfolio of the flight paths from among the plurality of competing portfolios of flight paths based on results of said evaluating step; and
utilizing a simulation of the air traffic system to validate the optimal portfolio of flight paths selected in said selecting step.
3 Assignments
0 Petitions
Accused Products
Abstract
Hybrid-heuristic optimization of competing portfolios of flight paths for flights through one or more sectors of an airspace represented by an air traffic system. In one embodiment, a hybrid-heuristic optimization process (100) includes one or more heuristic based processes (110), a genetic optimization process (120), an evaluation process involving an approximation model (130), an optimal portfolio selection process (140) and a validation process involving simulation (150) of the air traffic system.
-
Citations
25 Claims
-
1. A method for optimizing a plurality of competing portfolios of flight paths for flights through one or more sectors of an airspace represented by an air traffic system, said method comprising:
-
executing at least one heuristic-based process to construct successive portfolios of the flight paths for consideration, wherein the at least one heuristic-based process includes one or more configurable parameters that are applied in selecting the successive portfolios; applying a genetic optimization process to identify the at least one heuristic-based process according to its one or more configurable parameters; evaluating each successive portfolio constructed by the at least one heuristic-based process with an approximation model that approximates the air traffic system; selecting an optimal portfolio of the flight paths from among the plurality of competing portfolios of flight paths based on results of said evaluating step; and utilizing a simulation of the air traffic system to validate the optimal portfolio of flight paths selected in said selecting step. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A system that optimizes a plurality of competing portfolios of flight paths for flights through one or more sectors of an airspace represented by an air traffic system, said system comprising:
-
at least one heuristic-based filter that constructs successive portfolios of the flight paths for consideration, wherein the at least one heuristic-based filter includes one or more configurable parameters that are applied in selecting the successive portfolios; a genetic optimizer that identifies the at least one heuristic-based filter according to its one or more configurable parameters; an approximation model of the air traffic system that is usable to evaluate each successive portfolio constructed by the at least one heuristic-based filter, wherein results of the evaluations of each successive portfolio by the approximation model are used to select an optimal portfolio of the flight paths from among the plurality of competing portfolios of flight paths; and a simulation of the air traffic system usable to validate the optimal portfolio of flight paths selected in accordance with results of the evaluations of each successive portfolio by the approximation model. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. An approximation model of an air traffic simulation system representing an airspace, wherein said approximation model is usable in optimizing competing portfolios of flight paths for flights through one or more sectors of the airspace represented by the air traffic system, said approximation model comprising:
-
a fine-grained demand matrix generated directly from a four-dimensional traffic information set including information about which sectors of the airspace are crossed during which of a plurality of first time periods for selected flight paths of the flights included in a competing portfolio of flight paths, wherein the fine-grained demand matrix comprises a two-dimensional matrix having rows or columns corresponding to the sectors of the airspace and columns or rows corresponding to first time periods with numerical elements indicating the total number of the flights that cross each sector during each of the first time periods; and a coarse-grained demand matrix comprising a two-dimensional matrix having rows or columns corresponding to the sectors of the airspace and columns or rows corresponding to second time periods with numerical elements representing an amount of the flights that cross each sector during each of the second time periods, wherein each second time period comprises an aggregate of more than one of the first time periods. - View Dependent Claims (20, 21, 22, 23, 24, 25)
-
Specification