Information Technology Reference
In-Depth Information
Ta b l e 3 . 2 .
Table of solutions
Solution
1
2
3
4
5
1
1
2
3
4
5
2
2
1
4
3
5
3
4
5
3
1
2
4
3
1
4
5
2
5
4
2
5
3
1
6
5
4
3
2
1
7
3
5
4
1
2
8
1
2
3
5
4
9
2
5
1
4
3
10
5
3
1
2
4
Ta b l e 3 . 3 .
Table of initial population with fitness
Fitness
Population
32
1
2
3
4
5
31
2
1
4
3
5
33
4
5
3
1
2
35
3
1
4
5
2
34
4
2
5
3
1
31
5
4
3
2
1
33
3
5
4
1
2
32
1
2
3
5
4
32
2
5
1
4
3
31
5
3
1
2
4
As presented, this is a 5 job - 4 machine problem.
This example follows the schematic presented in Fig 3.10.
Initially the operating parameters are outlined:
NP
=10
D
=5
G
max
=1
For the case of illustration, the operating parameter of
NP
and
G
max
are kept at a
minimum. The other parameters
x
(
lo
)
,
x
(
hi
)
and
D
are problem dependent.
Step (1) initialises the population to the required number of solutions.
Since
NP
is initialised to 10, only 10 permutative solutions are generated. Table 3.2
gives the solution index which represents the positions of each value in the solution in
the leading row.
The next procedure is to calculate the objective function of each solution in the pop-
ulation. The time flow matrix for each solution is presented. For detailed explanation
on the construction of the time flow matrix, please see Section 3.6.1.
Search WWH ::
Custom Search