dor_id: 45558

506.#.#.a: Público

590.#.#.d: Los artículos enviados a la revista "Journal of Applied Research and Technology", se juzgan por medio de un proceso de revisión por pares

510.0.#.a: Scopus, Directory of Open Access Journals (DOAJ); Sistema Regional de Información en Línea para Revistas Científicas de América Latina, el Caribe, España y Portugal (Latindex); Indice de Revistas Latinoamericanas en Ciencias (Periódica); La Red de Revistas Científicas de América Latina y el Caribe, España y Portugal (Redalyc); Consejo Nacional de Ciencia y Tecnología (CONACyT); Google Scholar Citation

561.#.#.u: https://www.icat.unam.mx/

650.#.4.x: Ingenierías

336.#.#.b: article

336.#.#.3: Artículo de Investigación

336.#.#.a: Artículo

351.#.#.6: https://jart.icat.unam.mx/index.php/jart

351.#.#.b: Journal of Applied Research and Technology

351.#.#.a: Artículos

harvesting_group: RevistasUNAM

270.1.#.p: Revistas UNAM. Dirección General de Publicaciones y Fomento Editorial, UNAM en revistas@unam.mx

590.#.#.c: Open Journal Systems (OJS)

270.#.#.d: MX

270.1.#.d: México

590.#.#.b: Concentrador

883.#.#.u: https://revistas.unam.mx/catalogo/

883.#.#.a: Revistas UNAM

590.#.#.a: Coordinación de Difusión Cultural

883.#.#.1: https://www.publicaciones.unam.mx/

883.#.#.q: Dirección General de Publicaciones y Fomento Editorial

850.#.#.a: Universidad Nacional Autónoma de México

856.4.0.u: https://jart.icat.unam.mx/index.php/jart/article/view/376/373

100.1.#.a: Díaz Ramírez, J.; Garzón, Y.; Huertas, J.I.

524.#.#.a: Díaz Ramírez, J., et al. (2012). Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines. Journal of Applied Research and Technology; Vol. 10 Núm. 4. Recuperado de https://repositorio.unam.mx/contenidos/45558

245.1.0.a: Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines

502.#.#.c: Universidad Nacional Autónoma de México

561.1.#.a: Instituto de Ciencias Aplicadas y Tecnología, UNAM

264.#.0.c: 2012

264.#.1.c: 2012-08-01

653.#.#.a: Aircraft maintenance routing; flight schedule design; competition; game; Aircraft maintenance routing; flight schedule design; competition; game

506.1.#.a: La titularidad de los derechos patrimoniales de esta obra pertenece a las instituciones editoras. Su uso se rige por una licencia Creative Commons BY-NC-SA 4.0 Internacional, https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es, para un uso diferente consultar al responsable jurídico del repositorio por medio del correo electrónico gabriel.ascanio@icat.unam.mx

884.#.#.k: https://jart.icat.unam.mx/index.php/jart/article/view/376

001.#.#.#: 074.oai:ojs2.localhost:article/376

041.#.7.h: spa

520.3.#.a: For the case of low-cost airlines, which are characterized by having a single fleet with a small number of airplanes, in a previous work, a heuristic algorithm (AFS-MRA) was developed to simultaneously find the flight schedule and the aircraft routes subject to maintenance constraints. This work advances this algorithm by incorporating competition in the planning process (MAFS-MRA). Within a time frame with a given demand data, competition is seen as a game with two players (one airline and all its competitors), where the strategies are all the potential origin-destinations that could be included in the flight schedule, and the payment matrix contains the objective function coefficients that depend on the market share and the routes previously selected. Numerical experimentation was undertaken using real data for the case of two airlines that operate at Toluca International Airport in Mexico. It was found that, by considering competition, the occupation improves to 3% and that the number of flights required to satisfy the demand was reduced to 21%. Besides, the updating process reduces the profit computation error in almost 80%, as compared to the real market behavior for the period under study.

773.1.#.t: Journal of Applied Research and Technology; Vol. 10 Núm. 4

773.1.#.o: https://jart.icat.unam.mx/index.php/jart

022.#.#.a: ISSN electrónico: 2448-6736; ISSN: 1665-6423

310.#.#.a: Bimestral

264.#.1.b: Instituto de Ciencias Aplicadas y Tecnología, UNAM

doi: https://doi.org/10.22201/icat.16656423.2012.10.4.376

harvesting_date: 2023-11-08 13:10:00.0

856.#.0.q: application/pdf

245.1.0.b: Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines

last_modified: 2024-03-19 14:00:00

license_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es

license_type: by-nc-sa

_deleted_conflicts: 2-d8dc24b927e2e6be807b1333cd5d2a91

No entro en nada

No entro en nada 2

Artículo

Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines

Díaz Ramírez, J.; Garzón, Y.; Huertas, J.I.

Instituto de Ciencias Aplicadas y Tecnología, UNAM, publicado en Journal of Applied Research and Technology, y cosechado de Revistas UNAM

Licencia de uso

Procedencia del contenido

Cita

Díaz Ramírez, J., et al. (2012). Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines. Journal of Applied Research and Technology; Vol. 10 Núm. 4. Recuperado de https://repositorio.unam.mx/contenidos/45558

Descripción del recurso

Autor(es)
Díaz Ramírez, J.; Garzón, Y.; Huertas, J.I.
Tipo
Artículo de Investigación
Área del conocimiento
Ingenierías
Título
Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines
Fecha
2012-08-01
Resumen
For the case of low-cost airlines, which are characterized by having a single fleet with a small number of airplanes, in a previous work, a heuristic algorithm (AFS-MRA) was developed to simultaneously find the flight schedule and the aircraft routes subject to maintenance constraints. This work advances this algorithm by incorporating competition in the planning process (MAFS-MRA). Within a time frame with a given demand data, competition is seen as a game with two players (one airline and all its competitors), where the strategies are all the potential origin-destinations that could be included in the flight schedule, and the payment matrix contains the objective function coefficients that depend on the market share and the routes previously selected. Numerical experimentation was undertaken using real data for the case of two airlines that operate at Toluca International Airport in Mexico. It was found that, by considering competition, the occupation improves to 3% and that the number of flights required to satisfy the demand was reduced to 21%. Besides, the updating process reduces the profit computation error in almost 80%, as compared to the real market behavior for the period under study.
Tema
Aircraft maintenance routing; flight schedule design; competition; game; Aircraft maintenance routing; flight schedule design; competition; game
Idioma
spa
ISSN
ISSN electrónico: 2448-6736; ISSN: 1665-6423

Enlaces