Parallel Cooperating A-Teams Solving Instances of the Euclidean Planar Travelling Salesman Problem.

Piotr Jedrzejowicz Izabela Wierzbowska

Published in: KES-AMSTA (2011)

Keyphrases

cooperative
quadratic assignment problem
timetabling problem
parallel processing
np complete problems
solve complex tasks
randomly generated
parallel computing
euclidean distance
parallel implementation
stochastic local search
random sat instances
euclidean space