جلد 21، شماره 3 - ( 6-1389 )                   جلد 21 شماره 3 صفحات 121-128 | برگشت به فهرست نسخه ها


XML English Abstract 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-fa.html
Solving the Airline Recovery Problem By Using Ant Colony Optimization. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1389; 21 (3) :121-128

URL: http://ijiepr.iust.ac.ir/article-1-214-fa.html


چکیده:   (3263 مشاهده)

  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 .

     
نوع مطالعه: پژوهشي | موضوع مقاله: و موضوعات مربوط
دریافت: ۱۳۸۹/۱۰/۲۷

Cited by [1] [PDF 96 KB]  (121 دریافت)
ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

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

Designed & Developed by : Yektaweb