A matheuristic for practical flights arrival and departure scheduling

Ahmadian, MM; Salehipour, A

A matheuristic for practical flights arrival and departure scheduling

Ahmadian, MM Salehipour, A

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: IEEE International Conference on Industrial Engineering and Engineering Management, 2021, 2020-December, pp. 1162-1166
Issue Date:: 2021

Closed Access

	Filename	Description	Size
	A_Matheuristic_for_Practical_Flights_Arrival_and_Departure_Scheduling.pdf	Published version	3.94 MB	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	Ahmadian, MM
dc.contributor.author	Salehipour, A
dc.date	2020-12-14
dc.date.accessioned	2021-11-28T05:02:40Z
dc.date.available	2021-11-28T05:02:40Z
dc.date.issued	2021
dc.identifier.citation	IEEE International Conference on Industrial Engineering and Engineering Management, 2021, 2020-December, pp. 1162-1166
dc.identifier.isbn	9781538672204
dc.identifier.issn	2157-3611
dc.identifier.issn	2157-362X
dc.identifier.uri	http://hdl.handle.net/10453/151890
dc.description.abstract	Delays in flights arrival and departure are costly because they adversely impact the passenger experience and result in significant operational costs. Effective management of runways considerably contributes to minimizing such delays. In this paper, we propose an efficient matheuristic algorithm, namely the relax-and-solve (RS), for the problem of scheduling flights arrival and departure on airport's runway with the objective function of minimizing the weighted delays, where delay is measured by the total deviation from the target arrival and departure times. We test the proposed RS on two sets of 27 real-world instances for Milan international airport, and compare the results of our RS and the optimal solution of the same instances. We show that our proposed algorithm obtains almost all the best- known solutions within one minute, even for the largest instances including 170 aircraft. Those characteristics of the proposed RS algorithm are very important for practical settings, particularly, the typical short time window available for planning the aircraft landings and departures at busy airports demands for quick delivery of quality schedules (or updating the current schedule), and fast and effective algorithms are therefore paramount.
dc.language	en
dc.publisher	IEEE
dc.relation	http://purl.org/au-research/grants/arc/DE170100234
dc.relation.ispartof	IEEE International Conference on Industrial Engineering and Engineering Management
dc.relation.ispartof	IEEE International Conference on Industrial Engineering and Engineering Management
dc.relation.isbasedon	10.1109/IEEM45057.2020.9309838
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	A matheuristic for practical flights arrival and departure scheduling
dc.type	Conference Proceeding
utslib.citation.volume	2020-December
utslib.location.activity	Singapore, Singapore
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.consider-herdc	false
dc.date.updated	2021-11-28T05:02:37Z
pubs.finish-date	2020-12-17
pubs.place-of-publication	Piscataway, USA
pubs.publication-status	Published
pubs.start-date	2020-12-14
pubs.volume	2020-December
dc.location	Piscataway, USA

Abstract:

Delays in flights arrival and departure are costly because they adversely impact the passenger experience and result in significant operational costs. Effective management of runways considerably contributes to minimizing such delays. In this paper, we propose an efficient matheuristic algorithm, namely the relax-and-solve (RS), for the problem of scheduling flights arrival and departure on airport's runway with the objective function of minimizing the weighted delays, where delay is measured by the total deviation from the target arrival and departure times. We test the proposed RS on two sets of 27 real-world instances for Milan international airport, and compare the results of our RS and the optimal solution of the same instances. We show that our proposed algorithm obtains almost all the best- known solutions within one minute, even for the largest instances including 170 aircraft. Those characteristics of the proposed RS algorithm are very important for practical settings, particularly, the typical short time window available for planning the aircraft landings and departures at busy airports demands for quick delivery of quality schedules (or updating the current schedule), and fast and effective algorithms are therefore paramount.

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

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