In this paper we analyze the application of the Ant Colony Optimization to the Minimum Weight Vertex Covering Problem. We use the software system that we developed and implemented different standard ACO algorithms to this problem: Ant Colony System, the use of Elitism, Rank based approach and the MinMax system. We have made a comparative assessment of the effectiveness of these algorithms to th...

This paper presents results from the first known application of the genetic algorithm (GA) technique for optimizing the performance of a laser system (chemical, solid-state, or gaseous). The effects of elitism, single point and uniform crossover, creep mutation, different random number seeds, population size, niching and the number of children per pair of parents on the performance of the GA fo...

We present a real-coded genetic algorithm that efficiently estimates parameters of a formant trajectory model. The genetic algorithm uses roulette-wheel selection and elitism to minimize the root mean square error between the observed formant trajectory and the model trajectory. Parameters, including vowel and consonant target values and coarticulation parameters, are estimated for a corpus of ...

In this paper, a new dynamic self-adaptive multi-objective particle swarm optimization (DSAMOPSO) method is proposed to solve binary-state multi-objective reliability redundancy allocation problems (MORAPs). A combination of penalty function and modification strategies is used to handle the constraints in the MORAPs. A dynamic self-adaptive penalty function strategy is utilized to handle the co...

Assigning virtual network resources to physical network components, called Virtual Network Embedding, is a major challenge in cloud computing platforms. In this paper, we propose a memetic elitist pareto evolutionary algorithm for virtual network embedding problem, which is called MEPE-VNE. MEPE-VNE applies a non-dominated sortingbased multi-objective evolutionary algorithm, called NSGA-II, to ...

Multi-objective evolutionary algorithms (EAs) that use non-dominated sorting and sharing have been criticized. Mainly for their: 1) ( 3 MN O computational complexity (where M is the number of objectives and N is the population size). 2Non-elitism approach; 3-the need for specifying a sharing parameter. In this paper, a method combining the new Ranked based Roulette Wheel selection algorithm wit...

The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...

Corresponding Author: Rabczuk, T./Ilyani Akmar, A.B. Institute of Structural Mechanics, Bauhaus University of Weimar, Marienstrasse 15, 99423 Weimar, Germany Faculty of Civil Engineering, MARA University of Technology, 40450 Shah Alam, Selangor, Malaysia Email: [email protected] Email: [email protected] Abstract: In this study, an application of evolutionary multi-objective o...

The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...