A Fast FPGA-Based 2-Opt Solver for Small-Scale Euclidean Traveling Salesman Problem.
Ioannis MavroidisIoannis PapaefstathiouDionisios N. PnevmatikatosPublished in: FCCM (2007)
Keyphrases
- traveling salesman problem
- small scale
- combinatorial optimization
- ant colony optimization
- combinatorial problems
- optimization problems
- euclidean distance
- ant colony optimization algorithm
- larger scale
- vehicle routing problem
- euclidean space
- transportation networks
- discrete particle swarm optimization
- crossover operator
- traveling salesman
- combinatorial optimization problems
- subtour elimination
- genetic local search
- objective function
- branch and bound
- discrete optimization problems