Hybrid search for minimal perturbation in Dynamic CSPs

  • Authors:

  • Roie Zivan;Alon Grubshtein;Amnon Meisels

  • Affiliations:

  • Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105

  • Venue:
  • Constraints
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is often the case that after a scheduling problem has been solved some small changes occur that make the solution of the original problem not valid. Solving the new problem from scratch can result in a schedule that is very different from the original schedule. In applications such as a university course timetable or flight scheduling, one would be interested in a solution that requires minimal changes for the users. The present paper considers the minimal perturbation problem. It is motivated by scenarios in which a Constraint Satisfaction Problem (CSP) is subject to changes. In particular, the case where some of the constraints are changed after a solution was obtained. The goal is to find a solution to the changed problem that is as similar as possible (e.g. includes minimal perturbations) to the previous solution. Previous studies proposed a formal model for this problem (Barták et al. 2004), a best first search algorithm (Ross et al. 2000), complexity bounds (Hebrard et al. 2005), and branch and bound based algorithms (Barták et al. 2004; Hebrard et al. 2005). The present paper proposes a new approach for solving the minimal perturbation problem. The proposed method interleaves constraint optimization and constraint satisfaction techniques. Our experimental results demonstrate the advantage of the proposed algorithm over former algorithms. Experiments were performed both on random CSPs and on random instances of the Meeting Scheduling Problem.