IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v34y2019i1p1-27.html
   My bibliography  Save this article

Modelling a bi-objective airport gate scheduling with controllable processing time using hybrid NSGA-II and VNS algorithm

Author

Listed:
  • Sanaz Khatibi
  • Morteza Khakzar Bafruei
  • Morteza Rahmani

Abstract

In this research, we address a bi-objective model in a more realistic situation such that airport gate processing time is controllable. It is assumed that the possible compression/expansion processing time of a flight can be continuously controlled. The aim is simultaneously: 1) minimise the total cost of tardiness, earliness, delay and compression as well as expansion costs of job processing time; 2) minimise the passengers overcrowding on gate. In this study, a mixed-integer programming model is proposed. For solving the problem, two multi-objective meta-heuristic algorithms, namely non-dominated sorting genetic algorithm II (NSGA-II) and hybrid NSGA-II and variable neighbourhood search (VNS) are applied. VNS is used for preventing the solution from trapping in the local optimum, instead of mutation operator in NSGA-II. The algorithms are tested with the real life data from Mehrabad International Airport. Computational experiments reveal that hybrid NSGA-II and VNS generate better Pareto-optimal solution as compared to NSGA-II.

Suggested Citation

  • Sanaz Khatibi & Morteza Khakzar Bafruei & Morteza Rahmani, 2019. "Modelling a bi-objective airport gate scheduling with controllable processing time using hybrid NSGA-II and VNS algorithm," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 34(1), pages 1-27.
    • Handle: RePEc:ids:ijores:v:34:y:2019:i:1:p:1-27
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=96940
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:34:y:2019:i:1:p:1-27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.