Volume 21, Issue 3 (IJIEPR 2010)                   IJIEPR 2010, 21(3): 121-128 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Solving the Airline Recovery Problem By Using Ant Colony Optimization. IJIEPR. 2010; 21 (3) :121-128
URL: http://ijiepr.iust.ac.ir/article-1-214-en.html
Abstract:   (5273 Views)

  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 .

Full-Text [PDF 350 kb]   (3432 Downloads)    
Type of Study: Research | Subject: Other Related Subject
Received: 2011/01/17 | Published: 2010/09/15

Cited by [1] [PDF 96 KB]  (317 Download)
Add your comments about this article : Your username or Email:

© 2020 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb