Location of Repository

Improving Search by Incorporating Evolution Principles in Parallel Tabu Search

By I. De Falco, R. Del Balio, E. Tarantino and R. Vaccaro

Abstract

Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively parallel systems constitutes an opportunity to be considered for solving significant applications in reasonable times. In this paper, starting from Tabu Search, a general optimization methodology, a parallel version, oriented to distributed memory multiprocessors and including evolution principles, has been introduced and discussed. The experiments have been performed on classical Travelling Salesman Problems and Quadratic Assignment Problems taken from literature. The results obtained show that the incorporation of evolution principles is very fruitful for the search strategy in terms of both convergence speed and solution precision. 1. INTRODUCTION Many optimization techniques have been introduced during last years to find adequate solutions in high dimensional search spaces [1]; among them the mos..

Year: 1994
OAI identifier: oai:CiteSeerX.psu:10.1.1.31.5334
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.irsip.na.cnr.it/~ho... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.