Wesley Vagner Inês Shirabayashi

Wesley Vagner Inês Shirabayashi

Auto-generated profile, based on publicly available information

Wesley Vagner Inês Shirabayashi

Universidade Estadual de Maringá

Research Focus & Metrics

Academic Career Length

14Years (2013-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

1 June 2013
Verified
Conference Paper
Closed access
JVJuliana Verga
Juliana Verga
RSRicardo Coelho Silva
Ricardo Coelho Silva
AYAkebo Yamakami
Akebo Yamakami
WSWesley V. I. Shirabayashi
Wesley V. I. Shirabayashi
In this work, an approach to solve multimodal transport network problems with uncertain costs in the edges is proposed. This kind of problem has been studied for several researchers who search solutions to the large numbers of problems relating on the transport systems like: traffic jam, pollution, delays, among others. In this work, the modelling of this problems is based on graph theory are presented, where each transport mode is represented by a subgraph and the whole graph is the union of all subgraphs. Besides, its mathematical formulation describes nonlinear conditions and the goal is to develop an algorithm that reaches a set of Pareto solutions, which find the best routes between origin and destination. A numerical example is used to illustrate the efficiency of the proposed approach.

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.

25 August 2015
Verified
Conference Paper
Open access
PDF file
JSJuliana V. Shirabayashi
Juliana V. Shirabayashi
AYAkebo Yamakami
Akebo Yamakami
RSRicardo C. Silva
Ricardo C. Silva
WSWesley Vagner I. Shirabayashi
Wesley Vagner I. Shirabayashi
Este trabalho apresenta um algoritmo para o problema de caminho mínimo em grafos coloridos baseado no algoritmo clássico de Ford-Moore-Bellman e aplicado a redes de transporte multimodal, onde cada modo de transporte considerado é representado por uma cor, podendo ter vários arcos entre dois nós do grafo. Durante o procedimento de resolução, o método detecta se houve mudança de modo e um custo referente a esta mudança é acrescentado no caminho, ao final temos um caminho mínimo multimodal com informação de qual modo foi utilizado para percorrer cada arco do caminho. Testes computacionais foram feitos a fim de comprovar a viabilidade do algoritmo proposto.