Proceedings of the ... IEEE Conference on Evolutionary Computation, Volume 1IEEE, 1994 - Algorithms |
Contents
A COMPARISON STUDY OF GENETIC CODINGS FOR THE TRAVELING SALESMAN PROBLEM | 1 |
A NEW GENETIC APPROACH FOR THE TRAVELING SALESMAN PROBLEM | 7 |
MAPPING ORDERINDEPENDENT GENES AND THE KNAPSACK PROBLEM | 13 |
Copyright | |
8 other sections not shown
Other editions - View all
Common terms and phrases
adaptive applied approach Artificial Average final objective binary chromosome clustering complex Conference on Genetic constraint convergence crossover crossover operator defined distribution encoding evaluation function evolution Evolution Strategies evolutionary algorithm EVOLUTIONARY COMPUTATION evolve example Figure final objective function fitness function fitness value fuzzy gene Genetic Algorithms genetic operators Genetic Programming genetic search genotype global global optimum Goldberg graph Gray coding heuristic hybrid IEEE implemented individuals initial population input International Conference iteration Koza length Machine Learning maximum method mutation neural networks neurons nodes objective function objective function value offspring optimization optimum output parallel parameters parent partition performance probability problem processor protein random randomly recombination representation represented rithms rule runs sample schemata scheme search space selective pressure simulated annealing solution solve strategy string structure task tion Traveling Salesman Problem tree University variables vector weights