A comparative study of Aircrafts scheduling algorithms based on a simulation approach(Session 1b)
スポンサーリンク
概要
- 論文の詳細を見る
We consider the over-constrained airport gate assignment problem where the number of flights exceeds the number of available gates, and where the objectives are to minimize the number of ungated flights and the total walking distance or connection times. We will use greedy algorithm to solve the problem and compare it with other scheduling method. Actual and forecasted data will be simulated in the experiment. The greedy algorithm minimizes ungated flights while providing initial feasible solutions that allow flexibility in seeking good solutions.
- 2011-11-11
著者
-
AL-Sultan Ahmed
岡山大学
-
Al-sultan Ahmed
Graduate School Of Environmental Science Okayama University
-
Ishioka Fumio
School of Law, Okayama University
-
Kurihara Koji
Graduate School of environmental science, Okayama University
-
Ishioka Fumio
School Of Law Okayama University
-
Kurihara Koji
Graduate School Of Environmental Science Okayama University
-
Kurihara Koji
岡山大学
関連論文
- Aircraft and gate scheduling optimization at airports (日本計算機統計学会第23回シンポジウム論文集) -- (セッション4A)
- A comparative study of Aircrafts scheduling algorithms based on a simulation approach(Session 1b)
- The Site Selection of Landfill Using Fuzzy Set and AHP Theory(Session 1b)
- Detection of mislabeled training data in pattern recognition with influence function(Session 2b)
- Visualizing Spatio-temporal Small Area Data of Suicide in Japan(Session 1a)
- Aircraft Scheduling Algorithms at Airport Terminal