Learn More
The traveling salesman problem (TSP) is one of the most widely studied NP-hard combinatorial optimization problems and traditional genetic algorithm trapped into the local minimum easily for solving this problem. Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of behavior laws of bird flocks, fish schools and human(More)
For the evolutionary algorithm, the representation of the electronic circuit has two methods, one kind is code with the electronic circuit solution space, the other is code with the problem space. How one representation quality weighs may think the following questions? The first is the code method should as far as possible complete, it is say for the(More)
Optimization problems arise in many real-world applications. Cultural Algorithms are a class of computational models derived from observing the cultural evolution process in nature, compared with genetic algorithm the cultural algorithms have high convergence speed. Aiming at the disadvantages of basic cultural algorithms like being trapped easily into a(More)
During the space electronic system in carries out the exploratory mission in the deep space, it maybe faced with kinds of violent natural environment, to electric circuit's performance, the volume, the weight and the stability proposed a higher request, the traditional circuit design method already more and more with difficulty satisfied this kind of(More)
Many engineering optimization problems can be state as function optimization with constrained, intelligence optimization algorithm can solve these problems well. Cultural Algorithms are a class of computational models derived from observing the cultural evolution process in nature, cultural algorithms in the optimization of the complex constrained functions(More)