A Discrete Binary Version of the Electromagnetism-Like Heuristic for Solving Traveling Salesman Problem.
Nikbakhsh JavadianMohsen Gol AlikhaniReza Tavakkoli-MoghaddamPublished in: ICIC (2) (2008)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- lin kernighan
- traveling salesman
- discrete optimization problems
- simulated annealing
- benchmark instances
- combinatorial optimization problems
- metaheuristic
- optimization problems
- combinatorial problems
- variable neighborhood search
- neighborhood search
- branch and bound
- ant colony optimization algorithm
- hamiltonian cycle
- vehicle routing problem
- branch and bound algorithm
- exact algorithms
- ant colony optimization
- minimum spanning tree
- timetabling problem
- valid inequalities
- quadratic assignment problem
- path relinking
- crossover operator
- discrete optimization
- evolutionary algorithm
- genetic local search
- satisfy the triangle inequality
- neural network
- graph coloring
- search procedure
- genetic algorithm