Simulated Annealing for Finding TSP Lower Bound.
Lukasz StrakWojciech WieczorekArkadiusz NowakowskiPublished in: ICCCI (2) (2017)
Keyphrases
- lower bound
- simulated annealing
- optimal solution
- genetic algorithm
- upper bound
- np hard
- traveling salesman problem
- combinatorial optimization
- metaheuristic
- tabu search
- branch and bound algorithm
- ant colony optimization
- branch and bound
- objective function
- solution quality
- worst case
- hybrid algorithm
- linear programming relaxation
- genetic algorithm ga
- reversible jump mcmc
- data sets
- optimization problems
- evolutionary algorithm
- search space
- stochastic search
- travelling salesman
- constraint satisfaction problems
- upper and lower bounds
- hill climbing
- particle swarm optimization
- multi objective
- special case
- neural network