Loading...
Please wait, while we are loading the content...
Similar Documents
Solving the Car Sequencing Problem in Constraint Logic Programming (1988)
| Content Provider | CiteSeerX |
|---|---|
| Author | Dincbas, M. Simonis, H. Hentenryck, P. Van |
| Description | 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 the car-sequencing problem which occurs in assembly line scheduling in car manufacturing. This problem is highly combinatorial and has been presented recently as a "challenge " lor Artificial Intelligence (Al) systems. We presenthe approach taken to solve this problem in CHIP and give some computational results for different configurations. lt is shown that CHIP provides not only the flexibilitywhich can be expected from an Altoolby simplitying greatly the problem statement but also the efficiency which allows to solve large assembly line problems. This efficiency comes lrom the ability of CHIP to use numerical and symboliconstraints to prune the search space very early. 2 1. |
| File Format | |
| Language | English |
| Publisher Date | 1988-01-01 |
| Publisher Institution | In European Conference on Artificial Intelligence (ECAI-88 |
| Access Restriction | Open |
| Subject Keyword | New Constraint Logic Declarative Aspect Different Configuration Problem Statement Artificial Intelligence Logic Programming Present Paper Constraint Logic Programming Computational Result Line Problem Search Space Car Sequencing Problem Constraint Manipulation Technique Car-sequencing Problem Car Manufacturing |
| Content Type | Text |
| Resource Type | Article |
