Solution Level Parallelization of Local Search Metaheuristic Algorithm on GPU

@inproceedings{Ghorpade2014SolutionLP,
  title={Solution Level Parallelization of Local Search Metaheuristic Algorithm on GPU},
  author={Sachin Vijay Ghorpade and Snehal Kamalapur},
  year={2014}
}
Local search metaheuristic algorithms are proven & powerful combinatorial optimization strategies to tackle hard problems like traveling salesman problem. These algorithms explore & evaluate neighbors of a single solution. Time Consuming LSM algorithms can be improved by parallelizing exploration & evaluation of neighbors of a solution. GPU architecture is suitable for algorithms of single program multiple data parallelism. Implemented algorithm reduces time consuming memory transfers and… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

An effective implementation of the Lin-Kernighan traveling salesman heuristic

  • European Journal of Operational Research
  • 2000
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL