showing 4 related works from this author
A Primer on Memetic Algorithms
2012
Memetic Algorithms (MAs) are population-based metaheuristics composed of an evolutionary framework and a set of local search algorithms which are activated within the generation cycle of the external framework, see [376]. The earliest MA implementation has been given in [621] in the context of the Travelling Salesman Problem (TSP) while an early systematic definition has been presented in [615]. The concept of meme is borrowed from philosophy and is intended as the unit of cultural transmission. In other words, complex ideas can be decomposed into memes which propagate andmutate within a population.Culture, in this way, constantly undergoes evolution and tends towards progressive improvemen…
Memetic algorithms and memetic computing optimization: A literature review
2012
Abstract Memetic computing is a subject in computer science which considers complex structures such as the combination of simple agents and memes, whose evolutionary interactions lead to intelligent complexes capable of problem-solving. The founding cornerstone of this subject has been the concept of memetic algorithms, that is a class of optimization algorithms whose structure is characterized by an evolutionary framework and a list of local search components. This article presents a broad literature review on this subject focused on optimization problems. Several classes of optimization problems, such as discrete, continuous, constrained, multi-objective and characterized by uncertainties…
Applications of Evolutionary Computation
2011
EvoCOMPLEX Contributions.- Coevolutionary Dynamics of Interacting Species.- Evolving Individual Behavior in a Multi-agent Traffic Simulator.- On Modeling and Evolutionary Optimization of Nonlinearly Coupled Pedestrian Interactions.- Revising the Trade-off between the Number of Agents and Agent Intelligence.- Sexual Recombination in Self-Organizing Interaction Networks.- Symbiogenesis as a Mechanism for Building Complex Adaptive Systems: A Review.- EvoGAMES Contributions.- Co-evolution of Optimal Agents for the Alternating Offers Bargaining Game.- Fuzzy Nash-Pareto Equilibrium: Concepts and Evolutionary Detection.- An Evolutionary Approach for Solving the Rubik's Cube Incorporating Exact Met…
Memetic Algorithms in Continuous Optimization
2012
Intuitively, a set is considered to be discrete if it is composed of isolated elements, whereas it is considered to be continuous if it is composed of infinite and contiguous elements and does not contain “holes”.