Show simple item record

hal.structure.identifier
dc.contributor.authorFurini, Fabio*
hal.structure.identifierUniversité de Bologne
dc.contributor.authorKidd, Martin Philip*
hal.structure.identifier
dc.contributor.authorPersiani, Carlo Alfredo*
hal.structure.identifierUniversité de Bologne
dc.contributor.authorToth, Paolo*
dc.date.accessioned2015-04-07T11:19:47Z
dc.date.available2015-04-07T11:19:47Z
dc.date.issued2015
dc.identifier.issn1094-6136
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/14879
dc.language.isoenen
dc.subjectRolling horizon algorithms
dc.subjectAircraft sequencing problem
dc.subjectMILP
dc.subject.ddc003en
dc.titleImproved rolling horizon approaches to the aircraft sequencing problem
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn a scenario characterized by a continuous growth of air transportation demand, the runways of large airports serve hundreds of aircraft every day. Aircraft sequencing is a challenging problem that aims to increase runway capacity in order to reduce delays as well as the workload of air traffic controllers. In many cases, the air traffic controllers solve the problem using the simple “first-come-first-serve” (FCFS) rule. In this paper, we present a rolling horizon approach which partitions a sequence of aircraft into chunks and solves the aircraft sequencing problem (ASP) individually for each of these chunks. Some rules for deciding how to partition a given aircraft sequence are proposed and their effects on solution quality investigated. Moreover, two mixed integer linear programming models for the ASP are reviewed in order to formalize the problem, and a tabu search heuristic is proposed for finding solutions to the ASP in a short computation time. Finally, we develop an IRHA which, using different chunking rules, is able to find solutions significantly improving on the FCFS rule for real-world air traffic instances from Milano Linate Airport.en
dc.relation.isversionofjnlnameJournal of Scheduling
dc.relation.isversionofjnlvol18
dc.relation.isversionofjnlissue5
dc.relation.isversionofjnldate2015
dc.relation.isversionofjnlpages435-447
dc.relation.isversionofdoi10.1007/s10951-014-0415-8
dc.relation.isversionofjnlpublisherSpringeren
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.relation.Isversionofjnlpeerreviewedoui
dc.date.updated2016-01-08T13:50:03Z
hal.identifierhal-01273501*
hal.version1*
hal.update.actionupdateMetadata*
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record