Sciweavers

IAT
2010
IEEE

Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?

13 years 1 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are distributed hill-climbing techniques for solving large Distributed Constraint Optimization Problems (DCOPs) such as distributed scheduling, resource allocation, and distributed route planning. Like their centralized counterparts, these algorithms employ escape techniques to avoid getting trapped in local minima during the search process. For example, the best known version of DSA, DSA-B, makes hill-climbing and lateral escape moves, moves that do not impact the solution quality, with a single probability p. DSAN uses a similar scheme, but also occasionally makes a move that leads to a worse solution in an effort to find a better overall solution. Although these escape moves tend to lead to a better solutions in the end, the cost of employing the various strategies is often not well understood. In this work, we ...
Melanie Smith, Roger Mailler
Added 11 Feb 2011
Updated 11 Feb 2011
Type Journal
Year 2010
Where IAT
Authors Melanie Smith, Roger Mailler
Comments (0)