Solutions to Parallel and Distributed Computing Problems: Lessons from Biological Sciences
by Albert Y. Zomaya, Fikret Ercal, Stephan Olariu
REFERENCES
1. J. E. Beasley, An algorithm for solving large capacitated warehouse location problems. European Jour. Operational Res., 33: 314–325, 1988.
2. R. Bianchini and C. M. Brown, Parallel genetic algorithms on distributed-memory architectures. In S. Atkins and A. S. Wagner eds., Transputer Research and Applications, pp. 67–82, IOS Press, Amsterdam, 1993.
3. J. Branke, H. C. Andersen, and H. Schmeck, Global selection methods for massively parallel computers. In T. C. Fogarty, ed., Proceedings AISB '96 Workshop on Evolutionary Computing, Lecture Notes in Computer Science 1143, pp. 175–188, Springer-Verlag, Berlin, New York, 1996.
4. J. Branke, F. Bucher, and H. Schmeck. A genetic algorithm for drawing undirected graphs. In J. T. Alander, ed., Proceedings of Third Nordic Workshop on Genetic Algorithms and their Applications, pp. 193–206, Finnish Artificial Intelligence Society, Helsinki, 1997.
5. J. Branke, U. Kohlmorgen, and H. Schmeck, A distributed genetic algorithm improving the generalization behavior of neural networks. In N. Lavrac and S. Wrobel, eds., Proceedings of European Conference on Machine Learning (ECML-95), pp. 107–121, Springer-Verlag, Berlin, New York, 1995.
6. D. Cattrysse, J. Maes, and L. N. van Wassenhove, Set partitioning and column generation heuristics for capacitated lotsizing. European Jour. Operational Res., 46:38–17, 1990.
7. E. Cantú-Paz, A survey of parallel genetic algorithms. Calculateurs Paralleles, Reseaux et Systems Repartis, 10(2): 141–171, ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access