Abstract-This paper studies static and dynamic decentralized versions of the search model known as cellular genetic algorithm (cGA), in which individuals are located in a specific topology and interact only with their neighbors. Making changes in the shape of such topology or in the neighborhood may give birth to a high number of algorithmic variants. We perform these changes in a methodological way by tuning the concept of ratio. Since the relationship (ratio) between the topology and the neighborhood shape defines the search selection pressure, we propose to analyze in depth the influence of this ratio on the exploration/exploitation tradeoff. As we will see, it is difficult to decide which ratio is best suited for a given problem. Therefore, we introduce a preprogrammed change of this ratio during the evolution as a possible additional improvement that removes the need of specifying a single ratio. A later refinement will lead us to the first adaptive dynamic kind of cellular models to our knowledge. We conclude that these dynamic cGAs have the most desirable behavior among all the evaluated ones in terms of efficiency and accuracy; we validate our results on a set of seven different problems of considerable complexity in order to better sustain our conclusions.Index Terms-Cellular genetic algorithm (cGA), evolutionary algorithm (EA), dynamic adaptation, neighborhood-to-population ratio.

Abstract. This paper introduces a new cellular genetic algorithm for solving multiobjective continuous optimization problems. Our approach is characterized by using an external archive to store non-dominated solutions and a feedback mechanism in which solutions from this archive randomly replaces existing individuals in the population after each iteration. The result is a simple and elitist algorithm called MOCell. Our proposal has been evaluated with both constrained and unconstrained problems and compared against NSGA-II and SPEA2, two state-of-theart evolutionary multiobjective optimizers. For the used benchmark, preliminary experiments indicate that MOCell obtains competitive results in terms of convergence, and it clearly outperforms the other two compared algorithms concerning the diversity of solutions along the Pareto front.

In this paper we propose a new algorithm for solving multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single objective optimization to the multiobjective domain. The result is a hybrid metaheuristic algorithm called AbYSS, which follows the scatter search structure but using mutation and crossover operators coming from the field of evolutionary algorithms. AbYSS incorporates typical concepts from the multiobjective field, such as Pareto dominance, density estimation, and an external archive to store the nondominated solutions. We evaluate AbYSS with a standard benchmark including both unconstrained and constrained problems, and it is compared against two state-ofthe-art multiobjective optimizers, NSGA-II and SPEA2. The obtained results indicate that AbYSS produces very competitive Pareto fronts according to the applied convergence metric, and it clearly outperforms the other two algorithms concerning the diversity of the solutions and the hypervolume metric.

No abstract

No abstract

Abstract. Cellular Genetic Algorithms (cGAs) are a subclass of Genetic Algorithms (GAs) in which the population diversity and exploration are enhanced thanks to the existence of small overlapped neighborhoods. Such a kind of structured algorithms is specially well suited for complex problems. In this paper we propose the utilization of some cGAs with and without including local search techniques for solving the vehicle routing problem (VRP). A study on the behavior of these algorithms has been performed in terms of the quality of the solutions found, execution time, and number of function evaluations (effort). We have selected the benchmark of Christofides, Mingozzi and Toth for testing the proposed cGAs, and compare them with some other heuristics in the literature. Our conclusions are that cGAs with an added local search operator are able of always locating the optimum of the problem at low times and reasonable effort for the tested instances.

No abstract

No abstract