Solving the traveling salesman problem through genetic algorithms with changing crossover operators.
Ryouei TakahashiPublished in: ICMLA (2005)
Keyphrases
- np complete
- traveling salesman problem
- crossover operator
- combinatorial optimization
- mutation operator
- discrete optimization problems
- genetic algorithm
- memetic algorithm
- ant colony optimization
- genetic operators
- explore the search space
- optimization problems
- combinatorial optimization problems
- combinatorial problems
- evolutionary algorithm
- genetic algorithm ga
- simulated annealing
- ant colony optimization algorithm
- metaheuristic
- hamiltonian cycle
- fitness function
- traveling salesman
- neural network
- genetic local search
- vehicle routing problem
- differential evolution
- quadratic assignment problem
- branch and bound
- multi objective
- artificial neural networks
- hybrid algorithm
- branch and bound algorithm
- genetic programming
- satisfy the triangle inequality