|
Volumn 6238 LNCS, Issue PART 1, 2010, Pages 566-575
|
A hybrid genetic algorithm for the traveling salesman problem using generalized partition crossover
|
Author keywords
Chained LK; Generalized Partition Crossover; Hybrid Genetic Algorithm; Traveling Salesman Problem
|
Indexed keywords
CHAINED-LK;
COMPUTATIONAL EFFORT;
GENERALIZED PARTITION CROSSOVER;
HYBRID GENETIC ALGORITHM;
HYBRID GENETIC ALGORITHMS;
LOCAL OPTIMA;
NEAR-OPTIMAL SOLUTIONS;
OPTIMAL SOLUTIONS;
POPULATION SIZES;
PROBLEM SIZE;
STATE OF THE ART;
TRAVELING SALESMAN;
GENETIC ALGORITHMS;
MATHEMATICAL OPERATORS;
OPTIMAL SYSTEMS;
POPULATION STATISTICS;
PROBLEM SOLVING;
TRAVELING SALESMAN PROBLEM;
|
EID: 78149239292
PISSN: 03029743
EISSN: 16113349
Source Type: Book Series
DOI: 10.1007/978-3-642-15844-5_57 Document Type: Conference Paper |
Times cited : (56)
|
References (7)
|