---

Informações resumidas do Currículo Lattes

Currículo Lattes atualizado em 13/07/2021

ORCID: https://orcid.org/0000-0002-6831-2006

Nome em citações bibliográficas: NORONHA, THIAGO F.;NORONHA, THIAGO FERREIRA;Noronha, Thiago Ferreira de

---

Formação acadêmica

Doutorado em Informática na Pontifícia Universidade Católica do Rio de Janeiro em 2008
Mestrado em Informática na Pontifícia Universidade Católica do Rio de Janeiro em 2004
Graduado em Ciência da Computação na Universidade Federal do Rio Grande do Norte em 2001

---

Projetos de pesquisa em andamento

2019 a Atual	Coordenador do projeto - PQ/CNPq - Desenvolvimento de algoritmos para problemas de Otimização Robusta Integrantes: Thiago Ferreira de Noronha (coordenador).
2018 a Atual	Coordenador do projeto - PPM/FAPEMIG - Algoritmos para Problemas de Otimização em Redes sem Fio Integrantes: Thiago Ferreira de Noronha (coordenador).

Projetos de desenvolvimento em andamento

Veja todos os projetos no Currículo Lattes

---

Últimas publicações

Artigos em periódicos

The integrated uncapacitated lot sizing and bin packing problem
2021. RAIRO-OPERATIONS RESEARCH.
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
2020. JOURNAL OF GLOBAL OPTIMIZATION.
Integer Linear Programming Formulations for the Variable Data Rate and Variable Channel Bandwidth Scheduling Problem in Wireless Networks
2019. Computer Networks.
On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
2019. RAIRO-OPERATIONS RESEARCH.
A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems
2017. International Transactions in Operational Research.
Heuristic and exact algorithms for product configuration in software product lines
2017. International Transactions in Operational Research.
A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
2017. Computers & Operations Research.
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
2016. Journal of Global Optimization.
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
2014. Discrete Applied Mathematics.
An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
2014. Journal of Global Optimization.
A biased random-key genetic algorithm for routing and wavelength assignment
2011. JOURNAL OF GLOBAL OPTIMIZATION (DORDRECHT. ONLINE).

Trabalhos completos em congressos

A min-max regret approach for the Steiner Tree Problem with Interval Costs
2020. Simpósio Brasileiro de Pesquisa Operacional.
Heurísticas Construtivas para o Problema de Corte Guilhotinado Bidimensional em 3 Estágios com Restrições de Precedência
2019. Simpósio Brasileiro de Pesquisa Operacional.
Heurísticas híbridas para o problema de cobertura de alvos utilizando sensores
2018. Simpósio Brasileiro de Pesquisa Operacional.
An Experimental Evaluation of the Algorithm Mean Upper Heuristic for Interval Data Min-Max Regret Combinatorial Optimization Problem
2017. Brazilian Conference on Intelligent Systems.
A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs
2017. International Conference on Variable Neighborhood Search.
Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows
2017. International Conference on Variable Neighborhood Search.
Modelos e heuristicas para o problema integrado de Dimensionamento de Lotes não capacitado e Empacotamento de Produtos
2017. Simpósio Brasileiro de Pesquisa Operacional.
A biased random-key genetic algorithm for the Multi-period, Multi-rate and Multi-channels with variable bandwidth Scheduling Problem
2017. Metaheuristic International Conference.
Formulation and algorithms for the robust maximal covering location problem
2017. International Network Optimization Conference.
On the finite optimal convergence of logic-based Benders? decomposition in solving 0-1 min-max regret optimization problems with interval costs
2016. 4th International Symposium on Combinatorial Optimization.
A Scenario Based Heuristic for the Robust Shortest Path Tree Problem
2016. 8th IFAC Conference on Manufacturing Modelling, Management and Control.
Coupling Scenario-Based Heuristics to Exact Methods for the Robust Set Covering Problem with Interval Data
2016. 8th IFAC Conference on Manufacturing Modelling, Management and Control.
Robust Optimization for OSPF Routing
2016. 8th IFAC Conference on Manufacturing Modelling, Management and Control.
Sobre a complexidade do problema da Árvore de Caminhos Mais Curtos Robusta
2016. XLVIII Simpósio Brasileiro de Pesquisa Operacional.
BRKGA com Decodificadores Mistos para o Problema de Roteamento e Atribuição de Comprimentos de Onda
2016. XLVIII Simpósio Brasileiro de Pesquisa Operacional.
Operadores de Recombinação para um Algoritmo Genético Híbrido Aplicado ao Problema de Roteamento de Veículos com Janela de Tempo
2016. XLVIII Simpósio Brasileiro de Pesquisa Operacional.

Resumos expandidos em congressos

Algorithms for the min-max regret 0-1 Integer Linear Programming Problem with Interval Data
2019. Metaheuristics International Conference.
A genetic algorithm for maximizing the accepted demands in routing and wavelength assignment in optical networks
2015. Metaheuristic International Conference.
A linear programming based heuristic for robust optimization problems: a case study on solving the restricted robust shortest path problem
2014. 5th International Workshop on Model-Based Metaheuristics.
A biased random-key genetic algorithm for the robust shortest path problem
2012. Global Optimization Workshop 2012.
A random-keys genetic algorithm for routing and wavelength assignment
2007. The Seventh Metaheuristics International Conference.

Resumos em congressos

Heuristic and exact algorithms for product configuration in software product lines
2018. Proceeedings of the 22nd International Conference.
Modelos e Heurísticas para o Problema Integrado de Dimensionamento de Lotes e de Empacotamento
2018. XIX Latin-Iberoamerican Conference on Operations Research.
Biased random-key genetic algorithms for divisible load scheduling
2015. 27th European Conference on Operational Research.
A Biased Random-key Genetic Algorithm to Maximize the Accepted Lightpaths in WDM Optical Networks
2014. INFORMS Anual Meeting.
Une étude de modèles mathématiques pour le problème du plus court chemin robuste
2013. 14ème congrès de la Sociètè Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF).

Veja todas as publicações no Currículo Lattes

---

Orientações em andamento

Mestrado

José Ferreira Reis Fonseca. Algoritmos para problemas de k-cobertura em redes de sensores com tolerância a falhas. Início: 2020. Universidade Federal de Minas Gerais (Orientador principal)
Isabella de Melo Freitas. A definir. Início: 2020. Universidade Federal de Minas Gerais (Orientador principal)
José Joaquim de Andrade Neto. Algoritmos para o Problema de Escalonamento de Conexões em Redes Wi-Fi. Início: 2019. Universidade Federal de Minas Gerais (Orientador principal)

Doutorado

Mateus Vilela Souza. Coupling Optimization and Simulation
to Supervise a Fleet of Autonomous Agricultural Robots. Início: 2019. Université d'Auvergne (Co orientador)

Veja todas as orientações no Currículo Lattes

---