Modelling a bi-objective airport gate scheduling with controllable processing time using hybrid NSGA-II and VNS algorithm
by Sanaz Khatibi; Morteza Khakzar Bafruei; Morteza Rahmani
International Journal of Operational Research (IJOR), Vol. 34, No. 1, 2019

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.

Online publication date: Fri, 14-Dec-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com