z-logo
open-access-imgOpen Access
Flights Assignment Model of Multiple Airports Based on Game Theory and CDM Mechanism
Author(s) -
Junqiang Liu
Publication year - 2020
Publication title -
mathematical problems in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.262
H-Index - 62
eISSN - 1026-7077
pISSN - 1024-123X
DOI - 10.1155/2020/2569280
Subject(s) - assignment problem , game theory , mathematical optimization , computer science , mechanism (biology) , aviation , operations research , ant colony optimization algorithms , simulation , engineering , mathematics , mathematical economics , aerospace engineering , philosophy , epistemology
To minimize delay cost of flights in multiple airports, this paper studied flights assignment problem under delay conditions. By considering the delay cost, airport capacity, and the slot exchange between airlines, this paper proposed a novel assignment model based on game theory and CDM mechanism. An improved ant colony algorithm was proposed to solve the flight assignment problem. The case studies showed that the proposed model can optimize the minimum delay cost between airlines under multiairport capacity constraints. The performance of proposed method was better than that of traditional non-slot-exchange method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here