In this paper, a double orthogonal array based genetic algorithm is proposed to decrease the searching space and increase the feasible quality of primers. The key point of the proposed algorithm is to achieve the elitism goal by applying the orthogonal arrays (OAs) that is used in quality engineering with a small amount of experimental features. The result shows that the proposed algorithm conv...

Engineering of mobile telecommunication networks endures two major problems: the design of the network, and the frequency assignment. We address the first problem in this paper, which has been formulated as a multiobjective constrained combinatorial optimisation problem. We propose a genetic algorithm that aims to approximate the Pareto frontier of the problem. Advanced techniques have been use...

Multimemetic algorithms (MMAs) are memetic algorithms in which memes (interpreted as non-genetic expressions of problemsolving strategies) are explicitly represented and evolved alongside genotypes. This process is commonly approached using the standard genetic procedures of recombination and mutation to manipulate directly information at the memetic level. We consider an alternative approach b...

This study presents an analysis of nuclear power policy in the UK since 2010, associated with Coalition government and successive Conservative policies to address climate change deliver affordable clean energy. From semi-structured interviews elite participants documents, this explores detail 2010. It applies two theories process explore continuity area: multiple-elitism neo-pluralism. In case ...

Distinguished by its difficulty, versatility, subtlety, and even profundity, modern physics stands among humanity’s great technical intellectual achievements. This success has been enabled continuous cultural entrepreneurship, giving rise to methods, mentalities, institutions that have together fostered both astonishing individual accomplishments an expansive powerful cooperative enterprise.Tha...

Evaluating a global optimal point in many global optimization problems in large space is required to more calculations. In this paper, there is presented a new approach for the continuous functions optimization with rotational mutation and crossover operator. This proposed method (RMC) starts from the point which has best fitness value by elitism mechanism and after that rotational mutation and...

In this paper we analyze the application of the Ant Colony Optimization to the Minimum Weight Vertex Covering Problem. We use the software system that we developed and implemented different standard ACO algorithms to this problem: Ant Colony System, the use of Elitism, Rank based approach and the MinMax system. We have made a comparative assessment of the effectiveness of these algorithms to th...