This paper presents a novel metaheuristic optimization algorithm inspired by the geometrical features of circles, called circle search (CSA). The is most well-known geometric object, with various including diameter, center, perimeter, and tangent lines. ratio between radius line segment orthogonal function angle opposite to radius. plays an important role in exploration exploitation behavior CS...

an elliptical tank cross-section is formulated to explore and optimization method, based on a real-coded genetic algorithm to enhance the roll stability limit of a tank vehicle. a shape genetic algorithm optimization problem is applied to minimize the overturning moment imposed on the vehicle due to c.g. height of the liquid load, and lateral acceleration and cargo load shift . the minimization...

in this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses ferguson splines and pso (particle swarm optimization). the objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. ferguson splines create preliminary paths using random generated para...

this paper presents a strategy for using harmony search algorithm in facility layout optimization problems. in this paper an adapted harmony search algorithm is developed for solving facility layout optimization problems. this method finds an optimal facility arrangement in an existing layout. two real-world case studies are employed to demonstrate the efficiency of this model. a comparison is ...

in this paper, a new algorithm for studying elastic wave propagation in the phononic crystals is presented. at first, the displacement-based forms of elastic wave equations are derived and then the forms are discretized using finite difference method. so the new algorithm is called the displacement-based finite difference time domain (dbfdtd). three numerical examples are computed with this met...

identifying clusters or clustering is an important aspect of data analysis. it is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. it is a main task of exploratory data mining, and a common technique for statistical data analysis this paper proposed an improved version of k-means algorithm, namely persistent k...

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

the large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. most of this computational burden is due to calculation of switching points. in this paper a learning algorithm is proposed for finding the switching points. the method, which can be used for both ...