Scheduling aircraft landing based on clonal selection algorithm and receding horizon control

Xiaolan Jia; Xianbin Cao; Yuanping Guo; Hong Qiao; Jun Zhang

doi:10.1109/ITSC.2008.4732662

Scheduling aircraft landing based on clonal selection algorithm and receding horizon control

Xiaolan Jia, Xianbin Cao^*, Yuanping Guo, Hong Qiao, Jun Zhang

^*Corresponding author for this work

Research output: Contribution to conference › Paper › peer-review

8 Citations (Scopus)

Abstract

The task of Aircraft Landing Scheduling (ALS) is to give a landing sequence and landing times for a given set of aircrafts where many constraints must be satisfied. ALS is an NP-hard problem with large-scale and multi-constraint characteristics, thus it is hard to find optimal solution efficiently. In this paper, a hybrid algorithm of Clonal Selection Algorithm (CSA) and Receding Horizon Control (RHC) was proposed for ALS problem. In details, constrained CSA based on infeasibility degree (IFD) schedules aircrafts in current receding horizon, and then RHC repeats that optimization procedure using excellent gene segment spread (EGSS) until all aircrafts have landed. Comparative experiments show that the CSA-RHC hybrid algorithm is able to obtain an optimal landing sequence and landing times rapidly and effectively.

Original language	English
Pages	357-362
Number of pages	6
DOIs	https://doi.org/10.1109/ITSC.2008.4732662
Publication status	Published - 2008
Externally published	Yes
Event	11th International IEEE Conference on Intelligent Transportation Systems, ITSC 2008 - Beijing, China Duration: 10 Dec 2008 → 12 Dec 2008

Conference

Conference	11th International IEEE Conference on Intelligent Transportation Systems, ITSC 2008
Country/Territory	China
City	Beijing
Period	10/12/08 → 12/12/08

Access to Document

10.1109/ITSC.2008.4732662

Cite this

@conference{02685c3ee7704086bb56f7b0a22221c2,

title = "Scheduling aircraft landing based on clonal selection algorithm and receding horizon control",

abstract = "The task of Aircraft Landing Scheduling (ALS) is to give a landing sequence and landing times for a given set of aircrafts where many constraints must be satisfied. ALS is an NP-hard problem with large-scale and multi-constraint characteristics, thus it is hard to find optimal solution efficiently. In this paper, a hybrid algorithm of Clonal Selection Algorithm (CSA) and Receding Horizon Control (RHC) was proposed for ALS problem. In details, constrained CSA based on infeasibility degree (IFD) schedules aircrafts in current receding horizon, and then RHC repeats that optimization procedure using excellent gene segment spread (EGSS) until all aircrafts have landed. Comparative experiments show that the CSA-RHC hybrid algorithm is able to obtain an optimal landing sequence and landing times rapidly and effectively.",

author = "Xiaolan Jia and Xianbin Cao and Yuanping Guo and Hong Qiao and Jun Zhang",

year = "2008",

doi = "10.1109/ITSC.2008.4732662",

language = "English",

pages = "357--362",

note = "11th International IEEE Conference on Intelligent Transportation Systems, ITSC 2008 ; Conference date: 10-12-2008 Through 12-12-2008",

}

TY - CONF

T1 - Scheduling aircraft landing based on clonal selection algorithm and receding horizon control

AU - Jia, Xiaolan

AU - Cao, Xianbin

AU - Guo, Yuanping

AU - Qiao, Hong

AU - Zhang, Jun

PY - 2008

Y1 - 2008

N2 - The task of Aircraft Landing Scheduling (ALS) is to give a landing sequence and landing times for a given set of aircrafts where many constraints must be satisfied. ALS is an NP-hard problem with large-scale and multi-constraint characteristics, thus it is hard to find optimal solution efficiently. In this paper, a hybrid algorithm of Clonal Selection Algorithm (CSA) and Receding Horizon Control (RHC) was proposed for ALS problem. In details, constrained CSA based on infeasibility degree (IFD) schedules aircrafts in current receding horizon, and then RHC repeats that optimization procedure using excellent gene segment spread (EGSS) until all aircrafts have landed. Comparative experiments show that the CSA-RHC hybrid algorithm is able to obtain an optimal landing sequence and landing times rapidly and effectively.

AB - The task of Aircraft Landing Scheduling (ALS) is to give a landing sequence and landing times for a given set of aircrafts where many constraints must be satisfied. ALS is an NP-hard problem with large-scale and multi-constraint characteristics, thus it is hard to find optimal solution efficiently. In this paper, a hybrid algorithm of Clonal Selection Algorithm (CSA) and Receding Horizon Control (RHC) was proposed for ALS problem. In details, constrained CSA based on infeasibility degree (IFD) schedules aircrafts in current receding horizon, and then RHC repeats that optimization procedure using excellent gene segment spread (EGSS) until all aircrafts have landed. Comparative experiments show that the CSA-RHC hybrid algorithm is able to obtain an optimal landing sequence and landing times rapidly and effectively.

UR - http://www.scopus.com/inward/record.url?scp=60749133462&partnerID=8YFLogxK

U2 - 10.1109/ITSC.2008.4732662

DO - 10.1109/ITSC.2008.4732662

M3 - Paper

AN - SCOPUS:60749133462

SP - 357

EP - 362

T2 - 11th International IEEE Conference on Intelligent Transportation Systems, ITSC 2008

Y2 - 10 December 2008 through 12 December 2008

ER -

Scheduling aircraft landing based on clonal selection algorithm and receding horizon control

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this