Building a better heuristic for the traveling salesman problem: combining edge assembly crossover and partition crossover.
Danilo Sipoli SanchesL. Darrell WhitleyRenato TinósPublished in: GECCO (2017)
Keyphrases
- traveling salesman problem
- crossover operator
- combinatorial optimization
- traveling salesman
- lin kernighan
- genetic algorithm
- benchmark instances
- genetic programming
- ant colony optimization
- neighborhood search
- evolutionary algorithm
- optimization problems
- variable neighborhood search
- simulated annealing
- genetic algorithm ga
- minimum spanning tree
- combinatorial optimization problems
- path relinking
- ant colony optimization algorithm
- combinatorial problems
- genetic local search
- vehicle routing problem
- fitness function
- metaheuristic
- discrete particle swarm optimization
- branch and bound
- differential evolution
- hyper heuristics
- tabu search
- hamiltonian cycle
- discrete optimization problems
- branch and bound algorithm
- beam search
- shortest path
- search space
- optimal solution
- neural network