This paper addresses the general time-route assignment problem: One considers an air transportation network and a fleet of aircraft with their associated route and slot of departure. For each flight a set of alternative routes and a set of possible slots of departure are defined. One must find optimal route and slot allocation for each aircraft in a way that significantly reduces the peak of workload in the most congested sectors and in the most congested airports, during one day of traffic.
Publié le : 1997-04-13
Classification:
genetic algorithm,
airspace congestion,
time of departure,
route,
network,
[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
@article{hal-00937702,
author = {Delahaye, Daniel and Odoni, Amedeo},
title = {Airspace congestion smoothing by stochastic optimization},
journal = {HAL},
volume = {1997},
number = {0},
year = {1997},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-00937702}
}
Delahaye, Daniel; Odoni, Amedeo. Airspace congestion smoothing by stochastic optimization. HAL, Tome 1997 (1997) no. 0, . http://gdmltest.u-ga.fr/item/hal-00937702/