2024-03-28T22:30:27Zhttps://riubu.ubu.es/oai/requestoai:riubu.ubu.es:10259/69772022-11-04T14:12:55Zcom_10259.4_104com_10259_2604col_10259_6848
Fuentes, Manuel
0ebceb64-6edb-4aeb-b305-f361f4cafece
600
Cadarso, Luis
3fd75b2b-06c7-4c08-b4f9-ad4c4b2a9388
600
Vaze, Vikrant
80a75fd1-4531-4698-809b-1306972d5cc4
600
Barnhart, Cynthia
532cc483-7fa8-4370-b71e-a665a254a916
600
2022-09-21T10:10:11Z
2022-09-21T10:10:11Z
2021-07
978-84-18465-12-3
http://hdl.handle.net/10259/6977
10.36443/10259/6977
Trabajo presentado en: R-Evolucionando el transporte, XIV Congreso de Ingeniería del Transporte (CIT 2021), realizado en modalidad online los días 6, 7 y 8 de julio de 2021, organizado por la Universidad de Burgos
Combinatorial optimization problems abound in the field of airline planning. Aircraft and
passengers fly on networks made up of flights and airports. To schedule aircraft, assignments
of fleet types to flights and of aircraft to routes must be determined. The former is known as
the fleet assignment problem while the latter is known as the aircraft routing problem in the
literature. Aircraft routing is typically addressed as a feasibility problem, the solution to
which is required for the construction of crew schedules. All these issues are typically
resolved 4 to 6 months before the day of operations. As a result, there is little information
available about each aircraft's operational status when making such decisions. The tail
assignment problem, which has received little attention in the literature, is solved when
additional information about operational conditions is revealed, with the goal of determining
each aircraft's route for the day of operations while accounting for the originally planned
aircraft routes and crew schedules. As a result, it is a problem that must be resolved closer
to the day of operations. We propose a mathematical programming approach based on
sequencing that captures all operational constraints and maintenance requirements while
minimizing operational costs and schedule changes relative to original plans. The
computational experiments are based on realistic cases drawn from a Spanish airline with
over 1000 flights and over 100 aircraft.
This research was supported by Project Grants TRA2016-76914-C3-3-P by the Ministerio de Economía y Competitividad, Spain, and CAS19/00036 by the Ministerio de Ciencia, Innovación y Universidades, Spain.
application/pdf
eng
Universidad de Burgos. Servicio de Publicaciones e Imagen Institucional
R-Evolucionando el transporte
http://hdl.handle.net/10259/6490
https://doi.org/10.36443/9788418465123
info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2013-2016/TRA2016-76914-C3-3-P/ES/ROBUSTEZ, EFICIENCIA Y RECUPERACION DE SISTEMAS DE TRANSPORTE PUBLICO
info:eu-repo/grantAgreement/MICIU/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/CAS19%2F00036
Planificación del transporte
Industria aérea
Planning of transport
Airline industry
Ingeniería civil
Transporte
Tecnología
Civil engineering
Transportation
Technology
A novel approach to the tail assignment problem in airline planning
info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/openAccess
2309
2320
THUMBNAIL
Fuentes_CIT2021_2309-2320.pdf.jpg
Fuentes_CIT2021_2309-2320.pdf.jpg
IM Thumbnail
image/jpeg
4039
https://riubu.ubu.es/bitstream/10259/6977/3/Fuentes_CIT2021_2309-2320.pdf.jpg
30e6a7e274e44c7bd970c4e47a324470
MD5
3
LICENSE
license.txt
license.txt
text/plain; charset=utf-8
1362
https://riubu.ubu.es/bitstream/10259/6977/2/license.txt
5d013bfa6e473ff0db22cd82a4d71a70
MD5
2
ORIGINAL
Fuentes_CIT2021_2309-2320.pdf
Fuentes_CIT2021_2309-2320.pdf
application/pdf
191172
https://riubu.ubu.es/bitstream/10259/6977/1/Fuentes_CIT2021_2309-2320.pdf
89d88e047cf376b277f95ece771676cf
MD5
1
10259/6977
oai:riubu.ubu.es:10259/6977
2022-11-04 15:12:55.217
Repositorio Institucional de la Universidad de Burgos
bubrep@ubu.es
RWwgYXV0b3IgY29tbyDDum5pY28gdGl0dWxhciBkZSBsb3MgZGVyZWNob3MgZGUgcHJvcGllZGFkIGludGVsZWN0dWFsIGRlIGxhIG9icmEsIG8gZGlzcG9uaWVuZG8gZGUgbG9zIGRlYmlkb3MgcGVybWlzb3MgZGUgbG9zIG90cm9zIHRpdHVsYXJlcywgc2kgbG9zIGh1YmllcmEsIHkgZW4gdmlydHVkIGRlIGxvcyBkZXJlY2hvcyBxdWUgbGUgY29uZmllcmUgbGEgbGVnaXNsYWNpw7NuIHZpZ2VudGUgc29icmUgcHJvcGllZGFkIGludGVsZWN0dWFsIHkgZGVyZWNob3MgZGUgYXV0b3IsIApBVVRPUklaQSBhIGxhIFVuaXZlcnNpZGFkIGRlIEJ1cmdvcyBhIGRpZnVuZGlyLCBkZSBtYW5lcmEgZ3JhdHVpdGEsIGVsIGNvbnRlbmlkbyBkZSBsb3MgYXJjaGl2b3MgZGlnaXRhbGVzIHF1ZSBjb3JyZXNwb25kZW4gYWwgZG9jdW1lbnRvIGRlc2NyaXRvIGFudGVyaW9ybWVudGUsIGNvbiBjYXLDoWN0ZXIgbm8gZXhjbHVzaXZvIHkgZGUgbWFuZXJhIHDDumJsaWNhIGVuIGFjY2VzbyBhYmllcnRvIGEgdHJhdsOpcyBkZSBJbnRlcm5ldCwgcGFyYSBsbyBxdWUgbGEgQmlibGlvdGVjYSBwcm9jZWRlcsOhIGEgYXJjaGl2YXJsb3MgZW4gZWwgUmVwb3NpdG9yaW8gSW5zdGl0dWNpb25hbC4gQXNpbWlzbW8gYXV0b3JpemEgYSBsYSBVbml2ZXJzaWRhZCBkZSBCdXJnb3MgYSByZWFsaXphciBsYXMgdHJhbnNmb3JtYWNpb25lcyBuZWNlc2FyaWFzIGRlIGZvcm1hdG8sIG5vIGRlIGNvbnRlbmlkbywgcGFyYSBnYXJhbnRpemFyIGxhIHByZXNlcnZhY2nDs24geSBlbCBhY2Nlc28gZW4gZWwgZnV0dXJvLgoKRWwgYXV0b3IgZGlzcG9uZSwgZW4gdG9kbyBjYXNvLCBkZWwgZGVyZWNobyBhIHJldm9jYXIgZXN0YSBhdXRvcml6YWNpw7NuLgoKTGEgY2VzacOzbiBkZSBkZXJlY2hvcyBkZSBlc3RhIG9icmEgc2UgZW5jdWVudHJhIHN1amV0YSBhIGxhIGxlZ2lzbGFjacOzbiB2aWdlbnRlIHNvYnJlIHByb3BpZWRhZCBpbnRlbGVjdHVhbCB5IGRlcmVjaG9zIGRlIGF1dG9yLiBTdSBkaWZ1c2nDs24gZW4gZWwgUmVwb3NpdG9yaW8gc2Vyw6EgYmFqbyBsYSBtb2RhbGlkYWQgZGUgbGljZW5jaWEgQ3JlYXRpdmUgQ29tbW9ucyBvIGVxdWl2YWxlbnRlOiByZWNvbm9jaW1pZW50byDigJMgdXNvIG5vIGNvbWVyY2lhbCDigJMgc2luIG9icmEgZGVyaXZhZGEsIHBvciBsYSBxdWUgc2UgcGVybWl0ZSBoYWNlciBjb3BpYSwgZGlzdHJpYnVpciB5IGNvbXVuaWNhciBww7pibGljYW1lbnRlIGxhIG9icmEgc2llbXByZSBxdWUgc2UgY2l0ZSBhbCBhdXRvciwgZWwgdXNvIHF1ZSBzZSBoYWdhIGRlIGVsbGEgc2VhIG5vIGNvbWVyY2lhbCB5IG5vIHNlIGNyZWVuIG9icmFzIGRlcml2YWRhcyBhIHBhcnRpciBkZSBsYSBvcmlnaW5hbC4K