Solving DisCSPs with penalty driven search
Muhammed Basharu, Inés Arana, Hatem Ahriz · Open Access Institutional Repository at Robert Gordon University (Robert Gordon University) · 2005
We introduce the Distributed, Penalty-driven Local search algorithm (DisPeL) for solving Distributed Constraint Satisfaction Problems. DisPeL is a novel distributed iterative improvement algorithm which escapes local optima by the use of both temporary and incremental penalties and a tabu-like no-good store. We justify the use of these features and provide empirical results which demonstrate the competitiveness of the algorithm.