khakzar Bafruei, M., khatibi, S., Rahmani, M. (2016). A bi-objective airport gate scheduling with controllable processing times using Harmony Search and NSGA-II algorithms. Journal of Optimization in Industrial Engineering, (), -.
Morteza khakzar Bafruei; Sananz khatibi; Morteza Rahmani. "A bi-objective airport gate scheduling with controllable processing times using Harmony Search and NSGA-II algorithms". Journal of Optimization in Industrial Engineering, , , 2016, -.
khakzar Bafruei, M., khatibi, S., Rahmani, M. (2016). 'A bi-objective airport gate scheduling with controllable processing times using Harmony Search and NSGA-II algorithms', Journal of Optimization in Industrial Engineering, (), pp. -.
khakzar Bafruei, M., khatibi, S., Rahmani, M. A bi-objective airport gate scheduling with controllable processing times using Harmony Search and NSGA-II algorithms. Journal of Optimization in Industrial Engineering, 2016; (): -.
A bi-objective airport gate scheduling with controllable processing times using Harmony Search and NSGA-II algorithms
Articles in Press, Accepted Manuscript , Available Online from 09 July 2016
1Assistant Professor, Department of Industrial Engineering, Technology Development Institute (ACECR), Tehran, Iran
2PhD Student, Department of Industrial Engineering, Technology Development Institute (ACECR), Tehran, Iran
3Associate Professor, Department of Industrial Engineering, Technology Development Institute (ACECR), Tehran, Iran
Abstract
Optimizing gate assignment at airports is an old, but also a broad problem. The main purpose of this problem is to find an assignment for the flights arriving and departing while satisfying a set of constraints. In all studies, airport gate processing time was considered fixed. In this research, however, we investigate the more realistic situation that airport gate processing time is controllable; it leads to increase the total performance of gate scheduling. It is assumed that the possible compression/expansion processing time of a flight can be continuously controlled, i.e. it can be any number in a given interval. Depending on the situation, different objectives become important. The aim of this study is to simultaneously (1) minimize total cost of tardiness, earliness, delay as well as compression and expansion costs of job processing time and (2) minimize the passengers overcrowding on gate. In this study, we first propose a mixed-integer programming model for the considered problem. Due to complexity of problem, two multi-objective meta-heuristic algorithms, i.e. multi-objective harmony search algorithm (MOHSA) and non-dominated sorting genetic algorithm II (NSGA-II) are applied. For calibrating the parameter of the algorithms Taguchi method is used and the optimal levels of the algorithm’s performance are selected. The algorithms are tested with real life data from Mehrabad International Airport for medium size problems. Finally, the experimental results show that NSGA-II has better convergence near the true Pareto-optimal front as compared to MOHSA; however, MOHSA finds a better spread in the entire Pareto-optimal region.
Top
