Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Hans-Joachim BöckenhauerJuraj HromkovicRalf KlasingSebastian SeibertWalter UngerPublished in: Theor. Comput. Sci. (2002)
Keyphrases
- traveling salesman problem
- optimization problems
- combinatorial optimization
- ant colony optimization
- combinatorial problems
- combinatorial optimization problems
- ant colony optimization algorithm
- hamiltonian cycle
- evolutionary algorithm
- satisfy the triangle inequality
- discrete optimization
- discrete optimization problems
- vehicle routing problem
- optimization algorithm
- traveling salesman
- global optimization
- metaheuristic
- transportation networks
- nature inspired
- optimization methods
- crossover operator
- simulated annealing
- cost function
- objective function
- discrete particle swarm optimization