This paper introduces a new variant of the Backtracking Search Optimization Algorithm (BSA) in order to improve the quality of the solutions found by the algorithm. The proposed algorithm is called Idol-Guided Backtracking Search Optimization Algorithm (IG-BSA): it uses the historical population defined in BSA to build and update a set of idols taken from several previous generations, and the c...

In this paper we consider the K-d tree-based backtracking search algorithm and study its performance in the context of vector quantization encoding of speech waveform. We discuss the basic algorithm in detail and highlight the features of optimization as observed from theoretical analysis and from the empirical performance of the backtracking search. It is seen that, despite the 2K dependence o...

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...

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...