PACKING PROBLEM

Find a trade-off between the weight and value of boxes in a backpack that can carry at most 15kg.

Box 1
Box 2
Box 3
Box 4
Box 5

Count

Weight

Value

0
1
0
1
0

1 Kg
2 Kg
5 Kg
7 Kg
12 Kg

$1
$4
$10
$15
$30

0 Kg
2 Kg
0 Kg
7 Kg
0 Kg

$0
$4
$0
$15
$0

Totals:

9 Kg

19.00

Weight limit:

15 Kg

Infeasibility:

Decision variables (number of

boxes of a particular type in the
backapack)

After the optimisation finishes press the

Sub-Weight Sub-Value

Objectives (Total weight of all

items and their value)

button to view the set of non-dominated (Pareto optimal) solutions.

n-dominated (Pareto optimal) solutions.

RESULTS 15. 11. 2009 12:35:08

Population:
20
Run:
0
Generation:
50
Random Seed:
1
Randomize Count:
9603
ID

G0
14141
14319
14328
14232
14350
14501
14633
14244
15122
15137
14212
14368
14338
14284
15131
14262
15128
14243
14448
14264

G1
0
1
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
1
0
1

G2
0
0
1
1
2
0
3
0
0
0
0
1
0
2
2
0
0
0
1
1

G3
0
0
0
0
0
1
0
0
0
0
0
0
2
0
0
0
0
0
0
0

G4
0
0
0
0
0
0
0
1
1
1
1
1
0
1
1
0
0
0
0
0

Weight
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
1
1
1
1

Value
0
1
2
3
4
5
6
7
7
7
8
9
10
11
11
12
12
13
14
15

0
1
4
5
8
10
12
15
15
15
16
19
20
23
23
30
30
31
34
35

Infeasibility
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

Age

Rank
50
43
42
47
41
33
27
46
2
2
48
40
42
44
2
45
2
46
36
45

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

Distance
1E+18
0.102564
0.102564
0.102564
0.115385
0.102564
0.115385
0.102564
0
0
0.102564
0.102564
0.102564
0.179487
0
0.153846
0
0.102564
0.102564
1E+18