Академический Документы
Профессиональный Документы
Культура Документы
CHAPTER 8
FIREFLY ALGORITHM
8.1 INTRODUCTION
(a) Distance:
The distance between any two fireflies i and j at positions xi and xj,
respectively, can be defined as a Cartesian or Euclidean distance (rij) using
equation (8.2), where xi,k is the kth component of the spatial coordinate xi of the
ith firefly and d is the number of dimensions.
rij = i - xj = ( , , ) (8.2)
108
(b) Attractiveness:
m
(r) 0 × exp (- ), with m 1 (8.3)
(c) Movement:
2
xi = xi + 0 × exp (- ij ) × (xj – xi - ) (8.4)
Where the first term is the current position of a firefly, the second
term is used for considering a firefly’s attractiveness to light intensity seen by
adjacent fireflies, and the third term is used for the random movement of a
firefly in case there are not any brighter ones.
Evaluate makespan
End For
End For
End While
Rank and choose the best job sequences and Sub lot sizes
Start
Yes
Is there is any
good location?
No
Location
found Go to that location
Stop
m
(r) = 0 × exp (- ), with m 1 ; (here, 0=1, = 1, m = 1)
2
xi = xi + 0 × exp (- ij ) × (xj – xi - ); (here, 0.3, rand = 0.2)
m
(r) = 0 × exp (- ), with m 1 ; (here, 0=1, = 1, m = 1)
2
xi = xi + 0 × exp (- ij ) × (xj – xi - ); (here, 0.3, rand = 0.2)
m
(r) = 0 × exp (- ), with m 1 ; (here, 0=1, = 1, m = 1)
2
xi = xi + 0 × exp (- ij ) × (xj – xi - ); (here, 0.3, rand = 0.2)
m
(r) 0 × exp (- ), with m 1 ; (here, 0=1, = 1, m = 1)
2
xi = xi + 0 × exp (- ij ) × (xj – xi - ) ; (here, 0.3, rand = 0.2)
Sequence
Seed Distance Attractiveness Movement
for next makespan
Sequence (rij) r) (xi)
generation
23514 0.6 0.55 0.9986 23514 48
32514 0.7 0.497 1.6388 32514 48
24351 0.4 0.6703 0.4692 24351 45
15234 1.2 0.3012 2.2943 12534 45*
The method to find total flow time is illustrated in this section. The
final result is 2-5-4-1-3 and the corresponding total flow time is 144. It is
shown in Figure 8.2.Total flow time calculation for the sequence 2-5-4-1-3 =
14+22+27+35+46 = 144. The following Figure 8.2 shows the time schedule
of the optimal solution.
The following fig. shows the time schedule of the optimal solution.
114
Figure 8.2 Schedule for the sequence 2-5-4-1-3 in FA (total flow time
objective for equal sub lots)
Movement Sequence
Seed Distance Attractiveness
(xi) for next makespan Sub lot size
Sequence (rij) r)
generation
The method to find total flow time is illustrated in this section. The
final result is 3-1-4-5-2 and the corresponding total flow time is 299, sub lot
size is {453}{64}{2133}{231}{2132}. Total flow time calculation for the
sequence 3-1-4-5-2 = 22+44+64+79+90 = 299. The following Figure 8.3
shows the time schedule of the optimal solution.
Figure 8.3 Schedule for the sequence 3-1-4-5-2 in FA (Total Flow Time
objective for variable sub lots)
116
The makespan results of FA algorithm for equal sub lots (Table 8.3 -
Table 8.6) and for variable sub lots (Table 8.10 - Table 8.12) is given in this
section.
The total flow time results of FA algorithm for equal sub lots
(Table 8.7 - Table 8.9) and for variable sub lots (Table 8.13 - Table 8.15) is
given in this section.
o Nt es mel bor P .
118
Table 8.4 Makespan value for three – machine cases in FA (equal sub
lots)
Makespan
Problem set
Number of jobs
number
5 10 15 20 25 30
1 160 380 410 570 632 794
2 168 388 412 568 648 688
3 154 378 408 564 642 620
4 164 384 412 570 640 618
Table 8.5 Makespan value for five – machine cases in FA (equal sub
lots)
Makespan
Problem set
Number of jobs
number
5 10 15 20 25 30
1 180 382 410 650 700 842
2 188 388 428 670 698 744
3 180 380 420 668 700 622
4 174 378 415 664 702 674
Table 8.6 Makespan value for seven – machine cases in FA (equal sub
lots)
Makespan
Problem set
Number of jobs
number
5 10 15 20 25 30
1 200 202 460 590 709 854
2 202 204 504 600 708 745
3 198 208 508 608 714 698
4 200 198 498 594 722 676
119
Table 8.7 Total flow time value for three – machine cases in FA (equal
sub lots)
Table 8.8 Total flow time value for five – machine cases in FA (equal
sub lots)
Table 8.9 Total flow time value for seven – machine cases in FA (equal
sub lots)
Makespan
Problem set
Number of jobs
number
5 10 15 20 25 30
1 608 708 818 918 1007 1017
2 1025 3276 3512 4012 4098 4909
3 1002 3289 3398 3998 4078 4989
4 975 3298 3494 3889 4099 5004
Table 8.11 Makespan value for five – machine cases in FA (variable sub
lots)
Makespan
Problem set
Number of jobs
number
5 10 15 20 25 30
1 704 829 1121 1305 1508 1699
2 3475 4004 4712 7178 7812 8287
3 4004 4098 5008 7004 7409 8256
4 4012 4095 5012 7314 7676 8102
Makespan
Problem set
Number of jobs
number
5 10 15 20 25 30
1 790 1009 1212 1321 1908 1878
2 4134 4927 6334 7298 9823 9989
3 4212 4909 6289 7389 10245 9993
4 4018 4927 6209 7042 10432 9945
121
Table 8.13 Total flow time value for three – machine cases in FA
(variable sub lots)
Table 8.14 Total flow time value for five – machine cases in FA
(variable sub lots)
Table 8.15 Total flow time value for seven – machine cases in FA
(variable sub lots)
8.8 SUMMARY