Figure - uploaded by Francisco Martínez-Álvarez
Content may be subject to copyright.
Source publication
A novel bioinspired metaheuristic is proposed in this work, simulating how the Coronavirus spreads and infects healthy people. From an initial individual (the patient zero), the coronavirus infects new patients at known rates, creating new populations of infected people. Every individual can either die or infect and, afterwards, be sent to the reco...
Contexts in source publication
Context 1
... conduct this experimentation, a simple binary codification has been used. The Tables 1-5 summarize the results achieved for each of these lengths, respectively. Every experiment has been launched 50 times, determining that, on average, the optimum value was found for 11, 12, 14, 15 and 17 iterations, respectively. ...Context 2
... a small space as 2 1 0 = 1024 possible values, the optimum value is reached after exploring 15.6250% valid solutions. However, this value acutely decreases as the search space increases. The opposite case is reached for 2 5 0 = 1.1259E + 15 possible values, where the optimum value was reached after exploring just 0.00000002% of valid solutions. Table 2: Sample execution for a 20-bit binary codification. Iteration Deaths Recovered Infected Fitness 1 0 1 10 5.73E+11 2 1 11 14 3.92E+11 3 2 25 16 3.14E+11 4 2 41 24 1.33E+09 5 4 63 36 1.37E+07 6 5 98 56 2.76E+06 7 8 153 72 1.32E+06 8 12 222 112 1.61E+04 9 17 330 172 1 10 26 499 249 1 11 38 738 389 1 12 58 1112 567 0 number of new people increase until a given iteration in which it starts to decrease. Note that data shown in the figure are sampled every 5 ...Context 3
... conduct this experimentation, a simple binary codification has been used. The Tables 1-5 summarize the results achieved for each of these lengths, respectively. Every experiment has been launched 50 times, determining that, on average, the optimum value was found for 11, 12, 14, 15 and 17 iterations, respectively. ...Context 4
... a small space as 2 1 0 = 1024 possible values, the optimum value is reached after exploring 15.6250% valid solutions. However, this value acutely decreases as the search space increases. The opposite case is reached for 2 5 0 = 1.1259E + 15 possible values, where the optimum value was reached after exploring just 0.00000002% of valid solutions. Table 2: Sample execution for a 20-bit binary codification. Iteration Deaths Recovered Infected Fitness 1 0 1 10 5.73E+11 2 1 11 14 3.92E+11 3 2 25 16 3.14E+11 4 2 41 24 1.33E+09 5 4 63 36 1.37E+07 6 5 98 56 2.76E+06 7 8 153 72 1.32E+06 8 12 222 112 1.61E+04 9 17 330 172 1 10 26 499 249 1 11 38 738 389 1 12 58 1112 567 0 number of new people increase until a given iteration in which it starts to decrease. Note that data shown in the figure are sampled every 5 ...Similar publications
A newly arrived problem which is call the travelling disinfection-man problem (TDP) in network is defined for a disinfection group who want to settle on the foremost effective route for disinfection of several candidate places. The group begins from a predetermined position and next wants to go to each infected place exactly once within the day wor...
A newly arrived problem which is call the travelling disinfection-man problem (TDP) in network is defined for a disinfection group who want to settle on the foremost effective route for disinfection of several candidate places. The group begins from a predetermined position and next wants to go to each infected place exactly once within the day wor...
