نتایج جستجو برای: evolutionary optimization algorithms

تعداد نتایج: 698855  

2008
M. - H. Tayarani

This paper proposes a novel optimization algorithm called Cellular Probabilistic Optimization Algorithms (CPOA) based on the probabilistic representation of solutions for real coded problems. In place of binary integers, the basic unit of information here is a probability density function. This probabilistic coding allows superposition of states for a more efficient algorithm. This probabilisti...

Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...

Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier‎. ‎This paper applies an evolutionary optimization scheme‎, ‎inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...

2002
Vladimiro Miranda Nuno Fonseca

This paper presents a new optimization model – EPSO, Evolutionary Particle Swarm Optimization, inspired in both Evolutionary Algorithms and in Particle Swarm Optimization algorithms. The fundamentals of the method are described, and an application to the problem of Loss minimization and Voltage control is presented, with very good results.

2007
Namrata Khemka Christian Jacob

Evolutionary optimization methods~namely, genetic algorithms, genetic programming, and evolution strategies~represent a category of non−traditional optimization algorithms drawing inspirations from the process of natural evolution. Particle swarm optimization represents another set of more recently developed algorithmic optimizers inspired by social behaviours of organisms such as birds [8] and...

2002
Vladimiro Miranda Nuno Fonseca

This paper presents a new optimization model – EPSO, Evolutionary Particle Swarm Optimization, inspired in both Evolutionary Algorithms and in Particle Swarm Optimization algorithms. The fundamentals of the method are described, and an application to the problem of Loss minimization and Voltage control is presented, with very good results.

The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

Journal: :CoRR 2006
Mark Burgin Eugene Eberbach

Evolutionary processes proved very useful for solving optimization problems. In this work, we build a formalization of the notion of cooperation and competition of multiple systems working toward a common optimization goal of the population using evolutionary computation techniques. It is justified that evolutionary algorithms are more expressive than conventional recursive algorithms. Three su...

2007
Leandro dos Santos Coelho Viviana Cocco Mariani Leandro dos Santos

Global optimization based on evolutionary algorithms can be used as the important component for many engineering optimization problems. Evolutionary algorithms have yielded promising results for solving nonlinear, non-differentiable and multi-modal optimization problems in the power systems area. Differential evolution (DE) is a simple and efficient evolutionary algorithm for function optimizat...

2015
Frank Neumann Carsten Witt

Evolutionary algorithms have been frequently used for dynamic optimization problems. With this paper, we contribute to the theoretical understanding of this research area. We present the first computational complexity analysis of evolutionary algorithms for a dynamic variant of a classical combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary w...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید