论文信息 - Distributed Guided Local Search for Solving Binary DisCSPs

Distributed Guided Local Search for Solving Binary DisCSPs

We introduce the Distributed Guided Local Search (Dist- GLS) algorithm for solving Distributed Constraint Satisfaction Problems. Our algorithm is based on the centralised Guided Local Search algorithm, which is extended with additional heuristics in order to enhance its efficiency in distributed scenarios. We discuss the strategies we use for dealing with local optima in the search for solutions and compare performance of Dist-GLS with that of Distributed Breakout (DBA). In addition, we provide the results of our experiments with distributed versions of random binary constraint satisfaction and graph colouring problems.

Muhammed Basharu | Inés Arana | Hatem Ahriz

[1] Weixiong Zhang,et al. Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

[2] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[3] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..

[4] Youssef Hamadi. Interleaved Backtracking in Distributed Constraint Networks , 2002, Int. J. Artif. Intell. Tools.

[5] Stephen Fitzpatrick,et al. Experiments on Dense Graphs with a Stochastic, Peer-to-Peer Colorer , 2002 .

[6] Makoto Yokoo,et al. Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[7] M. Yokoo,et al. Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems , 1996 .

[8] Makoto Yokoo,et al. Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[9] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..

[10] E. Palmer. Graphical evolution: an introduction to the theory of random graphs , 1985 .