Improving search by incorporating evolution principles in parallel Tabu Search
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 823-828
- https://doi.org/10.1109/icec.1994.349949
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.Keywords
This publication has 9 references indexed in Scilit:
- Testing parallel evolution strategies on the quadratic assignment problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Diversity and Diversification in Genetic Algorithms: Some Connections with Tabu SearchPublished by Springer Nature ,1993
- SIMULATION OF GENETIC ALGORITHMS ON MIMD MULTICOMPUTERSParallel Processing Letters, 1992
- The parallel genetic algorithm as function optimizerParallel Computing, 1991
- Tabu Search—Part IIINFORMS Journal on Computing, 1990
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- Quadratic assignment problemsEuropean Journal of Operational Research, 1984
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- An Experimental Comparison of Techniques for the Assignment of Facilities to LocationsOperations Research, 1968