Using simulated annealing to design good codes
IEEE Transactions on Information Theory
Global optimization
An evolutionary approach to combinatorial optimization problems
CSC '94 Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications
How to solve it: modern heuristics
How to solve it: modern heuristics
Forking Genetic Algorithm with Blocking and Shrinking Modes (fGA)
Proceedings of the 5th International Conference on Genetic Algorithms
MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Parallel LAN/WAN Heuristics for Optimization
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Parallelism and evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Efficient parallel LAN/WAN algorithms for optimization: the MALLBA project
Parallel Computing
MALLBA: a software library to design efficient optimisation algorithms
International Journal of Innovative Computing and Applications
Efficient parallel LAN/WAN algorithms for optimization. The mallba project
Parallel Computing
Hi-index | 0.00 |
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics (both pure and hybrid) for solving optimization problems. We focus on several evolutionary algorithms as well as on simulated annealing. Our goal is to offer a first study on the possible changes in the search mechanics that the algorithms suffer when shifting from a LAN network to a WAN environment. We will address six optimization tasks of considerable complexity. The results show that, despite their expected slower execution time, the WAN versions of our algorithms consistently solve the problems. We report also some interesting results in which WAN algorithms outperform LAN ones. Those results are further extended to analyze the behavior of the heuristics in WAN with a larger number of processors and different connectivities.