Proximity and priority: Applying a gene expression algorithm to the Traveling Salesperson Problem

Parallel Computing

Volumn 30, Issue 5-6, 2004, Pages 803-816

  Burkowski, Forbes J ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Gene expression genetic algorithm; Traveling Salesperson Problem

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; DNA; GENES; GENETIC ALGORITHMS; RNA; TRAVELING SALESMAN PROBLEM; VECTORS;

CROSSOVER; GENE EXPRESSION GENETIC ALGORITHMS; MUTATIONS; PERMUTATION VECTORS;

PARALLEL PROCESSING SYSTEMS;

EID: 2642524530     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2003.12.017     Document Type: Article

References (15)

1. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., Protasi M. Complexity and Approximation. 1999;Springer-Verlag, Berlin.
2. Delaunay B. Sur la sphere vide, Izvestia Akademia Nauk. SSSr, VII Seria. Otdelenie Matemtischeskii I Estestvennyka Nauk. 6:1934;793-800.
3. Goldberg D. Genetic Algorithms in Search, Optimization, and Machine Learning. 1989;Addison-Wesley Publishing, Reading, MA.
4. B. Julstrom, Coding TSP tours as permutations via an insertion heuristic, in: SAC '99, Proc. 1999 ACM Sym. Appl. Comp., ACM Press, 1999, pp. 297-301.
5. Kargupta H. Gene expression: the missing link in evolutionary computation. Quagliarella D., Periaux J., Poloni C., Winter G. Genetic Algorithms in Engineering and Computer Science. 1997;59-83 John Wiley & Sons Ltd. Chapter 4.
6. Karp R. Probabilistic analysis of partitioning algorithms for the traveling salesman in the plane. Math. Operat. Res. 2:1977;204-209.
7. D. Knuth, The Art of Computer Programming, Sorting and Searching, vol. 3, second ed., Addison-Wesley, Reading, MA, 1998.
8. Lewin B. Genes VI. 1997;Oxford University Press, NY.
9. Michalewicz Z. Genetic Algorithms. + Data Structures=Evolution Programs:1992;Springer-Verlag, Berlin.
10. Mitchell M. An Introduction to Genetic Algorithms. 1996;MIT Press, Cambridge, MA.
11. Y. Nagata, S. Kobayashi, Edge assembly crossover: a high-power genetic algorithm for the traveling salesman problem, in: T. Bäck (Ed.), Proc. Seventh Int. Conf. Genetic Algorithms, 1997, pp. 450-457.
12. Reinelt G. TSPLIB - a Traveling Salesman Problem library. ORSA J. Comput. 3:1991;376-384. See also: http://softlib.rice.edu/softlib/tsplib/.
13. Reinelt G. TSPLIB - a Traveling Salesman Problem library. ORSA J. Comput. 3:1991;376-384. See also: http://softlib.rice.edu/softlib/tsplib/.
14. Reinelt G. The Traveling Salesman. 1994;Springer-Verlag, Berlin.
15. Tao G., Michalewicz Z. Inver-over operator for the TSP. Baeck T., Eiben A., Schoenauer M., Schwefel H. Proc. 5th Parallel Problem Solving from Nature, Lecture Notes in Computer Science. 1998;803-812 Springer-Verlag, Amsterdam.