Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques.
Shyi-Ming ChenChih-Yao ChienPublished in: Expert Syst. Appl. (2011)
Keyphrases
- combinatorial optimization
- simulated annealing
- traveling salesman problem
- particle swarm
- optimization methods
- optimization method
- genetic algorithm
- metaheuristic
- evolutionary algorithm
- hybrid algorithm
- optimization problems
- particle swarm algorithm
- combinatorial optimization problems
- optimisation problems
- fitness function
- tabu search
- premature convergence
- branch and bound
- ant colony optimization
- discrete optimization problems
- simulated annealing algorithm
- benchmark problems
- combinatorial problems
- particle swarm optimization
- optimization strategy
- multi objective
- vehicle routing problem
- branch and bound algorithm
- job shop scheduling problem
- solution quality
- swarm intelligence
- particle swarm optimization pso
- genetic algorithm ga
- solution space
- global optimum
- traveling salesman
- hamiltonian cycle
- crossover operator
- valid inequalities
- differential evolution
- evolutionary computation
- hill climbing
- pso algorithm
- particle swarm optimization algorithm
- genetic programming
- genetic local search
- neural network
- memetic algorithm
- routing problem
- column generation
- optimization algorithm
- machine learning