In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classi ed as look-ahead schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-a...

Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unsolvability and is thus not suitable for tightly and overconstrained problems. We present a hybrid solving scheme where we combine a local search algorithm the breakout algorithm, with a systematic search algorithm backt...

Economic load dispatch (ELD) is a non-linear optimization problem for determining the power shared among the generating units to satisfy the generation limit constraints of each unit and minimizing the cost of power production. In this paper, we present a new hybrid algorithm by combing the standard backtracking search optimization algorithm (BSA) and the random wake with direction exploitation...

Distributed constraint optimization problem (DCOP) is an important area of study of multi-agents. Recently, a distributed search algorithm for DCOP is proposed. The algorithm enables asynchronous search based on blanch-and-bound and depth first tree. However, the algorithm has overhead of backtracking and re-exploration. In this paper, some effective methods which reduce overhead of former algo...

In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classiied as look-ahead schemes and look-back schemes. Unfortunately , look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-...

Effective methods to reduce number of message cycles of adopt algorithm which is a complete algorithm for distributed constraint optimization problems are proposed. The Adopt algorithm can perform branch and bound search asynchronously. However, it has overhead in backtracking and searches same partial solution repeatedly. To reduce overhead of backtracking, lower and upper bound of cost of par...