Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

PREMI
2007
Springer

favoriteEmaildiscussreport

165views Pattern Recognition» more PREMI 2007»

Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization

13 years 10 months ago

Cunning Ant System for Quadratic Assignment Problem with Local Search and Parallelization

Download www2.hannan-u.ac.jp

Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most promising ACO algorithms. In this paper, we apply cAS to solving QAP. We focus our main attention on the eﬀects of applying local search and parallelization of the cAS. Results show promising performance of cAS on QAP.

Shigeyoshi Tsutsui

Real-time Traffic

ACO Algorithms | Cunning Ant | PREMI 2007 | Promising Aco Algorithms |

claim paper

Related Content

» Consultantguided search algorithms for the quadratic assignment problem

» A GAACOlocal search hybrid algorithm for solving quadratic assignment problem

» Ant Colony Optimization for the Ship Berthing Problem

» Improving Search by Incorporating Evolution Principles in Parallel Tabu Search

» Adaptation for parallel memetic algorithm based on population entropy

» Solving large scale combinatorial optimization using PMASLS

» CorrelationAware Object Placement for MultiObject Operations

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	PREMI
Authors	Shigeyoshi Tsutsui

Comments (0)