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

Example P1-parameter A Example P1-parameter G

(s) (j)

1 2 C i W i 1 2 3 4 5 6

(i) (s)

1 30 20 180 600 1 30 20 40 70 50 60

2 90 40 200 500 2 90 40 50 30 40 40

3 80 60 190 500 Zj 200 150 100 100 150 200

Example P2- parametr A Example P2-parametr G

(s)
(i)

(j)
(s)

1 2 3 4 5 C i W i 1 2 3 4 5 6

60
0

1 30 40 30 40 30 180 1 30 20 40 70 50 60

50
0

2 90 40 40 50 40 200 2 90 40 50 30 40 40

50
0

3 80 60 70 70 50 190 3 20 50 60 60 90 60

30
0

4 30 20 30 40 30 150 4 30 30 50 70 60 60

5 90 40 50 30 40 40

Zj 300 250 300 220 150 200

Table 6.a. Data for computational examples

Example 1 fc = 26 500 Example2 f c = 345400

i s X s j Y i s X s j Y

1 1 350 1 1 200 1 1 550 1 2 250

1 2 250 1 2 150 1 3 50 1 3 300

2 2 300 2 3 100 2 3 250 2 4 100

2 4 100 2 5 250 2 6 200

2 5 150 3 5 20 3 1 300

2 6 200 4 2 300 5 4 120

5 5 150

Table 6.b. Solutions for computational examples

Computational experiments were performed using the data from Table 6a. The
calculations are made for two examples (different number of distribution centers,
factories). Results were as follows: Example1 Cost = 26500, Example2 Cost = 345400. The