Emerson Vitor Castelani

Emerson Vitor Castelani

Auto-generated profile, based on publicly available information

Emerson Vitor Castelani

Universidade Estadual de Maringá

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 January 2021 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
ECE. V. Castelani
E. V. Castelani
RLR. Lopes
R. Lopes
WSW. V. I. Shirabayashi
W. V. I. Shirabayashi
FSF. N. C. Sobral
F. N. C. Sobral

2 July 2019 in Journal of Open Source Software
Verified
Journal Article
Open access
PDF file
ECEmerson Castelani
Emerson Castelani
RLRonaldo Lopes
Ronaldo Lopes
WSWesley Shirabayashi
Wesley Shirabayashi
FSFrancisco Sobral
Francisco Sobral

7 April 2021 in Semina: Ciências Exatas e Tecnológicas
Verified
Journal Article
Open access
PDF file
LSLuiz Antonio Farani de Souza
Luiz Antonio Farani de Souza
ECEmerson Vitor Castelani
Emerson Vitor Castelani
WSWesley Vagner Inês Shirabayashi
Wesley Vagner Inês Shirabayashi
In this paper we adapt the Newton-Raphson and Potra-Pták algorithms by combining them with the modified Newton-Raphson method by inserting a condition. Problems of systems of sparse nonlinear equations are solved the algorithms implemented in Matlab® environment. In addition, the methods are adapted and applied to space trusses problems with geometric nonlinear behavior. Structures are discretized by the Finite Element Positional Method, and nonlinear responses are obtained in an incremental and iterative process using the Linear Arc-Length path-following technique. For the studied problems, the proposed algorithms had good computational performance reaching the solution with shorter processing time and fewer iterations until convergence to a given tolerance, when compared to the standard algorithms of the Newton-Raphson and Potra-Pták methods.

23 September 2026 in Journal of Open Research Software
Verified
Journal Article
Open access
PDF file
AZAndré Felipe Zanella
André Felipe Zanella
FJFabrício Faneco Júnior
Fabrício Faneco Júnior
GPGuilherme Philippi
Guilherme Philippi
PAPedro Rochavetz de Lara Andrade
Pedro Rochavetz de Lara Andrade
ECEmerson Vitor Castelani
Emerson Vitor Castelani
GLGislaine Leal
Gislaine Leal
This paper introduces BigVRSP, an instance generator tool for long-haul transportation problems, designed to support numerical experiments in real-life pickup and delivery and truck assignment applications. The software automates the process of building realistic scenarios by combining either historical operational data or artificially generated ones with user preferences through command-line interface (CLI) parameters. Implemented as a series of Python scripts with CLI, it generates structured text datasets as CSV files, for both trucks and customer requests. The tool is openly available in a public repository on Gitlab and can be easily integrated into workflows in many different logistics contexts.

29 June 2026 in OPSEARCH
Verified
Journal Article
Open access
MFMarcelo R. A. Ferreira
Marcelo R. A. Ferreira
ECEmerson V. Castelani
Emerson V. Castelani
WSWesley V. I. Shirabayashi
Wesley V. I. Shirabayashi
In this study, we introduce a method for addressing fitting function determination problems through the framework of Low-Order Value Optimization (LOVO). Our approach is founded on the Levenberg–Marquardt algorithm, where, at each iteration, we aim to solve the minimization problem associated with a component function of the LOVO formulation. We designate this procedure as a persistent iteration. To evaluate the effectiveness of the proposed method, we present numerical results on geometric shape detection tasks, comparing its performance against established techniques for solving LOVO problems available in the literature. As a result of this work, we have an alternative method to those already established in the literature, which, in the context of fitting problems, demonstrates robust performance and, in general, reduces the number of objective function orderings in the associated LOVO problem.