Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems

  • Authors:
  • Marie-José Huguet;Pierre Lopez;Wafa Karoui

  • Affiliations:
  • CNRS, LAAS, Toulouse Cedex 4, France 31077 and Université de Toulouse, UPS, INSA, INP, ISAE, UT1, UTM, LAAS, Toulouse, France 31077;CNRS, LAAS, Toulouse Cedex 4, France 31077 and Université de Toulouse, UPS, INSA, INP, ISAE, UT1, UTM, LAAS, Toulouse, France 31077;CNRS, LAAS, Toulouse Cedex 4, France 31077 and Université de Toulouse, UPS, INSA, INP, ISAE, UT1, UTM, LAAS, Toulouse, France 31077

  • Venue:
  • Journal of Mathematical Modelling and Algorithms
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose mechanisms to improve instantiation heuristics by incorporating weighted factors on variables. The proposed weight-based heuristics are evaluated on several tree search methods such as chronological backtracking and discrepancy-based search for both constraint satisfaction and optimization problems. Experiments are carried out on random constraint satisfaction problems, car sequencing problems, and jobshop scheduling with time-lags, considering various parameter settings and variants of the methods.The results show that weighting mechanisms reduce the tree size and then speed up the solving time, especially for the discrepancy-based search method.