Design the Hardware of Genetic Algorithm for TSP and MSA

Traveling Salesman’s Problem (TSP) can be applied to find the near optimal Multiple Sequence Alignments (MSA)[1]. TSP can be further calculated by using genetic algorithms (GA) [2,3]. In this paper, we develop the hardware of GA to improve the speed up of solving TSP and MSA. Software is used to process creating initial population and selecting operation, and hardware is used to process crossover, mutation and fitness operation. Our hardware system is designed and simulated by using VHDL. The speed up of our system is increased to 27 in worst case and 44 in best case.

[1]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[2]  Katsumi Inoue,et al.  A new metric function and harmonic crossover for symmetric and asymmetric traveling salesman problems , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[3]  R. Graham,et al.  The steiner problem in phylogeny is NP-complete , 1982 .

[4]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[5]  Yasuhiro Tsujimura,et al.  Entropy-based genetic algorithm for solving TSP , 1998, 1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111).

[6]  Eugene L. Lawler,et al.  Approximation Algorithms for Multiple Sequence Alignment , 1994, CPM.

[7]  Jian-Hung Chen,et al.  A GA-based systematic reasoning approach for solving traveling salesman problems using an orthogonal array crossover , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[8]  William B. Langdon,et al.  Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! , 1998 .

[9]  Sandeep K. Gupta,et al.  Improving the Practical Space and Time Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment , 1995, J. Comput. Biol..

[10]  Gaston H. Gonnet,et al.  Using traveling salesman problem algorithms for evolutionary tree construction , 2000, Bioinform..

[11]  Hajime Kita,et al.  A genetic solution for the traveling salesman problem by means of a thermodynamical selection rule , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[12]  Tao Jiang,et al.  Approximation algorithms for tree alignment with a given phylogeny , 1996, Algorithmica.

[13]  Brent E. Nelson,et al.  A Hardware Genetic Algorithm for the Travelling Salesman Problem on SPLASH 2 , 1995, FPL.

[14]  Prabhas Chongstitvatana,et al.  A hardware implementation of the Compact Genetic Algorithm , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[15]  Tao Jiang,et al.  On the Complexity of Multiple Sequence Alignment , 1994, J. Comput. Biol..

[16]  Gaston H. Gonnet,et al.  Near optimal multiple sequence alignments using a traveling salesman problem approach , 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).

[17]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[18]  Gaston H. Gonnet,et al.  Evaluation Measures of Multiple Sequence Alignments , 2000, J. Comput. Biol..

[19]  Ashok Samal,et al.  HGA: A Hardware-Based Genetic Algorithm , 1995, Third International ACM Symposium on Field-Programmable Gate Arrays.

[20]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[21]  Lusheng Wang,et al.  Improved Approximation Algorithms for Tree Alignment , 1996, CPM.

[22]  John D. Kececioglu,et al.  The Maximum Weight Trace Problem in Multiple Sequence Alignment , 1993, CPM.