Advertisement

New Genetic Operators for Solving TSP: Application to Microarray Gene Ordering

  • Shubhra Sankar Ray
  • Sanghamitra Bandyopadhyay
  • Sankar K. Pal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3776)

Abstract

This paper deals with some new operators of genetic algorithms for solving the traveling salesman problem (TSP). These include a new operator called, ”nearest fragment operator” based on the concept of nearest neighbor heuristic, and a modified version of order crossover operator. Superiority of these operators has been established on different benchmark data sets for symmetric TSP. Finally, the application of TSP with these operators to gene ordering from microarray data has been demonstrated.

Keywords

Travel Salesman Problem Travel Salesman Problem Substring Length Order Crossover Neighbor Heuristic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Larranaga, P., Kuijpers, C., Murga, R., Inza, I., Dizdarevic, S.: Genetic algorithms for the traveling salesman problem: A review of representations and operators. Artificial Intell. Rev. 13, 129–170 (1999)CrossRefGoogle Scholar
  2. 2.
    Goldberg, D.E.: Genetic Algorithm in Search, Optimization and Machine Learning. Machine Learning, Addison-Wesley, New York (1989)Google Scholar
  3. 3.
    Ray, S.S., Bandyopadhyay, S., Pal, S.K.: New operators of genetic algorithms for traveling salesman problem, Cambridge, UK, ICPR-04, 497–500, Vol 2 (2004)Google Scholar
  4. 4.
    Spellman, P.T., Sherlock, G., Zhang, M.Q., Iyer, V.R., Anders, K., Eisen, M.B., Brown, P.O., Botstein, D., Futcher, B.: Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisia by microarray hybridization. Molecular Biology Cell 9, 3273–3297 (1998)Google Scholar
  5. 5.
    Tsai, H.K., Yang, J.M., Kao, C.Y.: Applying Genetic Algorithms To Finding The Optimal Gene Order In Displaying The Microarray Data. GECCO, 610–617 (2002)Google Scholar
  6. 6.
    Davis, L.: Applying adapting algorithms to epistatic domains. In: Proc. Int. Joint Conf. Artificial Intelligence, Quebec, canada (1985)Google Scholar
  7. 7.
  8. 8.
  9. 9.
    Lee, S.K., Kim, Y.H., Moon, B.R.: Finding the Optimal Gene Order in Displaying Microarray Data. GECCO, 2215–2226 (2003)Google Scholar
  10. 10.
    Lin, S., Kernighan, B.W.: An effective heuristic for the traveling salesman problem. Operation Research 21, 498–516 (1973)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Shubhra Sankar Ray
    • 1
  • Sanghamitra Bandyopadhyay
    • 1
  • Sankar K. Pal
    • 1
  1. 1.Machine Intelligence UnitIndian Statistical InstituteKolkataIndia

Personalised recommendations