A neural algorithm incorporating winner-take-all subnets for combinatorial optimization.
Kiichi UrahamaPublished in: Systems and Computers in Japan (1993)
Keyphrases
- combinatorial optimization
- simulated annealing
- traveling salesman problem
- cost function
- combinatorial optimization problems
- optimization problems
- quadratic assignment problem
- search space
- k means
- dynamic programming
- metaheuristic
- mathematical programming
- network architecture
- branch and bound
- learning algorithm
- np hard
- job shop scheduling problem
- ant miner
- ant colony optimization
- particle swarm optimization algorithm
- benchmark problems
- greedy algorithm
- linear programming
- objective function
- clustering algorithm