New operators of genetic algorithms for traveling salesman problem

Proceedings - International Conference on Pattern Recognition

Volumn 2, Issue , 2004, Pages 497-500

  Ray, Shubhra Sankar ^a   Bandyopadhyay, Sanghamitra ^a   Pal, Sankar K ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Knowledge based multiple inversion; Knowledge based neighborhood swapping; Order crossover

Indexed keywords

COSTS; DNA; FUNCTIONS; GENETIC ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; MATRIX ALGEBRA;

KNOWLEDGE BASED MULTIPLE INVERSION (KBMI); KNOWLEDGE BASED NEIGHBOURHOOD SWAPPING; ORDER CROSSOVER; TRAVELING SALESMAN PROBLEM (TSP);

PROBLEM SOLVING;

EID: 10044275167     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icpr.2004.1334276     Document Type: Conference Paper

References (7)

1. st Indian International Conference on Artificial Intelligence, 2003.
2. Garey, M. R., and Johnson, D. S.: "Computers and Intractability: A Guide to the Theory of NP-completeness", W. H. Freeman and Co., San Francisco, 1979.
3. Goldberg, D. E.: "Genetic Algorithm in Search, Optimization and Machine Learning", Machine Learning. Addison-Wesley, New York, 1989.
4. TSPLIB Homepage: http://www.iwr.uniheidelberg.de/groups/comopt/software/ TSPLIB95/
5. Lalena, M.: TSP solver, http://www.lalena.com/ai/tsp
6. Larranaga, P., Kuijpers, C. M. H.,Murga, R. H., Inza, I., Dizdarevic, S.: "Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators", Artificial Intelligence Review. 13, 1999, 129-170.
7. Syswerda, G, "Schedule optimization using genetic algorithms, Handbook of Genetic Algorithms", Van Nostrand Reinhold, New York, 1991, 332-349.