A logic language for combinatorial optimization

A logic language for combinatorial optimization

0.00 Avg rating0 Votes
Article ID: iaor1990235
Country: Switzerland
Volume: 21
Start Page Number: 247
End Page Number: 273
Publication Date: Nov 1989
Journal: Annals of Operations Research
Authors:
Abstract:

CHIP (Constraint Handling In Prolog) is a new logic programming language combining the declarative aspect of logic programming for stating search problems with the efficiency of constraint handling techniques for solving them. CHIP has been applied to many real-life problems in Operations Research and hardware design with an efficiency comparable to specific programs written in procedural languages. The main advantage of CHIP is the short development time of the programs and their great modifiability and extensibility. This paper discusses the application of the finite domain part of CHIP to the solving of discrete combinatorial problems occurring in Operations Research. The basic mechanisms underlying CHIP are explained through simple examples. Solutions in CHIP of several real-life problems (e.g., cutting stock, warehouses location problems) are presented and compared with usual approaches, showing the versatility and the interest of the approach.

Reviews

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