A Novel Genetic Algorithm Based on Gene Therapy Theory

Transactions of the Institute of Measurement & Control

Volumn 28, Issue 3, 2006, Pages 253-262

  Wang, Chao Xue ^a   Cui, du wu ^a   Wan, Ding Sheng ^b   Wang, Lei ^a  

^a XI'AN UNIVERSITY OF TECHNOLOGY   (China)

^b HOHAI UNIVERSITY   (China)

Author keywords

gene pool; gene therapy; genetic algorithm; therapy operator; traveling salesman problem

Indexed keywords

COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; GENES; MATHEMATICAL OPERATORS; TRAVELING SALESMAN PROBLEM;

GENE POOL; GENE THERAPY; THERAPY OPERATOR;

GENETIC ALGORITHMS;

EID: 33845624262     PISSN: 01423312     EISSN: None     Source Type: Journal    
DOI: 10.1191/0142331206tim172oa     Document Type: Article

References (16)

1. Al-Mulhem, H and Al-Maghrabi, T. 1998: Efficient convex-elastic n et algorithm to solve the Euclidean traveling salesman problem. IEEE Transactions on Systems, Man, and Cybernetics, Part B 28, 618-620.
2. Chen, G. L., Wang, X. F., Zhuang, Z. Q. and Wang, D. Sh. 1996: Genetic algorithm and its application. Posts & Telecom Press (in Chinese).
3. Colormi, A., Dorigo, M. and Manieaao, V. 1991: Distributed optimization by ant colonies. Proceedings of the First European Conference On Artificial Life. Paris, December, 134-142.
4. Goldberg, D. E. and Lingle, R. 1985: Alleles, loci and the traveling salesman problem. Proceedings of the International Conference on Genetic Algorithms and their Applications, Pittsburgh, Pennsylvania, July, 154-159.
5. Goldberg, D. E. 1989: Genetic algorithms in search, optimization and machine learning. Addison Wesley Press.
6. Held, M. and Karp, R. M. 1970: The traveling salesman problem and minimum spanning trees. Operations Research 18, 1138-1162.
7. Held, M. and Karp, R. M. 1971: The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming 1, 6-25.
8. Holland, J. H. 1975: Adaptation in nature and artificial systems. The University of Michigan Press.
9. Jiao, L. C. and Wang, L. 2000: A novel genetic algorithm based on immunity. IEEE Transactions on Systems, Man, and Cybernetics, Part A 30, 552-561.
10. Knox, J. 1994: Tabu search performance on the symmetric traveling salesman problem. Computers and Operations Research 21, 867-876.
11. Lo, C. C. and Hus, C. C. 1998: Annealing framework with learning memory. IEEE Transactions on System, Man, Cybernetics, Part A 28, 1-13.
12. Reynolds, R. G. and Sverdlik, W. 1994: Problem solving using cultural algorithms. Proceedings of the First IEEE Conference on Evolutionary Computation. Orlando, Florida, June, 645-650.
13. Rudolph, G. 1994: Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks 5, 96-101.
14. Wolpert, D. H. and Macready, W. G. 1997: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1, 67-82.
15. Yang, H., Kang, L. S. and Chen, Y. P. 2003: A gene-based genetic algorithm for TSP. Chinese Journal of Computers 26, 1753-1758 (in Chinese).
16. Zhang, J. S., Xu, Z. B. and Liang, Y. 1997: Whole annealing genetic algorithm and the sufficient and necessary condition of its convergence. Science in China (Series E) 27, 154-164 (in Chinese).