scholarly journals Constraint Logic Programming and Integer Programming approaches and their collaboration in solving an assignment scheduling problem

Constraints ◽  
1997 ◽  
Vol 1 (3) ◽  
pp. 245-264 ◽  
Author(s):  
Ken Darby-Dowman ◽  
James Little ◽  
Gautam Mitra ◽  
Marco Zaffalon
2015 ◽  
Vol 25 (3) ◽  
pp. 367-375
Author(s):  
Michał Mazur ◽  
Antoni Niederliński

Abstract A Constraint Logic Programming (CLP) tool for solving the problem discussed in Part 1 of the paper has been designed. It is outlined and discussed in the paper. The program has been used for solving a real-world car assembly scheduling problem.


2014 ◽  
Vol 5 (3) ◽  
pp. 7-22 ◽  
Author(s):  
Pawel Sitek ◽  
Jaroslaw Wikarek

AbstractThe paper presents a concept and the outline of the implementation of a hybrid approach to modelling and solving constrained problems. Two environments of mathematical programming (in particular, integer programming) and declarative programming (in particular, constraint logic programming) were integrated. The strengths of integer programming and constraint logic programming, in which constraints are treated in a different way and different methods are implemented, were combined to use the strengths of both. The hybrid method is not worse than either of its components used independently. The proposed approach is particularly important for the decision models with an objective function and many discrete decision variables added up in multiple constraints. To validate the proposed approach, two illustrative examples are presented and solved. The first example is the authors’ original model of cost optimisation in the supply chain with multimodal transportation. The second one is the two-echelon variant of the well-known capacitated vehicle routing problem.


Sign in / Sign up

Export Citation Format

Share Document