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 ...

In recent years, many partitional clustering algorithms based on genetic algorithms (GA) have been proposed to tackle the problem of finding the optimal partition of a data set. Surprisingly, very few studies considered alternative stochastic search heuristics other than GAs or simulated annealing. Two promising algorithms for numerical optimization, which are hardly known outside the heuristic...

The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...

This paper proposes an algorithm for Public Key Cryptography (PKC) using the hybrid concept of two evolutionary algorithms, Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) respectively. PSO alone are fast and easy to implement, they follow the procedures of common evolutionary algorithm and posses memory feature which is absent in GA making it more valuable. In GA whole population ...

Several biology inspired optimization algorithms such as Genetic Algorithms, Ant Colony Optimization (ACO)and Particle Swarm Optimization (PSO) have previously been proposed by researchers. Recent approaches in numerical optimization have shifted to motivate from complex human social behaviors. In this paper, a new optimization algorithm, namely parliamentary optimization algorithm (POA) is pro...

This paper presents an application of particle swarm optimization (PSO) to the grounding grid planning which compares to the application of genetic algorithm (GA). Firstly, based on IEEE Std.80, the cost function of the grounding grid and the constraints of ground potential rise, step voltage and touch voltage are constructed for formulating the optimization problem of grounding grid planning. ...

Particle Swarm Optimization is a population based optimization technique that based on probability rules. In this technique each particle moves toward their best individual and group experience had occurred. Fundamental problems of a standard PSO algorithm are fall into local optimum trap and the low speed of the convergence. One of the methods to solve these problems is to combine PSO algorith...

Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...

Abstract: Constraint handling is one of the most difficult parts encountered in practical engineering design optimizations. Different kinds of methods were proposed for handling constraints namely, genetic algorithm, self-adaptive penalty approach and other evolutionary algorithms. Particle Swarm Optimization (PSO) efficiently solved most nonlinear optimization problems with inequity constraint...