Solving the Airline Recovery Problem By Using Ant Colony Optimization
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 21، Issue: 3
Publish Year: 1389
نوع سند: مقاله ژورنالی
زبان: English
View: 690
This Paper With 8 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-21-3_002
تاریخ نمایه سازی: 7 شهریور 1393
Abstract:
In this paper an Ant Colony (ACO) algorithm is developed to solve aircraft recovery while considering disrupted passengers as part of objective function cost. By defining the recovery scope, the solution always guarantees a return to the original aircraft schedule as soon as possible which means least changes to the initial schedule and ensures that all downline affects of the disruption are reflected. Defining visibility function based on both current and future disruptions is one of our contributions in ACO which aims to recover current disruptions in a way that cause less consequent disruptions. Using a real data set, the computational results indicate that the ACO can be successfully used to solve the airline recovery problem.
Keywords:
Authors
Seyed Hessameddin Zegordi
Associate Professor of Industrial Engineering, Tarbiat Modares University, I.R.. IRAN
Niloofar Jafari
Ph.D. of Industrial Engineering, Tarbiat Modares University, I.R. .IRAN,