Skip to main content
Article thumbnail
Location of Repository

Consistent Neighbourhood in a Tabu Search, chapter 17

By A. Dupont, M. Vasquez and D. Habet


Abstract: We present a general approach for solving Constraint Optimization Problems. A Tabu Search is performed on a well-designed Consistent Neighbourhood built using Constraint Programming. After each variable assignment, the conflicting variables are deleted to maintain the consistency of the instantiated constraints. Hence, instead of allowing infeasible moves on complete configurations, it works on partial and consistent ones until a solution is found. This approach is successfully applied in solving real-life problems. Two ones are presented: the Frequency Assignment Problem with Polarization an

Year: 2005
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.