About this Journal Submit a Manuscript Table of Contents
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 742653, 8 pages
http://dx.doi.org/10.1155/2013/742653
Research Article

A Hybrid Metaheuristic for Multiple Runways Aircraft Landing Problem Based on Bat Algorithm

1College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, China
2Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Nanning, Guangxi 530006, China

Received 17 May 2013; Accepted 11 July 2013

Academic Editor: Xin-She Yang

Copyright © 2013 Jian Xie et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

The aircraft landing problem (ALP) is an NP-hard problem; the aim of ALP is to minimize the total cost of landing deviation from predefined target time under the condition of safe landing. In this paper, the multiple runways case of the static ALP is considered and a hybrid metaheuristic based on bat algorithm is presented to solve it. Moreover, four types of landing time assignment strategies are applied to allocate the scheduling time, and a constructed initialization is used to speed up the convergence rate. The computational results show that the proposed algorithm can obtain the high-quality and comparable solutions for instances up to 500 aircrafts, and also it is capable of finding the optimal solutions for many instances in a short time.