Grisland: a parallel genetic algorithm for finding near optimal solutions to the traveling salesman problem.
Jonatan GómezRoberto PovedaElizabeth LeónPublished in: GECCO (Companion) (2009)
Keyphrases
- traveling salesman problem
- parallel genetic algorithm
- combinatorial problems
- discrete optimization problems
- combinatorial optimization
- path relinking
- benchmark instances
- neighborhood search
- optimization problems
- ant colony optimization
- hamiltonian cycle
- variable neighborhood search
- ant colony optimization algorithm
- genetic algorithm
- discrete particle swarm optimization
- combinatorial optimization problems
- parallel genetic algorithms
- vehicle routing problem
- traveling salesman
- valid inequalities
- solution quality
- benchmark problems
- evolutionary algorithm
- quay crane
- optimal solution
- graph coloring
- simulated annealing
- test instances
- crossover operator
- genetic local search