A bi-objective airport gate scheduling with controllable processing times Hybrid NSGA-II and VNS algorithm

While almost all studies on airport gate scheduling assumed that the processing time is fix, in this research, we address a bi-objective model in a more realistic situation such thatairport gate processing time is controllable. It is assumed that the possible compression/expansion processing time of a flight can be continuously controlled, i.e. it canbe any number in a given interval. The aim of this study is to simultaneously (1) minimize the total cost of tardiness, earliness, delay and compression as well as expansion costs of job processing time and, (2) minimize the passengers overcrowding on gate. In this study, amixed-integer programming model is proposed. For solving such bi-objective problem, a multi-objective meta-heuristic algorithm namely hybrid NSGA-II and variable neighborhood search (VNS) is applied. In order to prevent the solution from trapping in thelocal optimum, VNS is used instead of mutation operator in NSGA-II. For calibrating the parameter of the algorithms, Taguchi method is used. The algorithm is tested with the real life data from Mehrabad International Airport for medium size problems.

کلیدواژه ها:

Gate scheduling problem ، Multi-objective decision making ، NSGA-II ، VNS ، Hybrid metaheuristic ، Controllable processing times