Ant Colony System Based Solutions to the Quadratic Assignment Problem on GPGPU

Abstract

The NP-hard Quadratic Assignment Problem (QAP) was proposed in 1957. Until this date, it remains one of the hardest problems to solve in any reasonable amount of time, even for small instances. Even using parallel computation and assuming small instances of the problem, some naive and deterministic algorithms require too much time to obtain the solution. In… (More)
DOI: 10.1109/ICPPW.2012.47

10 Figures and Tables

Topics

  • Presentations referencing similar topics