A Puzzle-Based Genetic Algorithm with Block Mining and Recombination Heuristic for the Traveling Salesman Problem.
Pei-Chann ChangWei-Hsiu HuangZhenzhen ZhangPublished in: J. Comput. Sci. Technol. (2012)
Keyphrases
- traveling salesman problem
- crossover operator
- combinatorial optimization
- genetic algorithm
- lin kernighan
- traveling salesman
- ant colony optimization
- benchmark instances
- metaheuristic
- neighborhood search
- variable neighborhood search
- memetic algorithm
- simulated annealing
- combinatorial optimization problems
- minimum spanning tree
- sliding tile
- combinatorial problems
- tabu search
- job shop scheduling problem
- hamiltonian cycle
- optimization problems
- ant colony optimization algorithm
- evolutionary algorithm
- vehicle routing problem
- path relinking
- optimal solution
- satisfy the triangle inequality
- genetic local search
- constraint satisfaction
- branch and bound
- discrete optimization problems
- exact algorithms
- valid inequalities
- timetabling problem
- branch and bound algorithm
- fitness function
- genetic programming
- test instances
- heuristic methods
- hill climbing
- search procedure
- solution quality
- differential evolution
- dynamic programming