Parallel genetic simulated annealing: a massively parallel SIMD algorithm

Many significant engineering and scientific problems involve optimization of some criteria over a combinatorial configuration space. The two methods most often used to solve these problems effectively-simulated annealing (SA) and genetic algorithms (GA)-do not easily lend themselves to massive paral...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems Vol. 9; no. 2; pp. 126 - 136
Main Authors: Chen, H., Flann, N.S., Watson, D.W.
Format: Journal Article
Language:English
Published: IEEE 01.02.1998
Subjects:
ISSN:1045-9219
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first