论文信息 - Local Search Methods for Tree Chromosome Structure in a GA to Identify Functions - 字舞流文

Local Search Methods for Tree Chromosome Structure in a GA to Identify Functions

Morikazu Nakamura | Hayao Miyagi | Mitsukuni Matayoshi | Morikazu Nakamura | H. Miyagi | Mitsukuni Matayoshi

[1] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[2] Morikazu Nakamura,et al. A Genetic Algorithm with the Improved 2-opt Method for Quadratic Assignment Problem , 2004 .

[3] K. Katayama,et al. A Variant k-opt Local Search Heuristic for Binary Quadratic Programming , 2001 .

[4] Mitsukuni Matayoshi,et al. Tree chromosome structure in a genetic algorithm to identify functions , 1999, Systems and Computers in Japan.

[5] Bernd Freisleben,et al. Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[6] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[7] Hitoshi Iba,et al. System Identification using Structured Genetic Algorithms , 1993, ICGA.

[8] Hitoshi Iba,et al. System identification approach to genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.