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

Authors:
M. Dincbas;H. Simonis;P. Van Hentenryck
Affiliations:
Cosytec S.A. 4 rue Jean Rostand, 91893 Orsay, France;Cosytec S.A. 4 rue Jean Rostand, 91893 Orsay, France;Brown University Providence, Rhode Island, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1992

Citing 5
Cited 0

The art of Prolog: advanced programming techniques

The art of Prolog: advanced programming techniques
Opening the Prolog III universe

BYTE
Embedding boolean expressions into logic programming

Journal of Symbolic Computation
Applications of CHIP to industrial and engineering problems

IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
Constraint satisfaction in logic programming

Constraint satisfaction in logic programming

Quantified Score

Hi-index	0.98

Visualization

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, we 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. We 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.