Evolution algorithms in combinatorial optimization

Parallel Computing

Volumn 7, Issue 1, 1988, Pages 65-85

  Muhlenbein H ^a   Gorges Schleuter, M ^a   Kramer O ^a  

^a Gesellschaft für Mathematik und Datenverarbeitung mbH ^*  (Germany)

Author keywords

combinatorial optimization; Darwinian algorithm; Evolution algorithms; genetic algorithm; network algorithm; superlinear speedup of a new genetic algorithm

Indexed keywords

OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; DARWINIAN ALGORITHM; EVOLUTION ALGORITHMS; GENETIC ALGORITHM; SUPERLINEAR SPEEDUP;

COMPUTER PROGRAMMING;

EID: 0023999449     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(88)90098-1     Document Type: Article

References (30)

1. A partitioning strategy for nonuniform problems on multiprocessors
2. Boltzmann and Darwinin strategies in complex optimization
3. Optimization strategies gleaned from biological evolution
4. Models of evolution systems and their application to optimization problems
5. A review of automatic load balancing and decomposition methods for the hypercube
6. Load balancing by a neural network
7. “Neural” Computation of decisions in optimization problems
8. Partitioning PDE computations Methods and performance evaluation
9. Network decomposition for the optimization of connected structures
10. An efficient heuristic procedure for partitioning graphs
11. Optimization by simulated annealing
12. Mapping strategies in message based multiprocessor systems
13. A man-machine approach toward solving the TSP
14. Computer solutions of the traveling salesman problem
15. New solutions to the mapping problem of parallel systems — The evolution approach
16. Probabilistic exchange algorithms and Euclidean travelling salesman problems
17. PIE: A programming and instrumentation environment for parallel processing
18. A survey of replicator equations
19. Pattern Formation by Natural Selection with Applications to Decision Support
20. Population genetics and combinatorial optimization
21. MPC: Multiprocessor C