A Distributed Hybrid Heuristics of Mean Field Annealing and Genetic Algorithm for Load Balancing Problem

DOI10.1007/11908029_75zbMATH Open1162.68654OpenAlexW1889384230MaRDI QIDQ3535523FDOQ3535523

Chuleui Hong

Publication date: 13 November 2008

Published in: Rough Sets and Current Trends in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11908029_75

Recommendations

• A new mapping heuristic based on mean field annealing
• Genetic algorithm based heuristics for the mapping problem
• Publication:4719761
• A high-efficient multi-deme genetic algorithm with better load-balance
• scientific article; zbMATH DE number 2153019

zbMATH Keywords

simulated annealingmappinggenetic algorithmsparallel processingmean field annealing

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (2)

• Genetic local search and hardness of approximation for the server load balancing problem
• A new mapping heuristic based on mean field annealing

This page was built for publication: A Distributed Hybrid Heuristics of Mean Field Annealing and Genetic Algorithm for Load Balancing Problem

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