The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Grid Computing: Making the Global Infrastructure a Reality
Grid Computing: Making the Global Infrastructure a Reality
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Grid Computing
Distributed and Parallel Systems: Cluster and Grid Computing (Kluwer International Series in Engineering & Computer Science)
Advanced Programming in the UNIX(R) Environment (2nd Edition)
Advanced Programming in the UNIX(R) Environment (2nd Edition)
PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
Parallelism and evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Distributed and asynchronous solver for large CPU intensive problems
Applied Soft Computing
Hi-index | 0.01 |
Scatter search (SS) is an evolutionary algorithm (EA) becoming more important in current researches as the increasing number of publications shows. It is a very promising method for solving combinatorial and nonlinear optimisation problems. This algorithm is being widely implemented for solving problems not taking long, but in case of processes requiring of high execution times likely to be executed using grid computing there is not an implementation for it. Some problems arise when we try to execute this algorithm using the grid, but once they are solved, the obtained results are really promising for many complex and scientific applications like, for example, applications for optimising nuclear fusion devices. Using concurrent programming and distributed techniques associated to the grid, the algorithm works as it could do it in a single computer.