This paper proposes a parallel ant colony optimization (ACO) for solving quadratic
assignment problems (QAPs) on a graphics processing unit (GPU) by combining tabu (TS) …

This paper proposes a parallel ant colony optimization (ACO) for solving quadratic
assignment problems (QAPs) on a graphics processing unit (GPU) by combining fast, 2-opt …

This paper compares the performance of parallel computation on two types of many-core
processors, Tesla K20c GPU and Xeon Phi 5110P, in solving the quadratic assignment …

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 …

Recently symmetric multi processing (SMP) has become available at a reasonable cost. In
this paper, we propose several types of parallel ACO algorithms with SMP for solving the …

The quadratic assignment problem (QAP) is a well known important combinatorial problem.
Indeed, many real world applications such as backboard wiring, typewriter keyboard design …

The previously proposed cunning ant system (c AS), a variant of the ACO algorithm, worked
well on the TSP and the results showed that the c AS could be one of the most promising …

The existing ant colony optimization (ACO) algorithms for the quadratic assignment problem
(QAP) are often combined with two kinds of stochastic local search (SLS) methods: the 2-opt …

In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony
optimization (ACO) and various local search (LS) procedures have been developed for …

Ant colony optimization algorithms are currently among the best performing algorithms for
the quadratic assignment problem. These algorithms contain two main search procedures …