Title:	Otimização de negociação dinâmica para múltiplas áreas restritas de fluxo no programa de opções de trajetórias colaborativo
Authors:	Cruciol, Leonardo Luiz Barbosa Vieira
Orientador(es)::	Weigang, Li
Coorientador(es)::	Clarke, John-Paul
Assunto::	Teoria dos jogos Sistemas Multiagentes (SMA) Tráfego aéreo - gerenciamento
Issue Date:	25-Feb-2016
Data de defesa::	3-Dec-2015
Citation:	CRUCIOL, Leonardo Luiz Barbosa Vieira. Otimização de negociação dinâmica para múltiplas áreas restritas de fluxo no programa de opções de trajetórias colaborativo. 2015. 204 f., il. Tese (Doutorado em Informática)—Universidade de Brasília, Brasília, 2015.
Abstract:	The optimization of resources in air traffic management is a computationally complex problem. During the last year, the Collaborative Trajectory Options Program (CTOP) had started as an operational evolution of current air traffic management programs by Federal Aviation Administration in USA. This program is part of Next Generation Air Transportation System initiative and makes possible to improve airlines' business results. Airlines have a great issue to decide how many routes might be sent for each flight, because of the uncertainty in this complex process. The development of a solution that handle dynamically, as soon as CTOP has started, it was very complex considering the information modeling to be used. A wrong strategy could achieve delays several times greater. There is a solution for this problem, which used greedy algorithms to find out the routes with minimum delay for a specific airline in CTOP. However, this solution does not handle the uncertainty involved once some unreal assumptions are made. So, this thesis presents an innovation model to suggest how many routes should be sent by intelligent systems to handle uncertainties. The negotiation process was divided into two levels. First, using the computational model Single Games for CTOP (SG-CTOP), how to realize a dynamical and automatic optimization in the dispute process of available slots for multiple flow constrained areas during the first negotiation, which there is no previous knowledge about competitors. Second, using the computational model Repeated Games for CTOP (RG-CTOP), how the competitors' strategy could change the strategy of an airline and makes possible to learn by competitors' reputation, adjusting the past strategies. The achieved results by both computational models are promising for airlines. In the case studies, 20.000 CTOP negotiations were generated. Thus, it was studied several cases and strategies used in CTOP. The SG-CTOP achieved a performance better, or equal, in 97% of CTOP negotiations, when it was compared to others strategies, representing a delay reduction of 537 hours for the airline. The RG-CTOP achieved a rate improvement about 21% for an airline, when it was used a learning process by adapting its strategies against competitors to be allocated in better available slots.
metadata.dc.description.unidade:	Instituto de Ciências Exatas (IE) Departamento de Ciência da Computação (IE CIC)
Description:	Tese (doutorado)—Universidade de Brasília, Instituto de Ciências Exatas, Departamento de Ciência da Computação, 2015.
metadata.dc.description.ppg:	Programa de Pós-Graduação em Informática
Licença::	A concessão da licença deste item refere-se ao termo de autorização impresso assinado pelo autor com as seguintes condições: Na qualidade de titular dos direitos de autor da publicação, autorizo a Universidade de Brasília e o IBICT a disponibilizar por meio dos sites www.bce.unb.br, www.ibict.br, http://hercules.vtls.com/cgi-bin/ndltd/chameleon?lng=pt&skin=ndltd sem ressarcimento dos direitos autorais, de acordo com a Lei nº 9610/98, o texto integral da obra disponibilizada, conforme permissões assinaladas, para fins de leitura, impressão e/ou download, a título de divulgação da produção científica brasileira, a partir desta data.
DOI:	http://dx.doi.org/10.26512/2015.12.T.19560
Appears in Collections:	Teses, dissertações e produtos pós-doutorado

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.