Hybrid algorithm based on Chemical Reaction Optimization and Lin-Kernighan local search for the Traveling Salesman Problem.
Jian SunYuting WangJunqing LiKaizhou GaoPublished in: ICNC (2011)
Keyphrases
- traveling salesman problem
- hybrid algorithm
- lin kernighan
- ant colony optimization
- combinatorial optimization
- chemical reaction
- simulated annealing
- traveling salesman
- optimization problems
- ant colony optimization algorithm
- hybrid optimization algorithm
- metaheuristic
- tabu search
- optimization method
- combinatorial optimization problems
- particle swarm optimization
- evolutionary algorithm
- genetic algorithm
- neighborhood search
- aco algorithm
- particle swarm optimization pso
- optimization algorithm
- differential evolution
- global optimization
- particle swarm
- imperialist competitive algorithm
- benchmark instances
- discrete optimization
- quadratic assignment problem
- vehicle routing problem
- nature inspired
- branch and bound
- global search
- swarm intelligence
- path relinking
- hybrid algorithms
- initial solution
- optimization methods
- hill climbing
- memetic algorithm
- benchmark problems
- optimal solution
- exact algorithms
- crossover operator
- convergence speed
- knapsack problem
- pso algorithm
- np complete
- genetic programming
- cost function
- lower bound
- nonlinear integer programming
- objective function