A. A. Chaves / UNIFESP
Professor · UNIFESP · São José dos Campos

Antonio Augusto
Chaves

Institute of Science and Technology  ·  Federal University of São Paulo

My research focuses on the design and analysis of metaheuristic algorithms for combinatorial optimization problems. I develop hybrid methods — combining metaheuristics, local search, and machine learning components — applied to logistics, routing, and scheduling problems.

Metaheuristics RKO Combinatorial Optimization NP-hard
View Publications Download CV
Antonio A. Chaves
80+
Publications
1k+
Citations
15+
Years Active
18 h-index
Scopus
Google Scholar Lattes CV ORCID UNIFESP · ICT
Career

Professional History

2025 — Present
Editor-in-Chief
Pesquisa Operacional (POpe) Journal
2011 — Present
Associate Professor
Federal University of São Paulo — UNIFESP
2023 – 2027 Coordinator of the Graduate and Research Chamber
2018 – 2021 Coordinator of the Postgraduate Program in Operational Research (UNIFESP / ITA)
2009 — 2011
Assistant Professor
São Paulo State University — UNESP
Lines of Research

Research Areas

Developing efficient algorithms that solve hard combinatorial problems by combining metaheuristic strategies with mathematical programming.

Metaheuristic Design

Development of population-based and trajectory methods, including BRKGA, GRASP, VNS, and ILS frameworks, with practical application analysis.

RKO Framework

Foundations of the Random-Key Optimizer (RKO), including random-key representation and decoder-based solution construction for combinatorial optimization.

Hybrid Methods

Integration of metaheuristics with integer programming, constraint programming, and machine learning to enhance solution quality and scalability.

Scheduling & Planning

Optimization of production scheduling, project management, and resource allocation under uncertainty, with applications to healthcare and manufacturing.

Vehicle Routing Problems

Exact and heuristic approaches for VRP variants (CVRP, VRPTW, MDVRP), incorporating real-world constraints from logistics and supply-chain contexts.

Clustering & Partitioning

Graph partitioning, p-median problems, and data clustering formulated as integer programs and solved with specialized metaheuristic approaches.

Selected Works

Recent Publications

Peer-reviewed articles in international journals. For the complete list, visit Google Scholar or the Lattes platform.

2025
A Random-Key optimizer for combinatorial optimization
Chaves, A.A.; Resende, M.G.C.; Schuetz, M.J.A.; Brubaker, J.K.; Katzgraber, H.G.; Arruda, E.F.; Silva, R.M.A.  ·  Journal of Heuristics
RKOCombinatorial Optimization
DOI ↗
2023
A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems
Schenekemberg, C.M.; Guimarães, T.A.; Chaves, A.A.; Coelho, L.C.  ·  Transportation Science
Branch-and-CutRoutingInventory
DOI ↗
2022
The Dial-a-Ride Problem with Private Fleet and Common Carrier
Schenekemberg, C.M.; Chaves, A.A.; Coelho, L.C.; Guimarães, T.A.; Avelino, G.G.  ·  Computers and Operations Research
Dial-a-RideVRPFleet
DOI ↗
2021
A New Multicommodity Flow Model for the Job Sequencing and Tool Switching Problem
Silva, T.T.; Chaves, A.A.; Yanasse, H.H.  ·  International Journal of Production Research
SchedulingFlow ModelSequencing
DOI ↗
2018
Adaptive Biased Random-Key Genetic Algorithm with Local Search for the Capacitated Centered Clustering Problem
Chaves, A.A.; Gonçalves, J.F.; Lorena, L.A.N.  ·  Computers & Industrial Engineering
BRKGAClusteringLocal Search
DOI ↗
View All on Google Scholar
Courses

Teaching

Undergraduate and graduate courses offered at UNIFESP's Institute of Science and Technology.

01

Metaheuristics

Design and analysis of metaheuristic algorithms for combinatorial optimization, covering GRASP, VNS, Simulated Annealing, Genetic Algorithms, and BRKGA.

Undergraduate - Graduate
02

Operations Research

Linear programming, integer programming, and network flow problems. Modeling and computational tools for real-world optimization.

Undergraduate - Graduate
03

Aautomata Theory

Emphasis on the theoretical foundations of computation and the limits of algorithmic problem-solving.

Undergraduate - Graduate
04

Integer Programming

Integer programming formulations and exact solution methods: branch-and-bound, cutting planes, Benders decomposition, and column generation.

Graduate
Get in Touch

Contact

I welcome collaborations, questions about my research, and prospective graduate students.

Institution
UNIFESP — Instituto de Ciência e Tecnologia
São José dos Campos, SP, Brazil
Office
Room 114, ICT-UNIFESP
Av. Cesare Mansueto Giulio Lattes, 1201
Google Scholar
View Profile
CNPq Lattes
Currículo Lattes