default search action
Antonio Augusto Chaves
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Antônio Augusto Chaves
, Bárbara Lessa Vianna
A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem. Expert Syst. Appl. 238(Part A): 121735 (2024) - [j22]Cleder Marcos Schenekemberg
A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems. Transp. Sci. 58(4): 687-707 (2024) - [c13]Antonio Augusto Chaves
A Continuous-GRASP Random-Key Optimizer. MIC (1) 2024: 15-20 - [c12]Antônio Augusto Chaves, José Fernando Gonçalves
An adaptive biased random-key genetic algorithm for the tactical berth allocation problem. SAC 2024: 378-385 - [i2]Antonio Augusto Chaves, Mauricio G. C. Resende, Ricardo M. A. Silva:
A random-key GRASP for combinatorial optimization. CoRR abs/2405.18681 (2024) - 2022
- [j21]Juliano Cavalcante Bortolete, Luis Felipe Bueno
A support tool for planning classrooms considering social distancing between students. Comput. Appl. Math. 41(1) (2022) - [j20]Cleder M. Schenekemberg
The dial-a-ride problem with private fleet and common carrier. Comput. Oper. Res. 147: 105933 (2022) - [c11]Luiz Henrique Nogueira Lorena
An Adaptive Biased Random-key Genetic Algorithm for Rank Aggregation with Ties and Incomplete Rankings. CEC 2022: 1-8 - [c10]Geraldo R. Mauri, Luiz Henrique Nogueira Lorena
Solving the Point Feature Cartographic Label Placement problem using Jaccard index as a measure of labels intersection. CEC 2022: 1-8 - 2021
- [j19]Tiago Tiburcio da Silva
A new multicommodity flow model for the job sequencing and tool switching problem. Int. J. Prod. Res. 59(12): 3617-3632 (2021) - [j18]Geraldo Regis Mauri
Hybrid metaheuristics to solve a multiproduct two-stage capacitated facility location problem. Int. Trans. Oper. Res. 28(6): 3069-3093 (2021) - [c9]Luiz Henrique Nogueira Lorena
A Biased Random-key Genetic Algorithm with a Local Search Component for the Optimal Bucket Order Problem. CEC 2021: 375-382 - [c8]Antônio Augusto Chaves, Luiz Henrique Nogueira Lorena
An Adaptive and Near Parameter-Free BRKGA Using Q-Learning Method. CEC 2021: 2331-2338 - 2020
- [j17]Eliseu Junio Araújo, Antônio Augusto Chaves, Luiz Antonio Nogueira Lorena
A mathematical model for the coverage location problem with overlap control. Comput. Ind. Eng. 146: 106548 (2020) - [c7]Marcelo Branco do Nascimento, Antonio Augusto Chaves:
An Automatic Algorithm Configuration based on a Bayesian Network. CEC 2020: 1-8
2010 – 2019
- 2019
- [j16]Eliseu Junio Araújo, Antônio Augusto Chaves, Luiz Antonio Nogueira Lorena
Improving the Clustering Search heuristic: An application to cartographic labeling. Appl. Soft Comput. 77: 261-273 (2019) - [j15]Tiago Tiburcio da Silva
The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics. Comput. Appl. Math. 38(4) (2019) - [j14]Fabrício Lacerda Biajoli, Antônio Augusto Chaves
A biased random-key genetic algorithm for the two-stage capacitated facility location problem. Expert Syst. Appl. 115: 418-426 (2019) - [c6]Davi Melo Morales, Antônio Augusto Chaves, Alvaro Luiz Fazenda:
Parallel Clustering Search Applied to Capacitated Centered Clustering Problem. IPDPS Workshops 2019: 542-548 - 2018
- [j13]Anibal Tavares de Azevedo
Solving the 3D stowage planning problem integrated with the quay crane scheduling problem by representation by rules and genetic algorithm. Appl. Soft Comput. 65: 495-516 (2018) - [j12]Antônio Augusto Chaves, José Fernando Gonçalves
Adaptive biased random-key genetic algorithm with local search for the capacitated centered clustering problem. Comput. Ind. Eng. 124: 331-346 (2018) - [c5]William Higino, Antonio Augusto Chaves, Vinícius Veloso de Melo:
Biased Random-Key Genetic Algorithm Applied to the Vehicle Routing Problem with Private Fleet and Common Carrier. CEC 2018: 1-8 - 2017
- [j11]Rudinei Martins de Oliveira, Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
A comparison of two hybrid methods for constrained clustering problems. Appl. Soft Comput. 54: 256-266 (2017) - 2016
- [j10]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid method with CS and BRKGA applied to the minimization of tool switches problem. Comput. Oper. Res. 67: 174-183 (2016) - [j9]Eliseu Junio Araújo, Antonio Augusto Chaves, Luiz Leduíno de Salles Neto, Anibal Tavares de Azevedo
Pareto clustering search applied for 3D container ship loading plan problem. Expert Syst. Appl. 44: 50-57 (2016) - 2015
- [j8]Yasel J. Costa Salas
Clustering Search and Variable Mesh Algorithms for continuous optimization. Expert Syst. Appl. 42(2): 789-795 (2015) - 2014
- [j7]Rudinei Martins de Oliveira, Luiz Antonio Nogueira Lorena
Hybrid heuristics based on column generation with path-relinking for clustering problems. Expert Syst. Appl. 41(11): 5277-5284 (2014) - [j6]Anibal Tavares de Azevedo
Solving the 3D container ship loading planning problem by representation by rules and meta-heuristics. Int. J. Data Anal. Tech. Strateg. 6(3): 228-260 (2014) - 2012
- [j5]Mayron César O. Moreira
Simple heuristics for the assembly line worker assignment and balancing problem. J. Heuristics 18(3): 505-524 (2012) - [c4]Anibal Tavares de Azevedo, Cassilda Maria Ribeiro, Galeno José de Sena, Antonio Augusto Chaves, Luis Leduíno Salles Neto, Antônio Carlos Moretti:
Solving the 3D Container Ship Loading Planning Problem by Representation by Rules and Beam Search. ICORES 2012: 132-141 - 2011
- [j4]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem. Expert Syst. Appl. 38(5): 5013-5018 (2011) - [j3]Adenilson R. Carvalho, Fernando Manuel Ramos, Antonio Augusto Chaves:
Metaheuristics for the feedforward artificial neural network (ANN) architecture optimization problem. Neural Comput. Appl. 20(8): 1273-1284 (2011) - 2010
- [j2]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Clustering search algorithm for the capacitated centered clustering problem. Comput. Oper. Res. 37(3): 552-558 (2010) - [i1]Mayron César O. Moreira, Alysson M. Costa, Marcus Ritt, Antonio Augusto Chaves:
Simple heuristics for the assembly line worker assignment and balancing problem. CoRR abs/1003.3676 (2010)
2000 – 2009
- 2009
- [b1]Antonio Augusto Chaves:
A hybrid metaheuristic with clustering search applied to combinatorial optmization problems. National Institute for Space Research, São José dos Campos, Brazil, 2009 - [c3]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem. Hybrid Metaheuristics 2009: 1-14 - 2008
- [c2]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem. EvoCOP 2008: 123-134 - [p1]Antonio Augusto Chaves, Francisco de Assis Corrêa, Luiz Antonio Nogueira Lorena
Clustering Search Heuristic for the Capacitated p -Median Problem. Innovations in Hybrid Intelligent Systems 2008: 136-143 - 2007
- [j1]Francisco de Assis Corrêa, Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena:
Hybrid heuristics for the probabilistic maximal covering location-allocation problem. Oper. Res. 7(3): 323-343 (2007) - 2005
- [c1]Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena
Hybrid Algorithms with Detection of Promising Areas for the Prize Collecting Travelling Salesman Problem. HIS 2005: 49-54
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: