The Declarative Framework Approach to Decision Support for Constrained Search Problems - Efficient Decision Support Systems: Practice and Challenges from Current to Future - page 173

[[Xp711,Xp712],[Xp721,Xp722],[Xp731,Xp732],[Xp741,Xp742],[Xp751,Xp752]],
[[Xp811,Xp812],[Xp821,Xp822],[Xp831,Xp832],[Xp841,Xp842],[Xp851,Xp852]]
],
Xopr=[[[Xp111,Xp211,Xp311,Xp411,Xp511,Xp611,Xp711,Xp811],
[Xp121,Xp221,Xp321,Xp421,Xp521,Xp621,Xp721,Xp821],
[Xp131,Xp231,Xp331,Xp431,Xp531,Xp631,Xp731,Xp831],
[Xp141,Xp241,Xp341,Xp441,Xp541,Xp641,Xp741,Xp841],
[Xp151,Xp251,Xp351,Xp451,Xp551,Xp651,Xp751,Xp851]],
[[Xp112,Xp212,Xp312,Xp412,Xp512,Xp612,Xp712,Xp812],
[Xp122,Xp222,Xp322,Xp422,Xp522,Xp622,Xp722,Xp822],
[Xp132,Xp232,Xp332,Xp432,Xp532,Xp632,Xp732,Xp832],
[Xp142,Xp242,Xp342,Xp442,Xp542,Xp642,Xp742,Xp842],
[Xp152,Xp252,Xp352,Xp452,Xp552,Xp652,Xp752,Xp852]]],
(foreach(X1,X), foreach(Z1, Z) do (foreach(X11,X1), param(Z1) do
(foreach(X111,X11), param(Z1) do X111 #<= Z1, X111 #>= 0 ) ) ),
Y=[[Yp11,Yp12],[Yp21,Yp22],[Yp31,Yp32],[Yp41,Yp42],[Yp51,Yp52]],
Yopr=[[Yp11,Yp21,Yp31,Yp41,Yp51],[Yp12,Yp22,Yp32,Yp42,Yp52]],
(foreach(U1,U), foreach(Y1,Yopr) do (foreach(Y2,Y1), param(U1) do
Y2 #>= 0, Y2 #<= U1 ) ),
flatten(Y,Ypo), flatten(C,Cpo),
(foreach(C1,Cpo),foreach(Y1,Ypo),foreach(Fy1,Fun_y) do Fy1 #=C1 * Y1 ),
flatten(X,Xpo),
(foreach(B1,B),foreach(X1,Xpo),foreach(Fx1,Fun_x) do Fx1 #=B1 * X1),
sumlist(Fun_y,Razem1), sumlist(Fun_x,Razem2), Razem #= Razem1+Razem2
Fig. 5.a. The MIP model (input data) for the problem of allocation of pallets- automatically
generated (Eclipse-CLP).
:- module(funkcje).
:- use_module(dane).
:- lib(fd).
:- lib(fd_global).
:- lib(fd_search).
:- lib(edge_finder3).
:- lib(branch_and_bound).
:- lib(probing_for_scheduling).
:- local struct(zadanie(start,czas,wymaga,ludzie)).
:- local struct(nazwa(napis)).
:- export
opc/0
.
og_d1(X,D,Z):-
(foreach(X1,X), foreach(D1,D), foreach(Z1,Z) do
(foreach(X2,X1), foreach(D2,D1), param(Z1) do
(foreach(X3,X2), param(D2), param(Z1) do X3 #<= D2*Z1 ) ) ).
og_1(X,Z):-
(foreach(X1,X), foreach(Z1,Z) do flatten(X1,X2), sumlist(X2,Z1) ).
og_2(K,U,Xopr):-
(foreach(K1,K), foreach(U1,U), foreach(X1,Xopr) do
flatten(X1,X2), sumlist(X2,X3), X3 #<= U1*K1 ).
og_3(U,Yopr):-
(foreach(U1,U),foreach(Y1,Yopr) do sumlist(Y1,Y2), Y2 #<=U1 ).
ogr_4(Xopr,K,Yopr):-
(foreach(K1,K), foreach(Y1,Yopr), foreach(X1,Xopr) do
(foreach(Y2,Y1), param(K1), foreach(X2,X1) do