A Greedy-Genetic Local-Search Heuristic for the Traveling Salesman Problem.
Mohammad Harun RashidMiguel A. MosteiroPublished in: ISPA/IUCC (2017)
Keyphrases
- genetic local search
- traveling salesman problem
- beam search
- combinatorial optimization
- lin kernighan
- search algorithm
- traveling salesman
- hill climbing
- variable neighborhood search
- benchmark instances
- neighborhood search
- multi objective
- combinatorial problems
- dynamic programming
- minimum spanning tree
- greedy algorithm
- ant colony optimization
- optimization problems
- search space
- combinatorial optimization problems
- branch and bound
- hamiltonian cycle
- satisfy the triangle inequality
- vehicle routing problem
- crossover operator
- heuristic search
- simulated annealing
- search methods
- valid inequalities
- optimal solution
- evolutionary algorithm
- metaheuristic
- tabu search
- search problems
- branch and bound algorithm
- reinforcement learning
- feasible solution