Web service location allocation problem is an important problem in the modern IT industry. In this paper, the two major objectives, i.e. deployment cost and network latency, are considered simultaneously. In order to solve this new multi-objective problem effectively, we adopted the framework of binary Particle Swarm Optimization (PSO) due to its efficacy that has been demonstrated in many opti...

Multi-objective clustering has received widespread attention recently, as it can obtain more accurate and reasonable solution. In this paper, an improved multi-objective clustering framework using particle swarm optimization (IMCPSO) is proposed. Firstly, a novel particle representation for clustering problem is designed to help PSO search clustering solutions in continuous space. Secondly, the...

crack identification is a very important issue in mechanical systems, because it is a damage that if develops may cause catastrophic failure. in the first part of this research, modal analysis of a multi-cracked variable cross-section beam is done using finite element method. then, the obtained results are validated usingthe results of experimental modal analysis tests. in the next part, a nove...

To solve the multi-objective problems, a novel hybrid particle swarm optimization algorithm is proposed(called HPSODE). The new algorithm includes three major improvement: (I)Population initialization is constructed by statistical method Uniform Design, (II)Regeneration method has two phases: the first phase is particles updated by adaptive PSO model with constriction factor χ, the second phase...

Multi Objective Optimization (MOO) problem involves simultaneous minimization or maximization of many objective functions. Various MOO algorithms have been introduced to solve the MOO problem. Traditional gradient-based techniques are one of the methods used to solve MOO problems. However, in the traditional gradient-based technique only one solution is generated. Thus, an alternative approach ...

The objective of this thesis is to investigate how to improve Particle Swarm Optimization by hybridization of stochastic search heuristics and by a Self-Organized Criticality extension. The thesis will describe two hybrid models extending Particle Swarm Optimization with two aspects from Evolutionary Algorithms, recombination via breeding and gene flow restriction via subpopulations. A further ...

This paper deals with multi-objective optimization in gait planning of a 7-dof biped robot ascending and descending some staircases. Both its power consumption as well as dynamic balance margin depends on a few common design parameters. The biped robot should have a maximum dynamic balance margin but at the expense of minimum power. Thus, a conflicting relationship exists between these two obje...

The genetic algorithm (GA) is an evolutionary optimization algorithm operating based upon reproduction, crossover and mutation. On the other hand, particle swarm optimization (PSO) is a swarm intelligence algorithm functioning by means of inertia weight, learning factors and the mutation probability based upon fuzzy rules. In this paper, particle swarm optimization in association with genetic a...

in this paper an approach based on evolutionary algorithms to find pareto optimal pair of state and control for multi-objective optimal control problems (moocp)'s is introduced‎. ‎in this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

The genetic algorithm (GA) is an evolutionary optimization algorithm operating based upon reproduction, crossover and mutation. On the other hand, particle swarm optimization (PSO) is a swarm intelligence algorithm functioning by means of inertia weight, learning factors and the mutation probability based upon fuzzy rules. In this paper, particle swarm optimization in association with genetic a...