A novel chaotic search for quadratic assignment problems

A novel chaotic search for quadratic assignment problems

0.00 Avg rating0 Votes
Article ID: iaor20023495
Country: Netherlands
Volume: 139
Issue: 3
Start Page Number: 543
End Page Number: 556
Publication Date: Jun 2002
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: heuristics, neural networks
Abstract:

We propose a novel method for solving the quadratic assignment problems. First, we realize the conventional tabu search on a neural network, and modify it to a chaotic version. Our novel method includes both effects of chaotic dynamics and tabu search. We compare the performance of the novel chaotic search with the conventional tabu search and an exponential tabu search whose memory effect for tabu (forbidding previous moves) decays exponentially. We show that the exponential tabu search has higher performance than the conventional tabu search, and further that the novel method with a chaotic neural network exhibits the best performance. We also propose a controlling method of the chaotic neural network for realizing easy and robust applications of our method. Then, better performance can be realized without manual parameter setting for various problems.

Reviews

Required fields are marked *. Your email address will not be published.