Sequential drug decision problems in long-term medical conditions: a case Study of Primary Hypertension Eunju Kim ba, ma, msc



Yüklə 10,52 Mb.
səhifə100/116
tarix04.01.2022
ölçüsü10,52 Mb.
#58520
1   ...   96   97   98   99   100   101   102   103   ...   116

7.5Genetic algorithm


Initial tests of GA were undertaken to determine the best setup of the number of generations and the population size. The population size in GA means the number of policies evaluated at the same time in each generation. A total of nine sets of experiments with different combinations of generations (25, 50 and 100) and population sizes (10, 30, 50 and 100) were implemented. In each generation, 90% of the fittest parents were assumed to remain in the future generation. The initial population was selected randomly. In the base-case, crossover rate was assumed to be 0.7, and mutation rate was 0.1. Each test was repeated 20 times to evaluate the percentage of the separate GA simulation runs to find the global optimum and the average penalty rate using Equation 7.1.

Table ‎7. summarises the computational results of the GA experiments. The evaluation of the objective function (each evaluation includes 100 Monte Carlo simulation replications) was repeated from a minimum 235 times to a maximum 2,730 times, compared to 4,128 times using enumeration. Overall computational time increased as the number of iterations increased. Population size had a greater impact on computational time. Average computation time was approximately 10.97 seconds per run. All GA experiments found the optimal solution or the statistically equivalent solutions. The potential reason that the point estimate of the total net benefits of the same policy numbers were slightly different is due to the noise from the random drug allocation after the use of fourth-line drug and for the patients who have a CVD or DM. Search rates increased as the number of iterations increased; however, the objective function value was not always increased proportionally to the increment in iterations or computational time. The maximum total net benefit was obtained when the number of generations was 100 and the size of population was 10. However, premature convergence may happen when the population size was small (i.e., 10) (see Table ‎7. and Figure ‎7.).



The performance of GA also depends on the crossover and mutation rates. The following eight combinations of crossover rates (0.7 and 0.8) and mutation rates (0.01, 0.05, 0.1 and 0.2) were implemented where the population size was 30 and the number of generation was 100. Table ‎7. and Table ‎7. shows that the decrease in the crossover and mutation rates has a potential risk of premature convergence due to a lack of population diversity. On the contrary, the trade-off between population diversity and the quality of solution may also exist, depending on the choice of the crossover and mutation rates, although this was not clear in this study.
Table ‎7.. Computational results by the number of generations and population size from GA




Generation number

Population size

Total iteration number1)

Time (h)

Time per iterations (s)

Solution number2)

Total net benefit of the solution (£)

Search rate (%)

1

25

10

235

0.68

10.42

625*

330,080

3.78

2

25

30

705

2.12

10.83

623*

330,110

10.05

3

25

50

1,175

3.56

11.18

624*

330,120

15.12

4

25

100

2,350

6.56

10.05

623*

330,120

25.53

5

50

10

460

1.44

11.28

623*

330,130

6.18

6

50

30

1,380

4.10

10.70

3721*

330,120

14.85

7

50

50

2,300

7.41

11.60

625*

330,140

18.65

8

100

10

910

2.88

11.39

623*

330,160

9.52

9

100

30

2,730

8.58

11.31

623*

330,130

21.75

1) Iteration number means the evaluation of the objective function including 100 Monte Carlo simulations.

2) The solution numbers with * are included in the top eight policies identified from the enumeration in Table ‎7..

3) Crossover rate was set to 0.7 and mutation rate was set to 0.1.

4) The base-case is in grey.


Table ‎7.. The average performance of GA from 20 repeated runs, depending on the generation number and the population size



 

G25xP10

G25xP30

G25xP50

G50xP10

G50xP30

G50xP50

G100xP10

G100xP30

1

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

2

0.00

1.01

0.00

0.00

0.00

0.00

0.00

0.00

3

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

4

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

5

3.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

6

0.00

1.02

0.00

0.00

0.00

0.00

0.00

0.00

7

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

8

1.21

0.00

0.00

0.00

0.00

0.00

0.00

0.00

9

0.79

0.00

0.00

0.00

0.00

0.00

0.00

0.00

10

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

11

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

12

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

13

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

14

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

15

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

16

2.15

0.00

0.00

0.03

0.00

0.00

0.00

0.00

17

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

18

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

19

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

20

0.00

0.02

0.00

0.00

0.00

0.00

0.00

0.00

Average penalty rate (%)

1.79

0.69

0.00

0.03

0.00

0.00

0.00

0.00

Probability to find the optima (%)

80.00

85.00

100.00

95.00

100.00

100.00

100.00

100.00

1) G represents the generation number and P represents the population size.


1) G represents the generation number and P represents the population size.
Figure ‎7.. Convergence of GA depending on the number of generation and population
Table ‎7.. Computational results by crossover and mutation rates from GA

 

Crossover rate

Mutation rate

Total iteration number1)

Computation time (h)

Time per iteration (s)

Solution number2)

Total net benefit of the solution (£)

Search rate (%)

1

0.7

0.01

2730

8.33

10.98

3711

329,950

4.23

2

0.7

0.05

2730

8.26

10.89

623*

330,150

9.45

3

0.7

0.10

2730

8.18

10.78

3721*

330,150

18.18

4

0.7

0.20

2730

8.54

11.26

623*

330,130

21.57

5

0.8

0.01

2730

7.98

10.53

3711

329,940

2.65

6

0.8

0.05

2730

7.99

10.53

623*

330,160

7.51

7

0.8

0.10

2730

8.04

10.60

623*

330,160

18.18

8

0.8

0.20

2730

8.74

11.53

625*

330,130

34.09

1) Iteration number means the evaluation of the objective function including 100 Monte Carlo simulations.

2) The solution numbers with * are included in the top eight policies identified from enumeration in Table ‎7..

3) The population size was set to 30 and the number of generation was set to 100.

4) The base-case is in grey.



Table ‎7.. The average performance of GA from 20 repeated runs, depending on the crossover rate and the mutation rate

 

C0.7xM0.01

C0.7xM0.05

C0.7xM0.10

C0.7xM0.20

C0.8xM0.01

C0.8xM0.05

C0.8xM0.10

C0.8xM0.20

1

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

2

2.98

0.00

0.00

0.00

0.00

0.00

0.00

0.00

3

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

4

0.00

0.00

0.00

0.00

0.04

0.00

0.00

0.00

5

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

6

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

7

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

8

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

9

4.51

0.00

0.00

0.00

0.00

0.00

0.00

0.00

10

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

11

0.42

0.00

0.00

0.00

0.00

0.00

0.00

0.00

12

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

13

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

14

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

15

0.75

0.00

0.00

0.00

0.00

0.00

0.00

0.00

16

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

17

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

18

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

19

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

20

0.00

0.00

0.00

0.00

0.00

0.00

0.00

0.00

Average penalty rate (%)

2.17

0.00

0.00

0.00

0.04

0.00

0.00

0.00

Probability to find the optima (%)

80.00

100.00

100.00

100.00

95.00

100.00

100.00

100.00

1) C represents the cooling rate and M represents the mutation rate.


























1) X-axis represents the policy numbers; Y-axis represents the frequency of evaluation; C represents the cooling rate; and M represents the mutation rate.

Figure ‎7.. Search rate of GA depending on the crossover and mutation rates



Yüklə 10,52 Mb.

Dostları ilə paylaş:
1   ...   96   97   98   99   100   101   102   103   ...   116




Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©muhaz.org 2024
rəhbərliyinə müraciət

gir | qeydiyyatdan keç
    Ana səhifə


yükləyin