An efficient hybrid meta-heuristic for aircraft landing problem

Salehipour, A; Modarres, M; Moslemi Naeni, L

An efficient hybrid meta-heuristic for aircraft landing problem

Salehipour, A

Modarres, M Moslemi Naeni, L

Permalink

Publication Type:: Journal Article
Citation:: Computers and Operations Research, 2013, 40 (1), pp. 207 - 213
Issue Date:: 2013-01-01

Closed Access

	Filename	Description	Size
	An efficient hybrid meta-heuristic for aircraft landing problem.pdf	Published Version	356.04 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Salehipour, A https://orcid.org/0000-0003-4866-1396	en_US
dc.contributor.author	Modarres, M	en_US
dc.contributor.author	Moslemi Naeni, L https://orcid.org/0000-0002-3360-7680	en_US
dc.date.issued	2013-01-01	en_US
dc.identifier.citation	Computers and Operations Research, 2013, 40 (1), pp. 207 - 213	en_US
dc.identifier.issn	0305-0548	en_US
dc.identifier.uri	http://hdl.handle.net/10453/117105
dc.description.abstract	Aircraft landing problem is to assign an airport's runways to the arrival aircrafts as well as to schedule the landing time of these aircrafts. In this paper, first a mixed integer goal programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design a hybrid meta-heuristic applying simulated annealing framework. The computational results show that the proposed algorithm can obtain the optimal solution for instances up to 100 aircrafts, and also it is capable of finding very high quality and comparable solutions for the problems with up to 500 aircrafts and 5 runways in a short time. © 2012 Elsevier Ltd. All rights reserved.	en_US
dc.relation.ispartof	Computers and Operations Research	en_US
dc.relation.isbasedon	10.1016/j.cor.2012.06.004	en_US
dc.subject.classification	Operations Research	en_US
dc.title	An efficient hybrid meta-heuristic for aircraft landing problem	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	40	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building/School of Built Environment
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	40	en_US

Abstract:

Aircraft landing problem is to assign an airport's runways to the arrival aircrafts as well as to schedule the landing time of these aircrafts. In this paper, first a mixed integer goal programming model is developed. Then, due to the complexity of the problem, which is NP-hard, we design a hybrid meta-heuristic applying simulated annealing framework. The computational results show that the proposed algorithm can obtain the optimal solution for instances up to 100 aircrafts, and also it is capable of finding very high quality and comparable solutions for the problems with up to 500 aircrafts and 5 runways in a short time. © 2012 Elsevier Ltd. All rights reserved.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/117105