In recent years, genetic algorithms began to be used in many disciplines such as pattern recognition, robotics, biology, and medicine to name just a few. These optimization algorithms are based on Darwins principle of natural selection which happens to be a slow process and, as a result, these algorithms tend to require a large amount of computation. However, they offer certain advantages as we...

This paper is a survey of the literature on applications of evolutionary algorithms for vehicle routing problems. It reports about genetic algorithms, evolution strategies and particle swarm optimization, when applied to the classical capacitated vehicle routing problem and many of its variants. The performance of evolutionary algorithms is also compared with the best alternative problem-solvin...

Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...

normal 0 false false false en-us x-none fa background:  regarding the importance of right diagnosis in medical applications, various methods have been exploited for processing medical images solar. the method of segmentation is used to analyze anal to miscall structures in medical imaging. objective:  this study describes a new method for brain magnetic resonance image (mri) segmentation via a ...

This paper shows how evolutionary algorithms can be described in a concise, yet comprehensive and accurate way. A classification scheme is introduced and presented in a tabular form called TEA (Table of Evolutionary Algorithms). It distinguishes between different classes of evolutionary algorithms (e.g., genetic algorithms, ant systems) by enumerating the fundamental ingredients of each of thes...

Tournament selection is one of the most popular selection operators in Genetic Algorithms. Recently, its popularity is increasing because this operator is well suited for Parallel Genetic Algorithms applications. In this paper, new selection operator is proposed. The new operator, which should be an improvement of the tournament selection, is named “Fine-grained Tournament Selection” (FGTS). It...

this paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. in this research, cells are defined as a queue system which will be optimized via queuing theory. in this queue system, each machine is assumed as a server and each part as a customer. the grouping of machines and parts...