See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/358742098
A Study on Various Particle Swarm Optimization Techniques used in Current
Scenario
Chapter · February 2022
DOI: 10.46632/dmfar/1/1/3
CITATIONS
READS
17
375
4 authors:
A Pon Bharathi
Ramachandran Manickam
AMRITA COLLEGE OF ENGINEERING AND TECHNOLOGY
REST Labs
34 PUBLICATIONS 64 CITATIONS
325 PUBLICATIONS 2,422 CITATIONS
SEE PROFILE
SEE PROFILE
Kurinjimalar Ramu
Sathiyaraj Chinnasamy
REST Labs
REST Labs
38 PUBLICATIONS 271 CITATIONS
37 PUBLICATIONS 383 CITATIONS
SEE PROFILE
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Characterization and Modification of Poly-Ether Ether Ketone (PEEK) Composites as Bearing Cage Material for Textile Machinery View project
numerical analysis of composite laminates View project
All content following this page was uploaded by A Pon Bharathi on 21 February 2022.
The user has requested enhancement of the downloaded file.
DOI: https://doi.org/10.46632/dmfar/1/1/3
Design, Modelling and Fabrication of Advanced Robots
Vol: 1(1), 2022
REST Publisher; ISBN: 978-81-948459-3-5
Website: http://restpublisher.com/book-series/design-modelling-and-fabrication-ofadvanced-robots/
A Study on Various Particle Swarm Optimization Techniques
used in Current Scenario
*Pon Bharathi, M. Ramachandran, Kurinjimalar Ramu, Sathiyaraj Chinnasamy
Department of Electronics and Communication Engineering, Amrita College of Engineering and Technology, India.
REST Labs, Kaveripattinam, Krishnagiri, Tamil Nadu, India.
*
Corresponding author Email: bharathpon@gmail.com
Abstract. Particle swarm optimization (PSO) is a computational method. Has been Optimization, Particle swarm
optimization, Discrete PSO, Parallel PSO, Orthogonal Learning Particle Swarm Optimization OLPSO, Binary particle
swarm optimization, Multigrouped Particle Swarm Optimization (MGPSO), High exploration particle swarm
optimization, that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given
measure of quality. The book by Kennedy and Bernhard describes many philosophical aspects of PSO and swarm
intelligence. The Disadvantages of the particle mass optimization (PSO) algorithm are that it is easy to fall locally
optimized at high dimensional space and has a low integration rate in the recirculation process. The computational
complexity of DWCNPSO is accepted when used to solve high dimensional and complex problems. Particle mass
optimization (PSO) is one of the bio-inspired algorithms, and finding the optimal solution in place of the solution is a
simple one. It differs from other upgrade algorithms in that it requires only objective functionality and is not subject to
gradient or objective particle mass optimization It does not depend on any different form, as proposed in the paper, as
mentioned in the original, sociologists believe that At the school of fish or in a group A flock of migratory birds can
"benefit from the experience of all other members." In other words, when a bird flies and randomly searches for food,
for example, all the birds in the herd can share their findings and help the whole flock to hunt better.
1. Introduction
Particle swarm optimization (PSO) is a computational method that improves the problem by trying to improve a candidate
solution based on a given standard. Describes many philosophical aspects of PSO and mass intelligence. Article mass
optimization is the mass of particles where the particle represents a viable solution (optimal state). The particle multidimensional search location detects the position that is optimal for that location (optimal position for maximum or minimum
values is possible). Discrete Particle Swarm Optimization (DPSO) algorithms are provided to solve complex optimization
problems such as knob sock and clustering. The proposed algorithm mainly uses the idea of information stored and exchanged
between particles by the Information Sharing Team (ISM). There are two reasons to use the idea. To begin with, the
mechanism enables the storage and exchange of information, creating a unique algorithm for solving collective problems.
Analysis of body systems is also an important tool in decision making optimization. Mathematically, of all the possible
solutions, the problem of finding the best solution from the set is the optimization problem. Optimization Issue: Extending
certain functions associated with specific packages to indicate the range of options available in a particular situation or
reduction. The function allows you to compare different choices to determine what is “best”. Optimization Issue: Increases or
decreases the range of options available in a given situation for certain functions associated with specific packages. This
function allows you to compare different choices to determine which one is the "best" one. In computational science, PSO is
induced by population-based evolutionary algorithm and social behavior simulation, which differs from the natural selection
scheme of genetic algorithms. Behavior. Orthogonal thinking is an active approach that collects inputs that are completely
different from the current state, in as much diversity as possible. Particle mass optimization (PSO) algorithm is usually
achieved by changing the recession weight or by combining other evolutions with instructions. However, in most modified
PSO algorithms, binary particle optimization particle optimization (PSO) is a complete optimization method commonly used
for sequential domains. Binary PSO is a form of PSO used for binary domains, but uses concepts about speed and velocity
from continuous PSO, which leads to its finite performance. However, this is often stuck in the local belief because the
particles move faster near the ideal particle. This article or section needs sources or references that appear in credible, thirdparty publications. The method is targeted. It is a complete optimization technique inspired by flocks and herds of birds and
insects. Like other Swarm intellectual methods, this method has its own drawbacks: i.e., premature loss of coordination and
rapid loss of diversity. In this study, PSO introduced a new optimization system based on a combination of PSO and two
novel operators to enhance the research capability of the algorithm (HEPSO).
2. Optimization
Copyright@ 2022 REST Publisher
15
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
Optimization algorithms in general because of its integration, efficiency, strength and ease of implementation. These
features of the algorithm have attracted its attention to solve nonlinear, indistinguishable, multimodal optimization problems.
However, before using the algorithm, some parameters of the PSO must be specified by the user. The goal of this work is to
change the equation that improves the speed of the PSO so that the two (pi -xi) terms The coefficients are automatically
generated using the Gaussian probability distribution [1].
High
exploration
particle
swarm
optimization
(HEPSO)
Discrete
Particle
swarm
optimization
(DPSO)
Particle
swarm
optimizatio
n
(PSO)
Multigrouped
Particle Swarm
Optimization
(MGPSO)
Parallel
Particle
swarm
optimization
(PPSO)
Orthogonal
Learning
Particle
Swarm
Optimization
(OLPSO)
Binary
particle
swarm
optimization
(BPSO)
FIGURE 1. Various of Particle swarm optimization.
Crowd-based mechanisms emerged as a powerful family of optimization techniques inspired by the collective behavior of
social animals. In Particle Mass Optimization (PSO), a set of candidate solutions to the optimization problem, the best of
their own and neighboring The parameter that defines the paths driven by performance is defined as the mass of particles that
can flow at intervals [2]. Possibility of particle optimization to solve different types of optimization problems in chemical
measurements, Detailed description of the algorithm (illustrating the importance of proper selection of its met parameters)
And is shown by selected job examples in the signal fields. Warping, predictably robust PCA solutions and variable selection
[18].We have previously published work[3]. Maximum speed and sluggish weight will escape local optimization and affects
the ability to refine global optimization. Social Factor and personal factor study and Ability to exploit Determine. The size of
the crowd is the need for global optimization and calculation cost Balances. Finally, topography condemns Both the ability to
share information and the cost of communication. When exploring large problem intervals, optimization algorithms are
explored and exploited to balance effectively[4]. Usually, with a fist It is wise to do a detailed study of space Then focus on
the areas of the area that seem the most promising. Due to the ease of perception and optimistic optimization ability in
various issues, much of the focus is on PSO researchers. Most works focus on two aspects[5]. First, the performance of the
PSO by changing the parameters Combined with development, population diversity enhancement and other improving
approaches. Second, the Such as multi-objective optimization Applications of PSO in various areas [6].To compare the
effectiveness of optimization methods, it is important to modify their behavioral parameters for optimization problems at
hand, thus both optimization methods will do best on the particular problem. Using the simple and efficient technique of
provided meta-optimization, The LUS method is used here as the Overlay Meat Optimizer to detect the behavior parameters
of PSO and its variants offline. LUS can often be found to be optimal in relatively few iterations, due to the calculation time
required for each iteration in Meat optimization[7]. Search-out in meta-optimization makes the right choice of behavior
parameters, which will be briefly described later, and gives better results than previous approaches. Literature. Metaoptimization [2].Central and optimized for each iteration during the optimization process, centers and LDWPSO's The
parameters were the same as in the above tests for function improvement[8]. And Approximately for better comfort care,
Copyright@ REST Publisher
16
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
two-dimensional function upgrade on common optimization issues to demonstrate that this is happening, a 30-dimensional
rastrikrin functional upgrade is being conducted Neural network training is a complex optimization problem [9].This new
complement, called Ant Colony Optimization (ACO), is a multidisciplinary integration Strong and versatile ability to deal
with optimization issues Has also been found to be effective. Much of the calculation in PSO Easy. Compared to other
developing calculations, this is a huge optimization capability Occupied and can be easily finished, where can they see the
success of their neighbours[10]. Movements by search space are guided by these successes, generally at the end of the
population test, a problem solver is better than a non-mass approach using the same methods. For each particle optimization
problem Ant Colony optimization algorithms are used for many integrated optimization problems, representing a candidate
solution from dual allocation to folding Derived from protein or routing vehicles and so on The methods are real variables,
such as random variable problems Have been modified. Problems, multiple goals and parallels processes [11].
3. Particle swarm optimization
Particle mass optimization (PSO) is a standard optimization approach, It maintains the mass of candidate solutions,
"Flying" through high-dimensional search space Particles, each particle is attracted to the nearest optimal solution. And the
best solution found by the particle. The position of the particle containing the particle, xi, is adjusted by a random velocity vi,
It depends on the particle's best solution and the distance from its surroundings. The traditional way to improve ANN
weights is to use slope-based optimization [12]. PSO is Based on two basic disciplines: Social Science and Computer
Science. In addition, PSO uses the concept of mass intelligence, which is property of an organization through which the
collective behaviors of non-subtle agents interacting with their environment locally form coherent global functional
patterns[13]. Therefore, PSO is the cornerstone of Genetic Algorithm (GA) and Particle Mass Optimization (PSO) Such as
computational intelligence-based techniques. Would be the solution to the above problems. Classical particle aggregation
algorithm in solving standard optimization problems Has proven to be very effective and computationally efficient.
However, this method can be used in a dynamic setting When not efficient, the optimal value may change again and
again[14]. One an adaptation approach to the original PSO algorithm was introduced to fix this problem. The adaptation
concept is integrated by approximately changing the particles or changing the parameters of the PSO [7]. Particle mass
optimization (PSO) is a new population Holistic method based on models holistic optimization It is very important to create
random shots with good consistency[15]. Its quality minimizes Storage to achieve the required accuracy and Determines the
calculation time. Such created Sequences may be "random" enough for one application, but will not be random for another
use application [6]. PSO derived from the study of artificial life and predatory behavior Basic concepts of. Imagine such a
scene: A flock of birds is looking for random food, the only one in the area Food only, all birds know where the food is, but
the current location is from the food They do not know how far[16]. Then the optimal strategy for finding food, it is simpler
and it would be very useful to search for the latest bird in the diet. The PSO algorithm is inspired by the biological
population behavior used to solve optimization problems. In PSO, every possible solution to the optimization problem can be
considered as a point of dimensional search space, which we call particles, all the particles having an exercise value
determined by the objective function [17]. The speed of each particle determines the direction and distance they fly; The
particle solution follows the current optimal particles in space search because the basic PSO algorithm is for collaboration
and competition between groups. Reliance is not a mechanism of particle variation, thus making it difficult to break out of
the individual‟s local extreme controls. With a local intensive control of particles, successful detection requires the help of
other particles. In fact, PSO algorithm upgrade capability from particle interaction and interaction [19]. The ability of the
PSO algorithm to upgrade the algorithm to eliminate particle interaction and interaction is very limited. A passive parameter
Experienced to improve the overall performance of PSO, own of socio-cognitive gradients defined in standard PSO Based on
experience and the most successful particle experience [20]. The FDR-PSO algorithm adds a new dimension to this
approach, each particle will leak from the experience of neighboring particles with better fitness than itself. This change in
PSO is consistent with the actual dynamics of organisms within groups. The FDR-PSO name suggests the fitness-distanceratio algorithm. This version of the PSO algorithm was found to be more successful than the single-particle select variants, in
which all speed components are in the updated direction [21]. The inertial weight decreasing the may improve the
accumulation speed, while the chaos mutation is localized Improving the ability to opt out of Optima. Pre-integration and
post-standardization of standard PSO to deal with oscillations, an exponential reduction of recession weight and improved
PSO A uniform mutation is proposed to form. Neatly. In all its evolutionary processes The approximate search level and the
minute search level are variable [22]. Creation in Est. (8) - (12) is a hybrid phenomenal and integer Is a programming
problem that lacks efficient algorithms, so this study introduces the PSO heuristic method, latest evolutionary methods one
for solving the PO problem. Social interaction such as bird flock and fish school and Based on the communication metaphor.
The mass in the PSO is the Population and every member of the population Called a particle, which in this study Refers to a
portfolio. The PSO approach of this study was compared with the other three approaches, GA, TS and SA test data [23].
4. Discrete PSO
The unique PSO algorithm and problem particle system, the particle optimization algorithm designed to improve complex
in terms of the metaphor of numerical functions and human social interactions, in two main components Has the potential to
reflect the ability of human societies to process rooted knowledge. Methods: Artificial life (such as bird flock, fish school and
swarm); Also, the main idea of evolutionary calculation [24]. That is, potential solutions fly through hyperspace and towards
Copyright@ REST Publisher
17
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
better or more optimal solutions Are accelerated. Its prototype can be executed in the simplest form of computer codes and
memory It is computationally cheap in terms of both requirements and speed. Unique PSO approaches, levels and velocities
are real value vectors Regular PSO to solve permutation problems[25]. All Problem variables are generally independent of
each other, Hence the velocity and position vectors for each dimension Updates are made independently. However, since
Variables (permutation elements) Are not independent of each other, continuous PSOs cannot be used directly for
permutation problems[26]. Eqs Original update rules permutation elements Copy and / or skip. The points discussed above, in
this paper, prompted the creation of a new efficient unique PSO (DPSO) algorithm. Our proposed DPSO uses the assembly
problem structure to Achieve accurate results This new project is assembly Although tested for problem. Performance
Analysis of Unique PSO Algorithm Bench-Mark Issues Proposed by PSO Algorithm Are solved by the unique version[27].
The mass size considered in this study is 20 and proposed. The maximum number allowed to report results using the
algorithm is 50. The Mac-span declared by the algorithm is specified in the Mac-span of the proposed algorithm and
compared. Well known solution[28]. Two PSO algorithms are available in the literature Their PSOs were mixed with
simulated one‟s analgesics. The proposed model considers these restrictions individually and may be extended to include
additional restrictions. Second, the original PSO speed and level update on a separate solution to the multicast routing
problem New standalone PSO operators have been introduced to change the rules. Third, the new PSOGA hybrid multicast
routing that combines PSO and genetic operators but the update mechanism generates floating point values that are
concentrated in the domain Improved by riding parameters [29]. Proposed Hybrid Algorithm PSO and Gene The best qu
'performance can be achieved by overcoming the shortcomings of both methods [17]. The stand-alone PSO, real number in
previous introduction Applies to spaces only. However, many Application display of optimization issues the qualitative
differences between individual numeric spaces or variables. A unique version of the PSO was developed to deal with this
problem[30]. In the standalone PSO model, two values are defined for each particle level (0 and 1). The parameters of the
individual PSOs are c1 = c2 = 1.49445, ω = 0.7, and Amex = 0.8. In each test, the fitness functional value for different
repetitions is c = 1000, of repetitions The number was also t = 50. In OpenStack planning cpu_allocation_ratio and
ram_allocation_ratio Were set to 16 and 3, respectively [31]. Based on the coding technique developed by Woo, this paper
designs a unique PSO system for GTSP. In the traditional PSO mode, different particles or the same of the positions between
the different moments of the particle. The difference is used when estimating speed to check validity. of the proposed
standalone PSO method, and we calculate 21 instances in F'C. 8OOMHz processor and 64M memory[32]. Unique PSO
system GTSP Wang et al. A "swap operator" was created to solve TSP using PSO 1201. Therefore, the difference between the
positions of the two particles is some Considered the sum of the swap operators, this is called the "swap sequence". This way,
he can run PSO operators [33]. The most common approaches to using the PSO framework for task planning in cloud
computing is plagued by local optimism or to find the optimal value due to the random motion of the particles Fails. In our
experimental analysis, continuous PSOs are converted into separate PSOs This phenomenon was observed due to the methods
used for conversion. Therefore, the algorithm of the proposed method is complex analysis of a new standalone PSO algorithm
is given and the method is compared with the other two unique PSO Approaches in Cloud Computing Literature[34]. A
Unique PSO algorithm Eqs based particle upgrade. (8) and (9) the planning problem requires a new task, But the update
mechanism generates floating point values that are concentrated in the domain. Ocean of optimization problems includes
single or binary variables; more common examples include scheduling issues or routing issues. The update formula and
process of the PSO algorithm is first and foremost continuous Although designed for space, it has its application Restricted to
personal optimization domains, so particle level and speed required some modification to modify continuous PSO[35]. Most
unique PSO algorithms above Discrete PSO to solve discrete optimization are indirect optimization strategies that determine
More probable than the algorithm Based binary variables; Therefore, it does not fully utilize the performance of the PSO
algorithm[36]. In dealing with the integer variable, the PSO algorithm will come to the local minimum Very easy from the
original PSO algorithm, individual and its peer experience A unique PSO algorithm that has been learned should follow this
idea. In addition to hybrid and discrete PSO algorithms, there are many PSO variations to suit specific problems, also in this
section, the other for individual particle upgrade in both binary and multi-value We review attitudes. Compare the
performance of ICPSO with competing approaches This analysis provides the context necessary for our experiments to be
seen. In addition, this section helps to highlight the problems in the individual PSO, and then, the jet for the sample solution
[37]. The probability of obtaining the element value k is the kth period of the vector jet elements. Period. This is the solution
element 0 Allows the first user to take any value up to a specified n. This fitness assessment involves many steps beyond just
implementing a complete PSO. This is the original Allows adjacent values to be related to their fitness, as defined by
function. Unique to assorted issues and unique to our experimental design in the PSO literature [38].
5. Parallel PSO
Theoretically analyzing the PSO algorithm and its work Try to understand the mechanism. Better to change its structure
Try to get performance. In the PSO algorithm Read the influence of various parameters configuration. Read the various
influences topographic structures on the PSO algorithm. Read the parallel PSO algorithm. The remainder of this paper will
begin with a brief overview of current research on the PSO algorithm from the above eight categories. We cannot do
everything better because there are too many related studies, so we choose some representatives [39].The UCLA-PSO
algorithm, PSO kernel as for is tested numerically accurately and efficiently, and exercise performance is evaluated
externally. It allows the use of Various EM simulation tools (i.e., FDTD, Mom, PO / PTD) An exercise without changing the
PSO kernel as an appraiser. parallel PSO / FDTD algorithm. To further reduce the calculation time, the optimization process
Copyright@ REST Publisher
18
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
is implemented in parallel clusters[40]. Since each particle is considered an independent agent, PSO is inherently parallel.
Parallel calculation benefits the algorithm by assigning one of the parallel processors to each agent. The calculation of
particle positions and velocities is only a small part of the whole lesson, compared to the calculation time in fitness estimates.
The master-slave approach is practical for creating a parallel PSO framework. As a test of the parallel PSO / FDTD
algorithm, the optimizer is used for the basic antenna design problem in this section [41].Parallel PSO processes are
considered to be the rough parallel of fitness rating calculations in parallel clusters of computers. So, unlike tens of
thousands to hundreds or thousands of high-performance computers, we often target our computer with small track
microprocessors or FPGAs. Therefore, the goal of the parallel PSO is to bring about a suitable and efficient framework for
parallel PSOs, including the nature of the problem, how well different subgroups divide the search space into a minimum
overlap, the configuration of random number sources and the communication strategy [42].In this work, a new way of
improving using the PSO method is presented. As seen in the previous subsections, feed and solid flow rates can be
improved using productivity-based objective operation. Eleventh, extract and recirculation flow rates, on the other hand,
using Eleventh Consumption, in a parallel PSO algorithm, relate the values of two objective processes to one, one based on
productivity and the other. Eleventh is based on consumption, i.e. two optimal points are obtained for each iteration [43].The
above limitations in the synchronous parallel PSO algorithm can be overcome by considering an asynchronous algorithm
where design points will be analyzed before the end of the current design iteration in the next design iteration. The goal is to
be without idle processors when moving from one layout new release to the next. The key to implementing an asynchronous
parallel PSO set of rules is to separate the replace movements associated with each factor and the moves related to the
aggregate as an entire[44]. These update tactics consist of updating the recession in the cutting-edge work, imposing and
evaluating synchronous and asynchronous parallel PSO algorithms. The parallel scheme used here is based on the messaging
interface (MPI) to offer number one worker activation. Two parallel PSO algorithms are used to diversify the design of a not
unusual lengthy-haul aircraft segment within the Boeing 767 elegance. Parallel PSO Since its inception, versions of the
unique PSO had been advanced to consult others [45].The traditional parallel PSO algorithm uses the master-slave mode.
The primary process is mainly the random initiation of the population, of tasks Includes distribution and selection of particles
according to exercise value. Each people explores the environment individually, which avoids the problem of local minima.
At the same time, when following the multi-thread method, the research results of each book Basically a new asynchronously
based on the enhanced Parallel PSO Parallel (APSO-BQSA) We propose a reinforcement learning algorithm[46]. The
APSO-BQSA algorithm is first asynchronous PSO Introduces Algorithm in Asynchronous Reinforcement Learning, It uses
our improved parallel PSO algorithm. Analytical Test Problems Two well-known analytical test problems The performance
of a parallel PSO algorithm is great with many local minima Were used to estimate the scale (for the mathematical
explanation of the two problems See back links)[47]. Parallel in ANSI C PSO project and required communication layer
implemented using the Messaging Interface (MPI) libraries on the Linux operating system. Synchronization and
implementation from parallel PSO algorithm, Parallel PSO algorithm. Simultaneous operation and scaling for parallel
operation on multiple processor machines The algorithm should work in such a way that it can be easily reduced[48]. Also, it
is highly desirable that it be scalable. Measurement is the number of computational nodes that the nature of the algorithm can
use Should not be restricted, it allows full use of available computational resources. Given the distributed generation
environment, the problem of optimal planning for the next day's BSS shipment Can be divided into sub-issues, the first
trouble being to decide the gold standard quantity of electricity to be stored or added through the BSS for the duration of
each operational length[49]. With the goal of lowering goal pastime; The second hassle is to evaluate the goal characteristic
for each energy configuration of the BSS acquired by means of solving the primary hassle. To remedy the second hassle,
hourly modern is required to pick out the effect of DERs and loads placed at the DC grid. To remedy those issues, this paper
proposes Energy Management Systems (EMS) designed with a master-slave method, which makes use of a parallel PSO
(PPSO) set of rules and a one-hour electric flow system based on continuous approximations [50].
6. Orthogonal Learning Particle Swarm Optimization OLPSO
In orthogonal learning particle optimization (OLPSO), the OL method combines the information of Pi and Pn to shape a
dependable guiding vector Po and, however, adjusts the flight in order that the facts coming from Pi or Pn may be used
immediately, Vector Po most effective shops the code of Pi and Pan, but now not the actual values[51]. Therefore, at
OLPSO, the parameters of the GPSO, LPSO, OLPSO-G and OLPSO-L, in widespread, begin at ω 0.9 after which lower to
0.4 at jogging time. Acceleration coefficients c1, c2 and c are all set to two.0. The G parameter for OLPSOs is about to 5
[52]. It is difficult to combine global optimization. The SPSOA slowly coalesces and eventually develops into poorly optimal
fitness in this case. In contrast, OLPSOA-L significantly improves the average optimal solution, while OED is used to
develop the OL strategy for PSOA (OLPSOA). In this way, the best combination of the two prototypes can be configured to
guide the particle to fly more evenly towards global optimization, although OLPSOA still uses the traditional PSOA [53]. In
this section, the traditional PSO learning mechanism was first introduced, followed by the motivations for developing a new
OL strategy. Then, the OED method and the implementation of the OL strategy are presented[54]. Two complete OLPSO
algorithms are obtained at the end of the section, so this paper aims to develop an OL strategy that can quickly integrate a
promising search direction toward global optimization and predict higher resolution accuracy. Details on OED method, OL
strategy and OLPSO algorithm are described in the following sections[55]. The solutions obtained by the OLPSOs are
Copyright@ REST Publisher
19
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
compared with those obtained by the PSOs without the OL strategy in compares the mean values and the standard deviations
of the detected solutions. The effectiveness of the OL strategy provides the PSO with an ability to detect, protect, and use
useful information of learning prototypes, with the best results marked on the bold face, with OLPSO expected to bring
improved performance in multimedia operations rather than local optimism[56]. In fact, the test results for the f5-f10
functions given in support this intuition. OLPSO-G surpasses GPSO in all six multimedia functions. OLPSO-L gives the best
performance in four PSOs in all six multimodal operations, based on average solutions and standard deviations. In
comparison, GPSO in f7, f9 and f10 functions can only reach the global optimal level while LPSO in F7 and f9
functions[57]. Above all, OLPSO-L can be found to be universally optimized in all functions and can show significantly
improved performance reaching only OLPSO-L. To improve PSO's learning strategy when looking for complex problem
intervals, their proposed orthogonal learning correction of Conventional PSO by way of introducing a progressive orthogonal
experimental layout (OED) mechanism in stage mastering in particle mass optimization (OLPSO)[58]. At OLPSO, the
conventional PSO mastering mechanism is changed by using an orthogonal getting to know (OL) strategy, which creates an
efficient and promising prototype for gaining knowledge of a particle. By using OED without dropping generality, every
dimension is considered a component. With this, OLPSO [30]. OLPSO's performance in improving PEC is evaluated and in
comparison with each the proposed GA approach and the PSO method[59]. The parameters of GA and PSO are set in step
with the systems of their specs. For populace length and maximum era quantity, they are set at 30 and 500 in each GA and
PSO, respectively. Population size OLPSO The rest of this paper is prepared as follows. Section II describes the PEC and
OLPSO implementation. Section III proposes to use OLPSO to clear up the PEC trouble, consisting of exercise feature and
the entire set of rules process. Section IV makes use of the dollar regulator layout example to verify the overall performance
of the OLPSO [60].
7. Binary particle swarm optimization
Binary Particle Mass Optimization proposed a unique binary version of PSO for binary problems in their model, a particle
saying "yes" or "no", "true" or "false", "not adding" or "not adding" these binary values are real in the binary search space
May be a representation of value. In binary PSO, the individual particles are updated as well as the best continuous sequence
worldwide. The main difference between a binary PSO with a continuous version is that the velocities of the particles are
defined in terms of the probabilities of changing a bit[61]. Using this definition, a velocity must be controlled within the
range, so a graph was introduced to map all true value velocity numbers to the range. This section describes binary particle
optimization, our proposed scheme, using modified BPSO, genotype-phenotype feedback and mutation operator[62]. The
velocity and binary level parameters of the original BPSO are related to the modified BPSO status genetic type and the
phenotype of the status, respectively. Furthermore, considering a characteristic feature of the genetic type of the condition
(speed in the original BPSO), we recommend a mutation operator to improve the performance of the BPSO based on our
previous work. Function[63]. In particular, the status update of the BPSO does not use current status information. In other
words, the next level of BPSO is not affected by the current situation, but only by speed. When upgrading a position in the
BPSO, it makes no sense to know where a particle is currently located in the binary search space. Due to this fact, even
though the binary level is already in PPSO, speed seems to be a particle[64]. The performance criteria of the algorithm are
discussed considering the effect of the algorithm parameters. Particle structure and knowledge sharing through topology are
also discussed. In BPSO, in this section, our proposed project is described using the modified BPSO, the genotype-phenotype
concept and the mutation director. The speed and binary level parameters of the original BPSO are similar to the modified
BPSO level and the genotype of the phenotype, the main difference between PSO and BPSO being the level upgrade
process[65]. In particular, the status update of the BPSO does not use current status information. In other words, the next
level of BPSO is not affected by the current situation, but only by speed. This refers to when upgrading a position in BPSO.
The original BPSO was proposed to allow the PSO to operate at binary issue intervals. In this version, particles can take
values of 0 or 1 for their position vectors and fly only in binary search space[66]. It was said that by introducing this method,
the computational problem of BPSO can be reduced while optimizing efficiency can be improved. However, this change has
not been able to solve the various problems in this category stuck in the local minima, comparing the proposed transfer
functions with each other to evaluate and select the best one[67]. Then a comparative study with six recent changes to BPSO.
The was created using BPSO. Each particle is 19 by 16 matrix, corresponding to the number and duration of Sch, ILs. Equal
to 1 if the IL is reduced at the interval; BPSO was used to create the reduction for the required reduction A total of 100
simulations were implemented to accurately assess the performance of the planner. The effectiveness of BPSO for IL
planning was further explored by increasing the required reduction rate[68]. BPSO was still able to create without violating
the regulations, but the probability of creating such was low. developed contained violations of the soft controls, and the
number of violations increased with the complexity of the issues. The function is used to normalize the velocity of a particle,
i.e. for vid2 BPSO, the velocities increase at their absolute value until the Vmax limits are reached, at which point the BPSO
has small probes. Velocities approaching Vmax can occur very quickly, and when that happens, a small probability of 0.018
(for Vmax = 4) will change slightly[69]. Now when we change the vertical k of the sigmoid function in the BPSO, the
sigmoid function will be zero in a straight line parallel to the horizontal This gives a probability close to 0.5 and BPSO. Our
Genetic Binary Particle Swarm Optimizer (GBPSO) is primarily based at the unique binary PSO described in Section II-B.
Here, we are introducing start and dying fees in the populace to enhance the agility of the populace and increase the
possibility of its particles[70]. In our machine, each particle is considered as a binary vector within the ad dimensional space
Copyright@ REST Publisher
20
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
(binary strings or chromosomes period d), and in each era, the particles are up to date within the identical manner as the
debris within the binary PSO, in our experiments, the start population ratios (b (t)) and mortality with GBPSO (b (t)) The m
(t) ratio is about beneath equations 31 and 32, and the populace length is first of all set to P (0) = 1. Considering those
settings, the population size of GBPSO is [71].
8. Multigrouped Particle Swarm Optimization (Mgpso)
Multi-group Mutant particle optimization, is the same as the original PSO Much like detecting multiple optics using Makes it
difficult because PSO has an intrinsic limit Contains, it integrates all particles into a single point in the final stage. To
overcome this limit, MMPSO's new We proposed the concept Let's search it for the highest peaks in multimedia operation
When the number of groups is N, and to improve the global search, use the mutation operator of multimedia process using
Get the best update[72]. The potential of PSO. One proposed pseudocode interpretation Multi-Group Particle Swarm
Optimization with a new method called Random Redistribution (MGRR-PSO) Is called. It combines two groups of PSOs
with opposite acceleration coefficients Some particles are redistributed approximately Each time they are stuck in local
optimism The new algorithm has better results than standard PSO in multimedia high dimensional operation [73].To
compare the performance of conventionally accepted methods Conventional MGPSO and niching genetic algorithm ATMGPSO measures the area of each group Increases, thus all of a particular group Particles are sometimes of other groups
Occupy territories. In such a situation in solutions not included in the regions of any other group Let's make the best of the
team by choosing the best Cannot be defined. In nature, to fight for existence A failed race, to emigrate to other areas for
survival It is obvious that will have to. Environmental event [74].As mentioned earlier, Basic PSOs find global confidence
Have powerful potential. However, the original PSO Multiple Optima is very difficult to detect using Because PSO has an
inherent limitation particle can eventually merge into a single point. this limitation overcome MGPSO a new concept called
proposed in the first stage of MGPSO, one has to determine the parameters that should be optimal and set minimum and
maximum limits[75]. The number of groups (the number of solutions we want to find), the population of each group Size and
the best starting radius of each Are considered in this step. To verify the performance of MGPSO It was created with values
of 200 Used for different test operations. In simulations, basic conditions and beginners Population set fixed. Each The
simulation also consisted of 100 repetitions and six key for each simulation The probability of detecting peaks was estimated.
As a result, the probability is 0.98, which is MGPSO Adequate support for performance. Of the best part to observe the
effect, we used MGPSO [76].
9. High exploration particle swarm optimization
It is now possible for PSO (HEPSO) to offer a novel hybrid of PSO and proposed operators, enhanced by the use of proposed
operators Initially, population make up the are particles approximately formed. In each iteration Depression weight (w) and
learning factors (C1 and C2) are calculatedin this section, hepso for spear function Found in six stages of the process We
compare the particle size the four modes (original PSO, Multi-crossover PSO, PSO and HPSO with Bee Colony) Individuals
and integrated effects to explain[77]. Proposed Operators. Population size, maximum reproduction and dimension 20, 5500
and 30 respectively. In PSO with multi-crossover, bee colony operator Is ignored and the multi-crossover probability is set at
PC = 0.95. Similarly, in PSO with bee colony, multi-crossover operator is ignored. At HEPSO, the first operator, inspired by
the GA algorithm, uses the global best position (x gbesti) as the primary parent and the individual best position (x pbesti) as
the second parent[78]. This will roughly generate new momentum for a less crowded solution of choice. Finally, selecting
the individual optimal position of the third particle. The Sigma method is used to solve this problem in MOHEPSO. Among
the newly developed PSO algorithms, HEPSO is a modified PSO algorithm using multi-crossover genetic algorithm and new
extra level and velocity vectors inspired by the artificial bee colony[79]. Used for optimization of HEPSO [44].This research
study is nonlinear to the control theory Makes a significant contribution with the introduction of the position-Minimum
squares moving to Lawrence chaotic problem and particle mass optimization for advanced studies Basically varying optimal
disconnected sliding mode Controller[80]. First, high probability particle mass optimization (HEPSO), therefore, proposed
the MLS method to perform level-varying nonlinear mapping between the control parameters, which are considered as input
data and the Output data. In fact, worth any distraction to approximate the appropriate DSMC parameters MLS approach
implemented. MLS approximate nodal data Similarly, in PSO with bee colony, multi-crossover operator is ignored were
generated offline using the HEPSO algorithm [81]. The Network connection and coverage holes Node redistribution for
facing initial deployment Proposed for process HEPSO algorithm Further to restore the underwater coverage area and to
locate the optimal location of each sensor, the redistribution process must develop the benefits of sensor operation, the
Proposed HEPSO Algorithm Monitoring External monitoring area within the area Repeat the sensor nodes Used to use[82].
The proposed HEPSO algorithm does not increase much, and the HEPSO algorithm uses a smaller moving distance than the
existing NRBSCT and MRNR when comparing all sensitive nodes. Because the D2 network has a The smaller the moving
distance, the higher the coverage rates for multiple nodes Save energy to achieve. For D2, the lifespan of the network is from
270 to 350 circuits Can be extended. Proposed HEPSO algorithm [83].
Copyright@ REST Publisher
21
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
10. Conclusion
Optimization algorithms in general because its convergence, effectiveness, robustness, and simplicity of implementation.
These features of the algorithm have attracted its attention tosolve nonlinear, non-differentiable, multimodal optimization
problems. However, some parameters of PSO need to be specified by the user before using the algorithm. Particle mass
optimization (PSO) is a standard optimization approach, It maintains the mass of candidate solutions, "Flying" through highdimensional search space Particles, each particle is attracted to the nearest optimal solution. And the best solution found by
the particle. The position of the particle containing the particle, xi, is adjusted by a random velocity vi, It depends on the
particle's best solution and the distance from its surroundings. The unique PSO algorithm and problem particle system, the
particle optimization algorithm designed to improve complex In terms of the metaphor of numerical functions and human
social interactions, in two main components Has the potential to reflect the ability of human societies to process rooted
knowledge. Methods Theoretically analyzing the PSO algorithm and its work Try to understand the mechanism. Better to
change its structure Try to get performance. In the PSO algorithm Read the influence of various parameters configuration.
Read the various influences topographic structures on the PSO algorithm. Read the parallel PSO algorithm. In orthogonal
learning particle optimization (OLPSO), the OL method combines the information of Pi and Pn to shape a dependable
guiding vector Po and, however, adjusts the flight in order that the facts coming from Pi or Pn may be used immediately,
Vector Po most effective shops the code of Pi and Pn, but now not the actual values. Binary Particle Mass Optimization
proposed a unique binary version of PSO for binary problems in their model, a particle saying "yes" or "no", "true" or
"false", "not adding" or "not adding" these binary values are real in the binary search space May be a representation of value.
In binary PSO, the individual particles are updated as well as the best continuous sequence worldwide.Multi-group Mutant
particle optimization, is the same as the original PSO Much like detecting multiple optics using Makes it difficult because
PSO has an intrinsic limit Contains, it integrates all particles into a single point in the final stage. It is now possible for PSO
(HEPSO) to offer a novel hybrid of PSO and proposed operators, enhanced by the use of proposed operators Initially,
population make up the are particles approximately formed. In each iteration Depression weight (w) and learning factors (C1
and C2) are calculatedin this section, hepso for spear function Found in six stages of the process We compare the particle
size the four modes (original PSO, Multi-crossover PSO, PSO and HPSO with Bee Colony) Individuals and integrated
effects to explain. Proposed Operators. Population size, maximum reproduction and dimension 20, 5500 and 30
respectively.
References
1.
Krohling, Renato A. "Gaussian swarm: a novel particle swarm optimization algorithm." In IEEE Conference on
Cybernetics and Intelligent Systems, 2004., vol. 1, pp. 372-376. IEEE, 2004.
2. Marini, Federico, and BeataWalczak. "Particle swarm optimization (PSO). A tutorial." Chemometrics and Intelligent
Laboratory Systems 149 (2015): 153-165.
3. Liu, Yu, Zheng Qin, Zhewen Shi, and Jiang Lu. "Center particle swarm optimization." Neurocomputing 70, no. 4-6
(2007): 672-679.
4. Pedersen, Magnus Erik Hvass, and Andrew J. Chipperfield. "Simplifying particle swarm optimization." Applied
Soft Computing 10, no. 2 (2010): 618-628.
5. Song, Mei-Ping, and Guo-Chang Gu. "Research on particle swarm optimization: a review." In Proceedings of 2004
International Conference on Machine Learning and Cybernetics (IEEE Cat. No. 04EX826), vol. 4, pp. 2236-2241.
IEEE, 2004.
6. Selvi, V., and R. Umarani. "Comparative analysis of ant colony and particle swarm optimization
techniques." International Journal of Computer Applications 5, no. 4 (2010): 1-6.
7. Van den Bergh, Frans, and Andries Petrus Engelbrecht. "A study of particle swarm optimization particle
trajectories." Information sciences 176, no. 8 (2006): 937-971.
8. Del Valle, Yamille, Ganesh Kumar Venayagamoorthy, Salman Mohagheghi, Jean-Carlos Hernandez, and Ronald G.
Harley. "Particle swarm optimization: basic concepts, variants and applications in power systems." IEEE
Transactions on evolutionary computation 12, no. 2 (2008): 171-195.
9. Baskar, S., and PonnuthuraiNagaratnamSuganthan. "A novel concurrent particle swarm optimization."
In Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No. 04TH8753), vol. 1, pp. 792-796.
IEEE, 2004.
10. Bansal, Jagdish Chand, P. K. Singh, MukeshSaraswat, Abhishek Verma, Shimpi Singh Jadon, and Ajith Abraham.
"Inertia weight strategies in particle swarm optimization." In 2011 Third world congress on nature and biologically
inspired computing, pp. 633-640. IEEE, 2011.
11. Shayeghi, H., M. Mahdavi, and A. Bagheri. "Discrete PSO algorithm based optimization of transmission lines
loading in TNEP problem." Energy Conversion and management 51, no. 1 (2010): 112-121.
Copyright@ REST Publisher
22
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
12. Ali, Abdelkamel Ben, Gabriel Luque, and Enrique Alba. "An efficient discrete PSO coupled with a fast local search
heuristic for the DNA fragment assembly problem." Information Sciences 512 (2020): 880-908.
13. Rameshkumar, K., and C. Rajendran. "A novel discrete PSO algorithm for solving job shop scheduling problem to
minimize makespan." In IOP Conference Series: Materials Science and Engineering, vol. 310, no. 1, p. 012143. IOP
Publishing, 2018.
14. Yan, Jianen, Hongli Zhang, Haiyan Xu, and Zhaoxin Zhang. "Discrete PSO-based workload optimization in virtual
machine placement." Personal and Ubiquitous Computing 22, no. 3 (2018): 589-596.
15. Zhi, Xiao-Hu, X. L. Xing, Q. X. Wang, L. H. Zhang, X. W. Yang, C. G. Zhou, and Y. C. Liang. "A discrete PSO
method for generalized TSP problem." In Proceedings of 2004 International Conference on Machine Learning and
Cybernetics (IEEE Cat. No. 04EX826), vol. 4, pp. 2378-2383. IEEE, 2004.
16. Strasser, Shane, Rollie Goodman, John Sheppard, and Stephyn Butcher. "A new discrete particle swarm
optimization algorithm." In Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 53-60.
2016.
17. Schutte, Jaco F., Jeffrey A. Reinbolt, Benjamin J. Fregly, Raphael T. Haftka, and Alan D. George. "Parallel global
optimization with the particle swarm algorithm." International journal for numerical methods in engineering 61, no.
13 (2004): 2296-2315.
18. Tewolde, Girma S., Darrin M. Hanna, and Richard E. Haskell. "Multi-swarm parallel PSO: Hardware
implementation." In 2009 IEEE Swarm Intelligence Symposium, pp. 60-66. IEEE, 2009.
19. Venter, Gerhard, and JaroslawSobieszczanski-Sobieski. "Parallel particle swarm optimization algorithm accelerated
by asynchronous evaluations." Journal of Aerospace Computing, Information, and Communication 3, no. 3 (2006):
123-137.
20. Grisales-Noreña, Luis F., Oscar Danilo Montoya, and Carlos Andrés Ramos-Paja. "An energy management system
for optimal operation of BSS in DC distributed generation environments based on a parallel PSO algorithm." Journal
of Energy Storage 29 (2020): 101488.
21. Matos, Joana, Rui PV Faria, Idelfonso BR Nogueira, José M. Loureiro, and Ana M. Ribeiro. "Optimization
strategies for chiral separation by true moving bed chromatography using Particles Swarm Optimization (PSO) and
new Parallel PSO variant." Computers & Chemical Engineering 123 (2019): 344-356.
22. Jin, Nanbo, and YahyaRahmat-Samii. "Parallel particle swarm optimization and finite-difference time-domain
(PSO/FDTD) algorithm for multiband and wide-band patch antenna designs." IEEE Transactions on Antennas and
Propagation 53, no. 11 (2005): 3459-3468.
23. Ding, Shifei, Wei Du, Xingyu Zhao, Lijuan Wang, and WeikuanJia. "A new asynchronous reinforcement learning
algorithm based on improved parallel PSO." Applied Intelligence 49, no. 12 (2019): 4211-4222.
24. Zhan, Zhi-Hui, Jun Zhang, Yun Li, and Yu-Hui Shi. "Orthogonal learning particle swarm optimization." IEEE
transactions on evolutionary computation 15, no. 6 (2010): 832-847.
25. Khanesar, MojtabaAhmadieh, Mohammad Teshnehlab, and Mahdi AliyariShoorehdeli. "A novel binary particle
swarm optimization." In 2007 Mediterranean conference on control & automation, pp. 1-6. IEEE, 2007.
26. Zhan, Zhi-Hui, Jun Zhang, Yun Li, and Yu-Hui Shi. "Orthogonal learning particle swarm optimization." IEEE
transactions on evolutionary computation 15, no. 6 (2010): 832-847.
27. Li, Yan-Fei, Zhi-Hui Zhan, Ying Lin, and Jun Zhang. "Comparisons study of APSO OLPSO and CLPSO on
CEC2005 and CEC2014 test suits." In 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 3179-3185.
IEEE, 2015.
28. Zhan, Zhi-hui, and Jun Zhang. "Orthogonal learning particle swarm optimization for power electronic circuit
optimization with free search range." In 2011 IEEE Congress of Evolutionary Computation (CEC), pp. 2563-2570.
IEEE, 2011.
29. Hu, Yifan, Yongsheng Ding, KuangrongHao, Lihong Ren, and Hua Han. "An immune orthogonal learning particle
swarm optimisation algorithm for routing recovery of wireless sensor networks with mobile sink." International
Journal of Systems Science 45, no. 3 (2014): 337-350.
30. Lee, Sangwook, Sangmoon Soak, Sanghoun Oh, WitoldPedrycz, and Moongu Jeon. "Modified binary particle
swarm optimization." Progress in Natural Science 18, no. 9 (2008): 1161-1166.
31. Bansal, Jagdish Chand, and Kusum Deep. "A modified binary particle swarm optimization for knapsack
problems." Applied Mathematics and Computation 218, no. 22 (2012): 11042-11061.
32. Pedrasa, Michael Angelo A., Ted D. Spooner, and Iain F. MacGill. "Scheduling of demand side resources using
binary particle swarm optimization." IEEE Transactions on Power Systems 24, no. 3 (2009): 1173-1181.
33. Seo, Jang-Ho, Chang-Hwan Im, Chang-GeunHeo, Jae-Kwang Kim, Hyun-Kyo Jung, and Cheol-Gyun Lee.
"Multimodal function optimization based on particle swarm optimization." IEEE Transactions on Magnetics 42, no.
4 (2006): 1095-1098.
Copyright@ REST Publisher
23
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
34. Suryanto, Naufal, Chihiro Ikuta, and DadetPramadihanto. "Multi-group particle swarm optimization with random
redistribution." In 2017 International Electronics Symposium on Knowledge Creation and Intelligent Computing
(IES-KCIC), pp. 1-5. IEEE, 2017.
35. Hou, Zhixiang, Yucai Zhou, and Heqing Li. "Multimodal function optimization based on multigrouped mutation
particle swarm optimization." In Third International Conference on Natural Computation (ICNC 2007), vol. 4, pp.
554-557. IEEE, 2007.
36. Mahmoodabadi, Mohammad Javad. "State-varying optimal decoupled sliding mode control for the Lorenz chaotic
nonlinear problem based on HEPSO and MLS." International Journal of Modelling and Simulation (2020): 1-10.
37. Gupta, Bhumika, Kamal Kumar Gola, and Manish Dhingra. "HEPSO: an efficient sensor node redeployment
strategy based on hybrid optimization algorithm in UWASN." Wireless Networks 27, no. 4 (2021): 2365-2381.
38. Lee, S. Y., S. Y. Kwak, J. H. Seo, S. H. Park, W. S. Kim, J. K. Lee, J. H. Bae et al. "Optimal design of HTS magnets
for a modular toroid-type 2.5 MJ SMES using multi-grouped particle swarm optimization." Physica C:
Superconductivity 469, no. 15-20 (2009): 1789-1793.
39. Krishnan, G. Sai, G. Shanmugasundar, M. Vanitha, and N. Sivashanmugam. "Mechanical properties of chemically
treated Banana and ramie fibre reinforced polypropylene composites." In IOP Conference Series: Materials Science
and Engineering, vol. 961, no. 1, p. 012013. IOP Publishing, 2020.
40. Palanikumar, K., G. Shanmugasundar, and B. Latha. "Role of Industry in Entrepreneurship Education:
Implementation and Success Factors." (2019).
41. Shanmugasundar, G., P. Jagadeeshwar, S. Adithya, V. Nagappan, and M. Bhaskar. "Design, fabrication and analysis
of personal vacuum assisted climber." In Journal of Physics: Conference Series, vol. 1362, no. 1, p. 012057. IOP
Publishing, 2019.
42. Shanmugasundar, G., R. Sivaramakrishnan, R. Sridhar, and M. Rajmohan. "Computer aided modelling and static
analysis of an inspection robot." In Applied Mechanics and Materials, vol. 766, pp. 1055-1060. Trans Tech
Publications Ltd, 2015.
43. Shanmugasundar, G., R. Sivaramakrishnan, and M. Rajmohan. "Computer aided simulation for workspace plot of a
newly designed inspection robot." In 2014 IEEE International Conference on Computational Intelligence and
Computing Research, pp. 1-6. IEEE, 2014.
44. Shanmugasundar, G., M. Vanitha, Robert Čep, Vikas Kumar, Kanak Kalita, and M. Ramachandran. "A Comparative
Study of Linear, Random Forest and AdaBoost Regressions for Modeling Non-Traditional Machining." Processes 9,
no. 11 (2021): 2015.
45. Lokhande, Dr Amol, Dr C. Venkateswaran, Dr M. Ramachandran, C. Vidhya, and R. Kurinjimalar. "A Study on
Various Implications on Reusing in Manufacturing." REST Journal on Emerging trends in Modelling and
Manufacturing 7, no. 2 (2021).
46. Pradhan, Raghuram, G. Shanmugasundar, M. Vanitha, G. Sai Krishnan, and SP Sundar Singh Sivam. "A critical
investigation on the performance of bael biodiesel in CI engine." In AIP Conference Proceedings, vol. 2417, no. 1,
p. 060001. AIP Publishing LLC, 2021.
47. Krishnan, G. Sai, G. Shanmugasundar, M. Vanitha, Raghuram Pradhan, and SP Sundar Singh Sivam. "Performance
analysis on mechanical/morphological properties of ramie-kenaf hybrid polymer composites." In AIP Conference
Proceedings, vol. 2417, no. 1, p. 020024. AIP Publishing LLC, 2021.
48. Dr. Amol Lokhande, Dr. C. Venkateswaran, Dr. M. Ramachandran, C. Sathiyaraj, K. Nathiya. “Recycling Process
Impact in Current Scenario Manufacturing A Study” Recent trends in Management and Commerce, 2(1), (2021):
20-25
49. Shanmugasundar, G., M. Vanitha, G. Sai Krishnan, and S. Srinivasan. "Investigation on the mechanical properties of
newly modified polymeric fiber for structural applications." Materials Today: Proceedings 46 (2021): 3439-3443.
50. Shanmugasundar, G., M. Vanitha, L. Ganesh Babu, P. Suresh, P. Mathiyalagan, G. Sai Krishnan, and
MebratuMakos. "Fabrication and analysis of mechanical properties of PVC/Glass fiber/graphene nano composite
pipes." Materials Research Express 7, no. 11 (2020): 115303.
51. Lokhande, Dr Amol, Dr C. Venkateswaran, Dr M. Ramachandran, S. Chinnasami, and T. Vennila. "A Review on
Various Implications on Re engineering in Manufacturing." REST Journal on Emerging trends in Modelling and
Manufacturing 7, no. 3 (2021): 70-75.
52. Sai Krishnan, G., Raghuram Pradhan, and Ganesh BabuLoganathan. "Investigation on Mechanical Properties of
Chemically Treated Banana and Areca Fiber Reinforced Polypropylene Composites." In Advances in Lightweight
Materials and Structures, pp. 273-280. Springer, Singapore, 2020.
53. Shanmugasundar, G., and S. Gowri. "Modeling and Prediction of Surface Roughness in Micro Turning of
Aluminium Using Regression." Manufacturing Technology Today 7, no. 11 (2008): 7-11.
54. Bharathi, A. Pon, Dr P. Kannan, S. Maheswari, and Dr S. Veluchamy. "A Compact Microstrip Patch Antenna using
DGS for 5G Applications." International Journal of Emerging Trends in Engineering Research 9, no. 4 (2021).
Copyright@ REST Publisher
24
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
55. Sundar, G. Shanmuga, and R. Sivaramakrishnan. "A Survey on Development of Inspection Robots: Kinematic
Analysis, Workspace Simulation and Software Development." Corrosion Detection in „T‟Bend Oil Pipelines Based
on Fuzzy Implementation (2012): 1493.
56. Fegade, Vishal, R. L. Shrivatsava, and A. V. Kale. "Design for remanufacturing: methods and their
approaches." Materials Today: Proceedings 2, no. 4-5 (2015): 1849-1858.
57. Ramachandran, M., Vishal Fegade, and P. P. Raichurkar. "Strategy Performance Evaluation of a Port Organisation
based on Multi-Criteria Decision Making using Fuzzy Logic Method." NMIMS Management Review 33 (2017): 2734.
58. Ragavendran, U., Viral Mehta, Vishal Fegade, and M. Ramachandran. "Dynamic Analysis of Single Fold
Symmetric Composite Laminates." international Journal of civil Engineering and Technology 8, no. 11 (2017): 536545.
59. Kaur, Mandeep, and Dr C. Venkateswaran. "To study the work life balance among working women, post maternity
in banking sector." International Journal of Management (IJM) 11, no. 2 (2020).
60. Simon, Michael J., and Mark A. Aitken. "Next generation terrestrial broadcasting platform aligned internet and
towards emerging 5G network architectures." U.S. Patent 10,652,624, issued May 12, 2020.
61. Fegade, V. T., and Kiran S. Bhole. "Finite Element Analysis and Material Optimization for Equivalent Strength of
Composite Connecting Rod." SSRG International Journal of Mechanical Engineering (SSRG-IJME) 2, no. 2 (2015).
62. Fegade, Vishal, Kshitij Srivastava, A. V. Kale, and Rajiv K. Srivastava. "Feasibility analysis of design for
remanufacturing in bearing using hybrid fuzzy-topsis and taguchi optimization." Independent Journal of
Management & Production 11, no. 1 (2020): 81-95.
63. Pon Bharathi, A., Allan J. Wilson, S. Arun, and V. Ramanathan. "A Compact Disc Shaped Microstrip Patch
Antenna Using Inset Fed at 5GHz for Satellite Communications." In Recent Trends in Intensive Computing, pp. 7479. IOS Press, 2021.
64. Ramachandran, M., Vishal Fegade, and U. Ragavendran. "Parameters OptimisationFor Drilling Of Austenitic
Stainless Steel By Taguchi Method Using Desirability Function Analysis." Technology 8, no. 11 (2017): 229-237.
65. Fulari, Harshal, Vishal Fegade, and Praveen Kumar Loharkar. "The fuzzy cost benefit analysis of design for product
development process with perspective of remanufacturing." International Journal of Applied Engineering
Research 10, no. 11 (2015): 2015.
66. Vimalarani, C. I., and M. Senthilkumar. "Energy Efficient PCP protocol for k-coverage in Sensor networks." Proc
IEEE (2010).
67. Fegade, Vishal, ShannayRawal, and M. Ramachandran. "Metamodel-based parametric study of composite
laminates." In IOP Conference Series: Materials Science and Engineering, vol. 810, no. 1, p. 012051. IOP
Publishing, 2020.
68. Bharathi, A. Pon, Allan J. Wilson, S. Arun, and M. Kannan. "Investigations Of Microstrip Patch Antenna Using
Different Shapes And Inset Feed At 2.45 Gigahertz For Wireless Communications." Design Engineering (2021):
7311-7322.
69. Kumar, R. Dinesh, C. Sridhathan, and M. Senthil Kumar. "Performance Evaluation of Different Neural Network
Classifiers for Sanskrit Character Recognition." In Business Intelligence for Enterprise Internet of Things, pp. 185194. Springer, Cham, 2020.
70. Sharma, Deepa, and DRC VENKATESWARAN. "Discrimination Face Female Faculty During the Recruitment &
Selection and Training Time in The Academic Sector." Journal of Contemporary Issues in Business and
Government| Vol 27, no. 3 (2021): 1105.
71. Ramachandran, M., U. Ragavendran, and Vishal Fegade. "Selection of Used Piston for Remanufacturing Using
Fuzzy TOPSIS Optimization." In Fuzzy Systems and Data Mining IV, pp. 61-67. IOS Press, 2018.
72. Pon Bharathi, A., Allan J. Wilson, S. Arun, and V. Ramanathan. "A Compact Disc Shaped Microstrip Patch
Antenna Using Inset Fed at 5GHz for Satellite Communications." In Recent Trends in Intensive Computing, pp. 7479. IOS Press, 2021.
73. Sridhathan, Senthilkumar, and M. Senthil Kumar. "Plant Infection Detection Using Image Processing." International
Journal of Modern Engineering Research (IJMER) 8 (2018).
74. Saraswat, Achintya, ChitraOjha, Vishal Fegade, and Praveen Kumar Loharkar. "Analysis Of Hollow Helical Spring
Under Compression." International Journal of Applied Engineering Research 10, no. 11 (2015): 10516-10521.
75. Kittur, Jeevan, M. RAMACHANDRAN, Vishal Fegade, and U. Ragavendran. "Numerical Investigation of Total
Deformation Inroller Bearing using Ansys Analysis." International Journal of Mechanical and Production
Engineering Research and Development (IJMPERD): 51-58.
76. Fegade, Vishal, KshitijShrivastava, A. V. Kale, and R. L. Shrivastava. "Remanufacturing Feasibility of Bike
Suspension by Hybrid TOPSIS-Taguchi Optimization." Journal of Advanced Research in Fluid Mechanics and
Thermal Sciences 71, no. 1 (2020): 125-133.
Copyright@ REST Publisher
25
Sathiyaraj.et.al / Design, Modelling and Fabrication of Advanced Robots 1(1) 2022, 15-26
77. LR, Karlmarx. "Development of High Recognition Rate FKP System using Fractional Cuckoo Search Optimization
Method." (2019).
78. Kumar, M. Senthil, and P. Sivakumar. "NEED FOR CURRICULUM REFORMS IN TECHNICAL EDUCATION
TO ACHIEVE OUTCOME BASED EDUCATION."
79. Venkateswaran, Dr C. "Family Responsibilities Make a Barrier in the Career of Female Faculty." Mrs. Deepa
Sharma, Dr. C. Venkateswaran." Family Responsibilities Make a Barrier in the Career of Female Faculty".
International Journal of Computer Engineering In Research Trends (IJCERT), ISSN (2020): 2349-7084.
80. Parekh, Tanay, Divyam Joshi, NiketVasavada, and Vishal Fegade. "Techno Economic Analysis Of
Remanufacturing For Low Ceiling Cabin Fan."
81. Fulari, Harshal, and Vishal Fegade. "Modeling and Analysis of Product Design and Development Process with
Perspective of Remanufacturing: A Review." International Journal of Applied Engineering Research 10, no. 11:
2015.
82. ARUN, V. "A Compact Frequency Tunable Microstrip Patch Antenna using Switching Mechanism for Wireless
Applications." International Journal of Applied Engineering Research 10, no. 19 (2015): 2015.
83. Fegade, Vishal, KshitijShrivastava, A. V. Kale, and R. L. Shrivastava. "Remanufacturing Feasibility of Bike
Suspension by Hybrid TOPSIS-Taguchi Optimization." Journal of Advanced Research in Fluid Mechanics and
Thermal Sciences 71, no. 1 (2020): 125-133.
Copyright@ REST Publisher
View publication stats
26