default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnibal Tavares de Azevedo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Flávia Barbosa
, Priscila C. Berbert Rampazzo, Anibal Tavares de Azevedo, Akebo Yamakami:
The impact of time windows constraints on metaheuristics implementation: a study for the Discrete and Dynamic Berth Allocation Problem. Appl. Intell. 52(2): 1406-1434 (2022)- [j7]Flávia Barbosa, Priscila C. Berbert Rampazzo, Anibal Tavares de Azevedo, Akebo Yamakami:
Correction to: The impact of time windows constraints on metaheuristics implementation: a study for the Discrete and Dynamic Berth Allocation Problem. Appl. Intell. 52(2): 1435 (2022) - 2021
- [j6]Eduardo Tadeu Bacalhau, Luciana Casacio, Anibal Tavares de Azevedo:
New hybrid genetic algorithms to solve dynamic berth allocation problem. Expert Syst. Appl. 167: 114198 (2021) - [c3]Anibal Tavares de Azevedo:
Automatic Generator of Loading Rules and Its Applications on Logistics Operations. DCAI (2) 2021: 141-150 - [c2]Anibal Tavares de Azevedo:
On the Implementation of Simulation-based on Representation by Rules Methodology to Plan Port Logistics Operation. SIMULTECH 2021: 438-444
2010 – 2019
- 2018
- [j5]Anibal Tavares de Azevedo, Luiz Leduíno de Salles Neto, Antônio Augusto Chaves, Antônio Carlos Moretti:
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) - 2016
- [j4]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) - 2014
- [j3]Anibal Tavares de Azevedo, Cassilda Maria Ribeiro, Galeno José de Sena, Antônio Augusto Chaves, Luis Leduíno Salles Neto, Antônio Carlos Moretti:
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) - [j2]Felipe Augusto Moreira da Silva, Antônio Carlos Moretti, Anibal Tavares de Azevedo:
A Scheduling Problem in the Baking Industry. J. Appl. Math. 2014: 964120:1-964120:14 (2014) - 2012
- [c1]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
2000 – 2009
- 2009
- [j1]Anibal Tavares de Azevedo, Aurelio Ribeiro Leite Oliveira, Secundino Soares:
Interior point method for long-term generation scheduling of large-scale hydrothermal systems. Ann. Oper. Res. 169(1): 55-80 (2009)
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-04-24 23:00 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:
