Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation.
Károly F. PálPublished in: Biol. Cybern. (1993)
Keyphrases
- traveling salesman problem
- crossover operator
- genetic algorithm
- combinatorial optimization
- lin kernighan
- traveling salesman
- simulated annealing
- mutation operator
- benchmark instances
- variable neighborhood search
- neighborhood search
- metaheuristic
- ant colony optimization
- memetic algorithm
- optimization problems
- evolutionary algorithm
- tabu search
- combinatorial optimization problems
- minimum spanning tree
- ant colony optimization algorithm
- hamiltonian cycle
- job shop scheduling problem
- candidate solutions
- combinatorial problems
- genetic algorithm ga
- optimal solution
- discrete optimization problems
- exact algorithms
- genetic programming
- nature inspired
- search algorithm
- valid inequalities
- evolutionary computation
- genetic local search
- satisfy the triangle inequality
- quadratic assignment problem
- path relinking
- cost function
- fitness function
- global optimization
- branch and bound algorithm
- search space
- discrete optimization
- neural network
- dynamic programming
- particle swarm optimization