Advanced search
Start date
Betweenand

New hybrid methods to resolve combinatorial optimization problems

Abstract

Over the last decades, studies concerning efficient metaheuristics has risen considerably among researchers in combinatorial optimization. Hybrid metaheuristics, in particular, has found the best results for many optimization problems. The main goal of this project is to develop and improve new alternatives for the hybrid Clustering Search method (CS), making it flexible, robust and efficient both in terms of the quality of the solutions and the computational effort. We intend to research this project through three different sub-research lines which include: the development of a new way of detecting promising areas, the designing of a multiobjective CS and the exploration of ways to parallelize the CS. These proposed methods are applied to resolve different optimization problems with many practical applications. The computational tests will use cases available in the literature and if possible, real cases using data from companies in the region. (AU)

Articles published in Agência FAPESP Newsletter about the research grant:
More itemsLess items
Articles published in other media outlets ( ):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications
(The scientific publications listed on this page originate from the Web of Science or SciELO databases. Their authors have cited FAPESP grant or fellowship project numbers awarded to Principal Investigators or Fellowship Recipients, whether or not they are among the authors. This information is collected automatically and retrieved directly from those bibliometric databases.)
ARAUJO, ELISEU JUNIO; CHAVES, ANTONIO AUGUSTO; DE SALLES NETO, LUIZ LEDUINO; DE AZEVEDO, ANIBAL TAVARES. Pareto clustering search applied for 3D container ship loading plan problem. EXPERT SYSTEMS WITH APPLICATIONS, v. 44, p. 50-57, . (12/17523-3)
MORALES, DAVI MELO; CHAVES, ANTONIO AUGUSTO; FAZENDA, ALVARO LUIZ; IEEE. Parallel Clustering Search applied to Capacitated Centered Clustering Problem. 2018 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2018), v. N/A, p. 7-pg., . (15/24485-9, 12/17523-3, 14/50937-1)
CHAVES, A. A.; LORENA, L. A. N.; SENNE, E. L. F.; RESENDE, M. G. C.. Hybrid method with CS and BRKGA applied to the minimization of tool switches problem. Computers & Operations Research, v. 67, p. 174-183, . (12/17523-3)