AUTHOREA
Log in Sign Up Browse Preprints
LOG IN SIGN UP
Shirmohammad Tavangari
Shirmohammad Tavangari
Visiting Researcher at Stanford University
Visiting Research at Stanford University
Canada

Public Documents 2
Features of metaheuristic algorithm for integration with ANFIS model
Shirmohammad Tavangari

Shirmohammad Tavangari

and 1 more

April 18, 2022
In recent years, many applications based on the Neural Network, Neuro-Fuzzy, and optimization algorithms have been more common for solving regression and classification problems. In the Adaptive neuro-fuzzy inference system(ANFIS), many researchers used the adaption of metaheuristic algorithms with ANFIS to propose the best estimation model. However, many researchers only focused on the experiment without the demonstration mathematical or indicating which characteristic of optimization algorithm, during the run, affect and settable in coordination with ANFIS. The paper provides an adaption of metaheuristic algorithms with ANFIS which has been performed by considering accuracy parameters in layer 1 and layer 4 for the estimation problem. It is integrated six well-known metaheuristic algorithms and extracting the characteristic of them. In the experiment, the metaheuristic algorithms based on the evolutionary computation have been demonstrated more stable than swarm intelligence methods in tuning parameters of ANFIS.
Offering New Routing Method in Ad hoc Networks Using Ant colony algorithm
Shirmohammad Tavangari

Shirmohammad Tavangari

March 14, 2022
The aim of this study is to provide a novel method routing in ad hoc networks using ant colony algorithm. Hence for this study the researcher attempts to discover and create routes with less number of crossings, nodes sustainable and less energy transfer, to reduce latency end-to-end, save bandwidth and to extend the life and increase the lifetime of the network nodes. Research methodology for simulation algorithm has been OPNET software. Therefore, the proposed algorithm`s performance was comparedwith one of the most routing algorithms in mobile ad hoc networks AntHocNet. The results showed that the proposed algorithm compared with AntHocNet has more end-to-end delay, more package shipping, and less routing overhead can reduce energy consumption and thus increasesthe lifetime of the network nodes. The results of this study indicate that the latency end-to-end, saving bandwidth and increasing lifetime of nodes and network lifetime can be predicted by the proposed algorithm. .

| Powered by Authorea.com

  • Home