Optimization Of PCB Routing System Based On Immune Algorithm

After a long period of development, PCB routing had experienced the manual routing, automatic routing, and routing of very large scale integrated circuit. At the same time, all kinds of routing algorithms of PCB routing were nurtured. But not a kind of algorithm was universal, they were all based on the problems to be solved, in other words, the emphasis of each algorithm was different.PCB routing of single layer board was a collection of different potential networks, which was a nondirectional connected graph of n potential.So the PCB routing can be simplified as shortest path searching of n potential points.According to the characteristics of the PCB routing, the mathematical model was established as a problem of manhattan distance steiner optimal tree under two-dimensional degree constraint, the exact methods can not solve the problem, because the immune algorithm had some advantages to solve combinatorial optimization, it was introduced to solve PCB routing, antibodies were first crossed and mutated, then immune vaccines were injected to antibodies, at last immune selection was done so that minimum spanning tree was generated, which was similar to the steiner optimal tree, it was we were asking for. In view of the blindness of the convergence of crossover operator, in this paper, the algorithm was further improved.The programming design of this subject and visualization by using VC++software were completed, and the setting of related parameters in the program were optimized, finally the best parameters were found.At the same time, the best parameters of immune program were applied to the larger system and then verified the effectiveness of the program.Then the superiority of the improved immune algorithm was verified, comparing the experimental data with genetic algorithm and immune algorithm before improvement.