TY - JOUR ID - 6299 TI - Determination of the Aircraft Landing Sequence by Two Meta-Heuristic Algorithms JO - International Journal of Transportation Engineering JA - IJTE LA - en SN - 2322-259X AU - Mokhtarimousavi, Seyedmirsajad AU - Rahami, Hossein AU - Saffarzadeh, Mahmoud AU - Piri, Saeed AD - MSc. Student of Transportation Planning, Science and Research Branch, Islamic Azad University, Tehran, Iran AD - Assistant Professor, School of Engineering Science, College of Engineering, University of Tehran, Tehran, Iran AD - Professor, Department of Civil and Environmental Engineering, Tarbiat Modares University, Iran AD - Ph.D. Student, Department of Industrial Engineering and Management, Oklahoma State University, Oklahoma, USA. Y1 - 2014 PY - 2014 VL - 1 IS - 4 SP - 271 EP - 284 KW - Aircraft Landing Scheduling Problem KW - Expected Landing Time (ELT) KW - Scheduled Landing Time (SLT) KW - NSGA-II algorithm KW - MOPSO Algorithm DO - 10.22119/ijte.2014.6299 N2 - Due to an anticipated increase in air traffic during the next decade, air traffic control in busy airports is one of the main challenges confronting the controllers in the near future. Since the runway is often a bottleneck in an airport system, there is a great interest in optimizing the use of the runway. The most important factors in aircraft landing modeling are time and cost. For this reason, Aircraft Landing Scheduling Problem (ASLP) is a typical hard multi-constraint optimization problem and finding its efficient solution would be very difficult. So in real applications finding the best solution is not the most important issue and providing a feasible landing schedule in an acceptable time would be the preferred requirement. In this study a three objectives formulation of the problem proposed as a mathematical programming model on a runway in static mode. Problem is solved by multi-objective genetic algorithm (NSGA-II) and multi-objective Particle Swarm Optimization Algorithm (MOPSO). Considering a group of 20 aircrafts, this problem is solved and landing sequence determined and we are shown the obtained sequence does not follow First Come First Serve law for sequencing as well. Finally by comparing results, conclusion and suggestions are proposed. UR - http://www.ijte.ir/article_6299.html L1 - http://www.ijte.ir/article_6299_abbd8c58a8fb8066b96850be3334a28e.pdf ER -