CJCarlos Alberto da Silva Junior

Carlos Alberto da Silva Junior

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Carlos Alberto da Silva Junior has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Systematic Study on Solving Aerospace Problems Using Metaheuristics

    by Carlos Alberto da Silva Junior, Marconi de Arruda Pereira, Angelo Passaro

    Complex engineering problems can be modelled as optimisation problems. For instance, optimising engines, materials, components, structure, aerodynamics, navigation, control, logistics, and planning is essential in aerospace. Metaheuristics are applied to solve these optimisation problems. The present paper presents a systematic study on applying metaheuristics in aerospace based on the literature. Relevant scientific repositories were consulted, and a structured methodology was used to filter the papers. Articles published until March 2022 associating metaheuristics and aerospace applications were selected. The most used algorithms and the most relevant hybridizations were identified. This work also analyses the main types of problems addressed in the aerospace context and which classes of algorithms are most used in each problem.


  • Open Access

    High-level hybridization of heuristics and metaheuristics to solve symmetric TSP: a comparative study

    by Carlos Alberto da Silva Junior, Roberto Yuji Tanaka, Luiz Carlos Farias da Silva, Angelo Passaro

    The Travelling Salesman Problem - TSP is one of the most explored problems in the scientific literature to solve real problems regarding the economy, transportation, and logistics, to cite a few cases. Adapting TSP to solve different problems has originated several variants of the optimization problem with more complex objectives and different restrictions. Metaheuristics have been used to solve the problem in polynomial time. Several studies have tried hybridising metaheuristics with specialised heuristics to improve the quality of the solutions. However, we have found no study to evaluate whether the searching mechanism of a particular metaheuristic is more adequate for exploring hybridization. This paper focuses on the solution of the classical TSP using high-level hybridisations, experimenting with eight metaheuristics and heuristics derived from k-OPT, SISR, and segment intersection search, resulting in twenty-four combinations. Some combinations allow more than one set of searching parameters. Problems with 50 to 280 cities are solved. Parameter tuning of the metaheuristics is not carried out, exploiting the different searching patterns of the eight metaheuristics instead. The solutions' quality is compared to those presented in the literature.

  • Open Access

    Multi-objective optimization of a hypersonic airbreathing vehicle

    by Pedro P. B. Araújo, Roberto Y. Tanaka, Carlos A. Silva, Angelo Passaro, Paulo G. P. Toro

    Multi-objective optimization of a hypersonic airbreathing engine (scramjet technology) was carried out with the aim of maximizing thrust and minimizing drag while satisfying a series of design constraints, such as avoiding unstart (blockage of supersonic flow within the combustion chamber) by ensuring that the pressure ratio across the shock waves remains below the adverse pressure gradient given by the Korkegi limit, geometry correction to achieve shock on-lip condition, and temperature and pressure requirements at the inlet exit. Using the relations presented in the literature, pressure and viscous drag are estimated analytically. The analytical approach is verified against computational fluid dynamics data from Ansys Fluent to solve two-dimensional compressible Reynolds-averaged Navier–Stokes flow equations, with transition shear stress transport as the turbulence closure model. Comparing the total drag and the flow properties at the combustion chamber entrance shows the model's feasibility for the optimization approach. Three different approaches were conducted to formulate the multi-objective function to determine the one that can find the highest number of geometries satisfying the Korkegi limit with the highest net thrust. The best approach was the multi-objective function formulated with the uninstalled thrust, total pressure recovery, and pressure drag, concentrating the search in the region with greater uninstalled thrust and lower drag and nearly doubling the value of net thrust compared to the first formulation, which uses the uninstalled thrust, pressure drag, and viscous drag.