Parallel biased search for combinatorial optimization: genetic algorithms and TABU

Microprocessors and Microsystems

Volumn 16, Issue 7, 1992, Pages 351-367

  Battiti, Roberto ^a   Tecchiolli, Giampietro ^b  

^a UNIVERSITY OF TRENTO   (Italy)

^b ITC IRST   (Italy)

Author keywords

combinatorial optimization; genetic algorithms; parallel computing; TABU

Indexed keywords

EID: 0000545145     PISSN: 01419331     EISSN: None     Source Type: Journal    
DOI: 10.1016/0141-9331(92)90003-C     Document Type: Article

References (32)

1. Interactive decision software and computer graphics for architectural and space planning
2. Tabu search — part I
3. Tabu search — part II
4. Robust taboo search for the quadratic assignment problem
5. Optimization by simulated annealing
6. Stochastic versus deterministic update in simulated annealing
7. Large-steps Markov chains for the travelling salesman problem
8. Genetic algorithms — introduction, applications and extensions
9. An analysis of the behavior of a class of genetic adaptive systems
10. A comparative analysis of selection schemes used in genetic algorithms
11. An analysis of Multi-Point Crossover
12. Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear systems
13. Spurious correlations and premature convergence in genetic algorithms
14. Maturation of the immune response via adaptive walks on affinity landscapes
15. Correlated and uncorrelated fitness landscapes and how to tell the difference
16. Slow annealing versus multiple fast annealing runs — an empirical investigation
17. Darwin's continent cycle theory and its simulation by the prisoner's dilemma
18. Evolution in time and space — the parallel genetic algorithm
19. Evolution algorithms in combinatorial optimization
20. The parallel genetic algorithm as function optimizer
21. A massively parallel genetic algorithm — Implementation and first analysis