Study on the recognition and utilization of building block in the iterations of genetic algorithm

Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University

Volumn 40, Issue 2, 2006, Pages 133-137

  Lu, Jun ^a   Feng, Boqin ^a   Li, Bo ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Building block; Genetic algorithm; Traveling salesman problem

Indexed keywords

IMPROVEMENT; ITERATIVE METHODS; MATHEMATICAL OPERATORS; OBJECT RECOGNITION; RANDOM PROCESSES; TRAVELING SALESMAN PROBLEM;

BLINDNESS; BUILDING BLOCK; RANDOM SEARCHING; SEARCHING EFFICIENCY;

GENETIC ALGORITHMS;

EID: 33646145725     PISSN: 0253987X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Holland J H. Adaptation in natural and artificial system[M]. Ann Arbor, USA: The University of Michigan Press, 1975.
2. Forrest S, Mitchell M. Relative building-block fitness and the building-block hypothesis[A]. Foundations of Genetic Algorithms[C]. San Mateo, CA: Morgan Kaufmann, 1992. 109-126.
3. Wu A S, de Jong K A. An examination of building block dynamics in different representations[A]. 1999 Congress on Evolutionary Computation, Washington DC, 1999.
4. van Kemenade C H M. Building block filtering and mixing[R]. Report SEN-R9837. Amsterdam, Netherlands: Software Engineering, Centrum voor Wiskunde en Informatica, 1998.
5. Schneider J. Searching for backbones - an efficient parallel algorithm for the traveling salesman problem[J]. Computer Physics Communications, 1996, 96(2-3): 173-188.
6. University of Heidelberg. TSPLIB: library of sample instances for the TSP[EB/OL]. http://www.iwr.uni-hei-delberg.de/groups/comopt/software/TSPLB95/, 2004-10-20.
7. Larranaga P, Kuijpers C M H. Genetic algorithms for the travelling salesman problem: a review of representations and operators[J]. Artificial Intelligence Review, 1999, 13(2): 129-170.