In the field of Swarm Intelligence, the Bee Colony Optimization (BCO) has proven to be capable of solving high-level combinatorial problems, like the Flight-Gate Assignment Problem (FGAP), with fast convergence performances. However, given that the FGAP can be often affected by uncertainty or approximation in data, in this paper we develop a new metaheuristic algorithm, based on the Fuzzy Bee Colony Optimization (FBCO), which integrates the concepts of BCO with a Fuzzy Inference System. The proposed method assigns, through the multicriteria analysis, airport gates to scheduled flights based on both passengers' total walking distance and use of remote gates, to find an optimal flight-to-gate assignment for a given schedule. Comparison of the results with the schedules of real airports has allowed us to show the characteristics of the proposed concepts and, at the same time, it stressed the effectiveness of the proposed method.
Solving the gate assignment problem through the Fuzzy Bee Colony Optimization / Dell'Orco, Mauro; Marinelli, Mario; Altieri, Maria Giovanna. - In: TRANSPORTATION RESEARCH. PART C, EMERGING TECHNOLOGIES. - ISSN 0968-090X. - 80:(2017), pp. 424-438. [10.1016/j.trc.2017.03.019]
Solving the gate assignment problem through the Fuzzy Bee Colony Optimization
DELL'ORCO, Mauro;MARINELLI, Mario;Altieri, Maria Giovanna
2017-01-01
Abstract
In the field of Swarm Intelligence, the Bee Colony Optimization (BCO) has proven to be capable of solving high-level combinatorial problems, like the Flight-Gate Assignment Problem (FGAP), with fast convergence performances. However, given that the FGAP can be often affected by uncertainty or approximation in data, in this paper we develop a new metaheuristic algorithm, based on the Fuzzy Bee Colony Optimization (FBCO), which integrates the concepts of BCO with a Fuzzy Inference System. The proposed method assigns, through the multicriteria analysis, airport gates to scheduled flights based on both passengers' total walking distance and use of remote gates, to find an optimal flight-to-gate assignment for a given schedule. Comparison of the results with the schedules of real airports has allowed us to show the characteristics of the proposed concepts and, at the same time, it stressed the effectiveness of the proposed method.File | Dimensione | Formato | |
---|---|---|---|
02_TRC_DellOrco_Marinelli_Altieri_Solving the Gate Assignment Problem.pdf
accesso aperto
Descrizione: Accepted manuscript
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
662.14 kB
Formato
Adobe PDF
|
662.14 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.