Path: Top -> Journal -> Jurnal Internasional -> King Saud University -> 2016 -> Volume 28, Issue 1, January
A memetic algorithm to solve the dynamic multiple runway aircraft landing problem
Oleh : Ghizlane Bencheikh, Jaouad Boukachour, Ahmed El Hilali Alaoui, King Saud University
Dibuat : 2017-01-14, dengan 1 file
Keyword : Dynamic aircraft landing problemAnt colony optimizationLocal searchMetaheuristics
Url : http://www.sciencedirect.com/science/article/pii/S131915781500107X
Sumber pengambilan dokumen : web
The aircraft landing problem (ALP) consists of scheduling the landing of aircrafts onto the available runways in an airport by assigning to each aircraft a landing time and a specific runway while respecting different operational constraints. This is a complex task for the air traffic controller, especially when the flow of aircrafts entering the radar range is continuous and the number of aircrafts is unknown a priori. In this paper, we study the dynamic version of the ALP when new aircrafts appear over time, which means that the landing of the previous aircrafts should be rescheduled. To solve this problem, we propose a memetic algorithm combining an ant colony algorithm and a local heuristic.
Beri Komentar ?#(0) | Bookmark
Properti | Nilai Properti |
---|---|
ID Publisher | gdlhub |
Organisasi | King Saud University |
Nama Kontak | Herti Yani, S.Kom |
Alamat | Jln. Jenderal Sudirman |
Kota | Jambi |
Daerah | Jambi |
Negara | Indonesia |
Telepon | 0741-35095 |
Fax | 0741-35093 |
E-mail Administrator | elibrarystikom@gmail.com |
E-mail CKO | elibrarystikom@gmail.com |
Print ...
Kontributor...
- , Editor: sukadi
Download...
Download hanya untuk member.
1-s2
File : 1-s2.0-S131915781500107X-main.pdf
(781577 bytes)