The task of VLSI physical design is to produce the layout of an integrated circuit. New performance requirements are becoming increasingly dominant in today's sub-micron regimes requiring new physical design algorithms. Genetic algorithms have been increasingly successful when applied in VLSI physical design in the last 10 years. Genetic algorithms for VLSI physical design are reviewed in gener...

there are some machineries and equipments as well as relatively fix amount of human resources involved in any production process. in many cases, by observing operational method of a process, one may see that some of these machineries are not working, but on the other hand, other equipments are continuously working, and many parts are set in front of them, waiting to be set up over machines to c...

Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Algorithms and Scatter Search coupled with a decomposition-into-petals procedure for solving a class of Vehicle Routing and Scheduling Problems. The parallel genetic algorithm presented is based on the island model and was run on...

GPGPU has proved effective in speeding up many applications, notably those that exhibit “embarrassing” parallelism (vector and matrix arithmetic, graphics, image processing, etc.). Other applications have proved more challenging. In particular, little research has been published on GPGPU parallelization of genetic algorithms. Genetic algorithms are inherently sequential in nature, but there is ...

One problem of propagating the globally fittest individual via neighbourhood evolving in both island model and cellular model of existing parallel genetic algorithms (PGA) is that the migration of globally best individual is delayed to non-adjacent processors. That may cause inferior search in those sub-populations. The propagation delay of the globally best individual is proportional to the ne...

Membrane computing is a branch of natural computing. Several studies have recently attempted to utilize the structure of membrane computing to improve intelligent algorithms. These studies have applied communication rules in membrane models to facilitate information exchange between membranes, thereby improving the performance of those algorithms. However, parallel membrane computing has not ye...

The problem of parallel and distributed function optimization is considered. Two coevolutionary algorithms with different degrees of parallelism and different levels of a global coordination are used for this purpose and compared with sequential genetic algorithm (GA). The first coevolutionary algorithm called a loosely coupled genetic algorithm (LCGA) represents a competitive coevolutionary ap...

This paper describes the development of an object-oriented parallel programming environment for genetic algorithms. This work, carried out as part of the ESPRIT III initiative PAPAGENA, intends to promote, develop and demonstrate the effectiveness of genetic algorithm (GA) and parallel genetic algorithm (PGA) techniques in a variety of real-world application domains. Central to this task is the...

Multiple sequence alignment is one of the most recurrent assignments in Bioinformatics. This method allows organizing a set of molecular sequences in order to expose their similarities and their differences. Although exact methods exist for solving this problem, their use is limited by the computing demands which are necessary for exploring such a large and complex search space. Genetic Algorit...