A novel parallel memetic algorithm (MA) architecture for the design of vector quantizers is presented in this paper. The architecture contains a number of modules operating memetic optimization concurrently. Each module uses steady-state genetic algorithm (GA) for global search, and K-means algorithm for local refinement. A shift register based circuit for accelerating mutation and crossover op...

Optimization by probabilistic modeling is a growing research field in evolutionary computation. An example is the compact genetic algorithm (cGA), in which the population of a genetic algorithm (GA) is represented as a probability distribution over the set of solutions. Both cGA algorithm and the order-one behavior of a simple GA with uniform crossover are operationally equivalent. The cGA is m...

The Internet is divided into Autonomous Systems, which control their intra-domain traffic by using interior gateway protocols. The most common protocol used today is Open Shortest Path First (OSPF). OSPF routes traffic on shortest paths defined by integer link weights. The weight setting problem is to find weights that optimize the resulting traffic, for example to minimize network congestion. ...

Memetic algorithms are a class of well-studied metaheuristics which combine evolutionary algorithms and local search techniques. A meme represents contagious piece of information in an adaptive information sharing system. The canonical memetic algorithm uses a fixed meme, denoting a hill climbing operator, to improve each solution in a population during the evolutionary search process. Given gl...

The unconstrained binary quadratic programming (UBQP) problem is a general NP-hard problem with various applications. In this paper, we present a multilevel algorithm designed to approximate large UBQP instances. The proposed multilevel algorithm is composed of a backbone-based coarsening phase, an asymmetric uncoarsening phase and a memetic refinement phase, where the backbone-based procedure ...

Population based metaheuristics, such as hybrid genetic algorithms or memetic algorithms, play an important role in the solution of combinatorial optimization problems. The memetic algorithm presented here for the no-wait flowshop scheduling problem addresses a hierarchically organized complete ternary tree to represent the population that putted together with a recombination plan resembles a p...