Exploring grid implementations of parallel cooperative metaheuristics

MaRDI QIDQ3500162zbMATH OpenFDO

Authors Aletéia P. F. Araújo, Cristina Boeres, Vinod E. F. Rebello, Sebastián Urrutia, Celso C. Ribeiro

Publication date 3 June 2008

zbMATH Keywords

computational gridsGRASPgrid computingiterated local searchparallel metaheuristicstraveling tournament problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
• Parallel Greedy Randomized Adaptive Search Procedures
• Strategies for the parallel implementation of metaheuristics
• scientific article; zbMATH DE number 2233235
• Parallel Hybrid Metaheuristics

Cited in

(9)

• A Benders approach for computing lower bounds for the mirrored traveling tournament problem
• Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid
• Grid computing for parallel bioinspired algorithms
• COSEARCH: A parallel cooperative metaheuristic
• A parallel metaheuristic framework based on harmony search for scheduling in distributed computing systems
• Parallel GEAs with Linkage Analysis over Grid
• A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
• An efficient meta-heuristic algorithm for grid computing
• scientific article; zbMATH DE number 2233235 (Why is no real title available?)

Describes a project that uses

Uses Software

• GRASP
• MersenneTwister
• TTTPLOTS

This page was built for publication: Exploring grid implementations of parallel cooperative metaheuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3500162)