Heuristic combinatorial optimization by simulated Darwinian evolution: a polynomial time algorithm for the Traveling Salesman Problem.
Balamurali Krishna AmbatiJayakrishna AmbatiMazen Moein MokhtarPublished in: Biol. Cybern. (1991)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- simulated annealing
- combinatorial optimization problems
- lin kernighan
- metaheuristic
- combinatorial problems
- minimum spanning tree
- exact algorithms
- benchmark instances
- branch and bound
- branch and bound algorithm
- optimization problems
- ant colony optimization
- memetic algorithm
- hamiltonian cycle
- ant colony optimization algorithm
- discrete particle swarm optimization
- quadratic assignment problem
- vehicle routing problem
- optimal solution
- job shop scheduling problem
- solution quality
- particle swarm optimization
- single machine scheduling problem
- dynamic programming
- discrete optimization
- path relinking
- satisfy the triangle inequality
- search space
- traveling salesman
- genetic local search
- np hard
- cost function
- computational complexity