The comparison of the metaheuristic algorithms performances on airport gate assignment problem

Simple item page
dc.contributor.authorAktel, Abdullah
dc.contributor.authorÖzcan, Tuncay
dc.contributor.authorYenisey, M. Mutlu
dc.contributor.authorSansarcı, Engin
dc.contributor.authorÇelikoğlu, H. B.
dc.contributor.authorLav, A. H.
dc.contributor.authorSilgu, M. A.
dc.contributor.buuauthorYağmahan, Betül
dc.contributor.departmentUludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü.tr_TR
dc.contributor.orcid0000-0003-1744-3062tr_TR
dc.contributor.researcheridB-5557-2017tr_TR
dc.contributor.scopusid23487445600tr_TR
dc.date.accessioned2023-01-04T13:13:27Z
dc.date.available2023-01-04T13:13:27Z
dc.date.issued2017
dc.descriptionBu çalışma, 05-07 Eylül 2016 tarihleri arasında İstanbul[Türkiye]’da düzenlenen 19. European-Operational-Research-Societies Working Group on Transportation Meeting (EWGT)’da bildiri olarak sunulmuştur.tr_TR
dc.description.abstractThe airport gate assignment problem (AGAP) is an important research area in air transportation planning and optimization. In this paper we study the airport gate assignment problem where the objectives are to minimize the number of ungated flights and the total walking distances. In order to solve the problem, we proposed a new tabu search (TS) algorithm which uses a probabilistic approach as an aspiration criterion. We compared two metaheuristics, namely, TS, and simulated annealing (SA). A greedy algorithm used as a benchmark. We compared the performances of the algorithms and analyzed at different problem sizes. Experimentations showed that the new proposed metaheuristic algorithm gave promising results.en_US
dc.description.sponsorshipEURO Working Grp Transportaten_US
dc.description.sponsorshipİstanbul Teknik Üniversitesitr_TR
dc.description.sponsorshipTürkiye Bilim ve Teknoloji Konseyitr_TR
dc.description.sponsorshipEMAY Int Eng & Consultancy Incen_US
dc.identifier.citationAktel, A. vd. (2017). ''The comparison of the metaheuristic algorithms performances on airport gate assignment problem''. ed. H. B. Çelikoğlu vd. Transportation Research Procedia, 19th Euro Working Group on Transportation Meeting (Ewgt2016), 22, 469-478.en_US
dc.identifier.endpage478tr_TR
dc.identifier.issn2352-1465
dc.identifier.scopus2-s2.0-85019439134tr_TR
dc.identifier.startpage469tr_TR
dc.identifier.urihttps://doi.org/10.1016/j.trpro.2017.03.061
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S2352146517301989
dc.identifier.urihttp://hdl.handle.net/11452/30259
dc.identifier.volume22tr_TR
dc.identifier.wos000404633300048tr_TR
dc.indexed.scopusScopusen_US
dc.indexed.wosSCIEen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.collaborationYurt içitr_TR
dc.relation.collaborationSanayitr_TR
dc.relation.journalTransportation Research Procedia, 19th Euro Working Group on Transportation Meeting (Ewgt2016)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararasıtr_TR
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectTransportationen_US
dc.subjectGate assignmenten_US
dc.subjectMetaheuristicsen_US
dc.subjectSimulated annealingen_US
dc.subjectTabu searchen_US
dc.subjectGenetic algorithmen_US
dc.subjectFlighten_US
dc.subjectAircraften_US
dc.subjectOptimizationen_US
dc.subjectHeuristicsen_US
dc.subjectSimulationen_US
dc.subjectTerminalsen_US
dc.subjectModelsen_US
dc.subjectSolveen_US
dc.subject.scopusBaggage Handling; Airports; Helicopteren_US
dc.subject.wosTransportationen_US
dc.subject.wosTransportation science & technologyen_US
dc.titleThe comparison of the metaheuristic algorithms performances on airport gate assignment problemen_US
dc.typeProceedings Paper

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Yağmahan_vd_2017.pdf
Size:
535.31 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Web of Science
Scopus