Improved Local Search for CP Toolkits

Paul Shaw (), Bruno De Backer () and Vincent Furnon ()

Annals of Operations Research, 2002, vol. 115, issue 1, 50 pages

Abstract: Constraint programming and local search are two well known optimization technologies. In recent years, methods for combining these two technologies have been put forward, one of which advocates the use of constraint programming for searching the local neighborhood of the current solution. We present a search technique which improves on the performance of this constraint programming-based local search method and perform experiments on a variety of both simple and more complex combinatorial problems. We also demonstrate the benefit of combining local and complete search methods. Copyright Kluwer Academic Publishers 2002

Keywords: local search; constraint progamming; hybrid methods (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1021188818613 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:115:y:2002:i:1:p:31-50:10.1023/a:1021188818613

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1021188818613

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().