In this paper we introduce an efficient implementation of asynchronously parallel genetic algorithm with adaptive genetic operators. The classic genetic algorithm paradigm is exte...
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
Through analysis of present pseudo-parallel genetic algorithm, propose a new dynamic sub-population pseudo-parallel genetic algorithm. It changes the condition that the magnitude o...
We are trying to piece together the knowledge of evolution with the help of biology, informatics and physics to create complex evolutionary algorithms with parallel and hierarchic...