Modified Simulated Annealing Hybrid Algorithm to Solve the Traveling Salesman Problem.
Eduardo Chandomí-CastellanosElías N. Escobar-GómezSergio F. Aguilar Marroquín-CanoHéctor R. Hernández De LeónSabino Velázquez-TrujilloJorge A. Sarmiento-TorresCarlos Venturino De Coss PérezPublished in: CoDIT (2022)
Keyphrases
- hybrid algorithm
- traveling salesman problem
- simulated annealing
- combinatorial optimization
- ant colony optimization
- discrete optimization problems
- metaheuristic
- tabu search
- nonlinear integer programming
- ant colony optimization algorithm
- neighborhood search
- evolutionary algorithm
- genetic algorithm
- particle swarm optimization pso
- combinatorial optimization problems
- benchmark problems
- hybrid method
- standard test problems
- genetic algorithm ga
- optimization method
- traveling salesman
- branch and bound
- hamiltonian cycle
- solution space
- artificial bee colony algorithm
- imperialist competitive algorithm
- vehicle routing problem
- optimization problems
- solution quality
- search procedure
- optimization methods
- swarm intelligence
- job shop scheduling problem
- nature inspired
- ant colony algorithm
- particle swarm optimization
- genetic local search
- differential evolution
- fitness function
- crossover operator
- global optimum
- hybrid optimization algorithm
- benchmark instances
- quadratic assignment problem
- genetic programming