Publication detail

Solving the Multidimensional Knapsack Problem using a CUDA Accelerated PSO

ZÁŇ, D. JAROŠ, J.

Original Title

Solving the Multidimensional Knapsack Problem using a CUDA Accelerated PSO

Type

conference paper

Language

English

Original Abstract

This paper addresses the possibility of solving the MKP using a GPU accelerated Particle Swarm Optimisation (PSO). The goal is to evaluate the attainable performance benefit when using a highly optimised GPU code instead of an efficient multi-core CPU implementation while preserving the quality of the search process.

Keywords

Particle Swarm Optimization, Multidimensional Knapsack Problem,
GPU, CUDA, Performance comparison.

Authors

ZÁŇ, D.; JAROŠ, J.

RIV year

2014

Released

5. 7. 2014

Publisher

IEEE Computational Intelligence Society

Location

Beijing

ISBN

978-1-4799-1488-3

Book

Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

Pages from

2933

Pages to

2939

Pages count

7

URL

https://www.fit.vut.cz/research/publication/10480/

BibTex

@inproceedings{BUT111512,
  author="Drahoslav {Záň} and Jiří {Jaroš}",
  title="Solving the Multidimensional Knapsack Problem using a CUDA Accelerated PSO",
  booktitle="Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014",
  year="2014",
  pages="2933--2939",
  publisher="IEEE Computational Intelligence Society",
  address="Beijing",
  doi="10.1109/CEC.2014.6900534",
  isbn="978-1-4799-1488-3",
  url="https://www.fit.vut.cz/research/publication/10480/"
}

Documents

E-14647.pdf