A new formulation and an effective matheuristic for the airport gate assignment problem

Simple item page
buir.contributor.authorKarsu, Özlem
buir.contributor.orcidKarsu, Özlem|0000-0002-9926-2021
dc.citation.epage106073-9en_US
dc.citation.spage106073-1
dc.citation.volumeNumber151
dc.contributor.authorKarsu, Özlem
dc.contributor.authorSolyalı, Oğuz
dc.date.accessioned2024-03-15T11:21:12Z
dc.date.available2024-03-15T11:21:12Z
dc.date.issued2023-03
dc.description.abstractThis study considers an airport gate assignment problem where a set of aircraft arriving to an airport are assigned to the fixed gates of the airport terminal or to the apron. The aim is to lexicographically minimize the number of aircraft assigned to the apron, and then the total walking distance by passengers. A new mixed integer linear programming formulation and a matheuristic is proposed for the problem. The proposed formulation is based on the idea of flow of passengers and has smaller size compared to the existing formulations in the literature. The proposed matheuristic, which relies on solving a restricted version of the proposed formulation of the problem, is not only easy to implement but is also very effective. A computational study performed on benchmark instances reveals that the proposed formulation and the matheuristic outperform the existing exact and heuristic algorithms in the literature.
dc.description.provenanceMade available in DSpace on 2024-03-15T11:21:12Z (GMT). No. of bitstreams: 1 A_new_formulation_and_an_effective_matheuristic_for_the_airport_gate_assignment_problem.pdf: 687999 bytes, checksum: 4fc253017cffc03a25e586a2aa9c335e (MD5) Previous issue date: 2023-03en
dc.identifier.doi10.1016/j.cor.2022.106073
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttps://hdl.handle.net/11693/114796
dc.language.isoen
dc.publisherElsevier
dc.relation.isversionofhttps://dx.doi.org/10.1016/j.cor.2022.106073
dc.rightsCC BY 4.0 DEED (Attribution 4.0 International)
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.source.titleComputers and Operations Research
dc.subjectAirport gate assignment problem
dc.subjectMixed integer linear programming
dc.subjectMatheuristic
dc.titleA new formulation and an effective matheuristic for the airport gate assignment problem
dc.typeArticle

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_new_formulation_and_an_effective_matheuristic_for_the_airport_gate_assignment_problem.pdf
Size:
671.87 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.01 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Department of Industrial Engineering