Solving a cutting-stock problem with the constraint logic programming language CHIP

Solving a cutting-stock problem with the constraint logic programming language CHIP

0.00 Avg rating0 Votes
Article ID: iaor19932249
Country: United Kingdom
Volume: 16
Start Page Number: 95
End Page Number: 105
Publication Date: Jul 1992
Journal: Mathematical and Computer Modelling
Authors: ,
Keywords: computational analysis, combinatorial analysis
Abstract:

CHIP is a new constraint logic programming language combining the declarative aspect of logic programming with the efficiency of constraint manipulation techniques. In the present paper, the authors show an application of CHIP to a two-dimensional cutting stock problem. This problem is highly combinatorial and is generally solved by specific programs written in procedural languages. The authors present two approaches to solve this problem in CHIP and compare them with the standard ones. It turns out that, although CHIP greatly simplifies the problem statement, it is comparable in efficiency to specialized programs. Of particular interest is the ability to use symbolic constraints to prune the search space.

Reviews

Required fields are marked *. Your email address will not be published.