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. (1992)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- simulated annealing
- metaheuristic
- combinatorial optimization problems
- branch and bound
- discrete particle swarm optimization
- ant colony optimization
- optimization problems
- hamiltonian cycle
- benchmark instances
- combinatorial problems
- branch and bound algorithm
- traveling salesman
- quadratic assignment problem
- lin kernighan
- exact algorithms
- optimal solution
- memetic algorithm
- ant colony optimization algorithm
- single machine scheduling problem
- minimum spanning tree
- artificial bee colony
- vehicle routing problem
- path relinking
- dynamic programming
- cost function
- evolutionary algorithm
- search space
- satisfy the triangle inequality
- crossover operator
- tabu search
- computational complexity
- genetic algorithm
- linear program
- evolutionary computation
- multi objective
- neural network