Efficient interval partitioning—Local search collaboration for constraint satisfaction

In this article, a cooperative solution methodology that integrates interval partitioning ( IP) algorithms with a local search, feasible sequential quadratic programming ( FSQP), is presented as a technique to enhance the solving of continuous constraint satisfaction problems (continuous CSP). FSQP...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research Vol. 35; no. 5; pp. 1412 - 1435
Main Authors: Pedamallu, Chandra Sekhar, Ozdamar, Linet, Ceberio, Martine
Format: Journal Article
Language:English
Published: New York Elsevier Ltd 01.05.2008
Pergamon Press Inc
Subjects:
Algorithms
Collaboration
Comparative analysis
Cooperative local search
Efficiency
Feasible sequential quadratic programming
Interval partitioning algorithms
Quadratic programming
Studies
Subdivision direction selection
Tree management
Cooperative local search
Feasible sequential quadratic programming
Interval partitioning algorithms
Tree management
Subdivision direction selection
ISSN:0305-0548, 1873-765X, 0305-0548
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, a cooperative solution methodology that integrates interval partitioning ( IP) algorithms with a local search, feasible sequential quadratic programming ( FSQP), is presented as a technique to enhance the solving of continuous constraint satisfaction problems (continuous CSP). FSQP is invoked using a special search tree management system developed to increase search efficiency in finding feasible solutions. In this framework, we introduce a new symbolic method for selecting the subdivision directions that targets immediate reduction of the uncertainty related to constraint infeasibility in child boxes. This subdivision method is compared against two previously established partitioning rules (also parallelized in a similar manner) used in the interval literature and shown to improve the efficiency of IP. Further, the proposed tree management system is compared with tree management approaches that are classically used in IP. The whole method is compared with published results of established symbolic-numeric methods for solving CSP on a number of state-of-the-art benchmarks.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2006.08.003