Parallelizing Tabu Search Based Optimization Algorithm on GPUs
There are many combinatorial optimization problems such as traveling salesman problem, quadratic-assignment problem, flow shop scheduling, that are computationally intractable. Tabu search based simulated annealing is a stochastic search algorithm that is widely used to solve combinatorial optimizat...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholar Commons
2018
|
| Subjects: | |
| Online Access: | https://scholarcommons.usf.edu/etd/7638 https://scholarcommons.usf.edu/cgi/viewcontent.cgi?article=8835&context=etd |