A similarity-based mechanism to control genetic algorithm and local search hybridization to solve traveling salesman problem.
Marjan Kuchaki RafsanjaniSadegh EskandariArsham Borumand SaeidPublished in: Neural Comput. Appl. (2015)
Keyphrases
- traveling salesman problem
- genetic algorithm
- combinatorial optimization
- discrete optimization problems
- ant colony optimization
- crossover operator
- neighborhood search
- simulated annealing
- metaheuristic
- aco algorithm
- hybrid algorithm
- combinatorial optimization problems
- memetic algorithm
- optimization problems
- path relinking
- tabu search
- lin kernighan
- fitness function
- combinatorial problems
- hamiltonian cycle
- ant colony optimization algorithm
- job shop scheduling problem
- multi objective
- vehicle routing problem
- evolutionary algorithm
- valid inequalities
- search space
- genetic local search
- traveling salesman
- search algorithm
- neural network
- swarm intelligence
- branch and bound
- differential evolution
- nature inspired
- discrete optimization
- genetic algorithm ga
- discrete particle swarm optimization
- optimal solution
- satisfy the triangle inequality