Benchmarking Metaheuristic Optimization Algorithms on Travelling Salesman Problems.
Deniz TosoniChristopher GalliThomas HanneRolf DornbergerPublished in: ICSLT (2022)
Keyphrases
- optimization problems
- metaheuristic
- combinatorial optimization
- combinatorial optimization problems
- continuous optimization
- evolutionary algorithm
- test problems
- benchmark problems
- tabu search
- simulated annealing
- combinatorial problems
- search methods
- knapsack problem
- objective function
- ant colony optimization
- mathematical programming
- suboptimal solutions
- travelling salesman
- cost function
- exact algorithms
- multi objective
- benchmark instances
- search space
- vehicle routing problem
- metaheuristic algorithms
- heuristic methods
- set of benchmark instances
- nsga ii
- branch and bound algorithm
- branch and bound
- traveling salesman problem
- optimization algorithm
- particle swarm optimization
- estimation of distribution algorithms
- scatter search
- harmony search
- upper bound
- dynamic programming
- optimal solution
- genetic algorithm
- neural network