Question: Section 3 Answer questions 15-24 based on the above described maintenance scheduling problem Based on the example given in the lecture, it is desired to


Section 3 Answer questions 15-24 based on the above described maintenance scheduling problem Based on the example given in the lecture, it is desired to schedule the maintenance of 7 power generation plants in 4 equal intervals such that the maximum net energy reserve is obtained in any maintenance interval. The table below show the capacity and number of intervals needed to maintain each plant. Unit capacity. Number of intervals required for unit maintenance number M 2 3 4 20 IS 35 40 15 15 10 The problem constraints are: The maximum loads expected during four intervals are 80, 90, 65 and 70 MW; respectively. Maintenance of any unit starts at the beginning of an interval and finishes at the end of the same or adjacent interval. The maintenance cannot be aborted or finished earlier than scheduled The net reserve is the fitness function and must be greater or equal to zero at any interval Assume that the crossover probability pc equals 0.7, the mutation probability pm equals 0.01, and the initial population N=4 and as shown below. Chromosome 1 0110 0011 0001 1000 0100 0010 1000 Chromosome 2 0110 0011 0001 1000 0100 0010 0100 Chromosome 3 0110 0011 0001 1000 0100 0010 0010 Chromosome 4 0110 0011 0001 1000 0100 0010 0001 Figure 4: Scheduling maintenance problem 23 based on the system in figure 4 and the performance graph shown in figure 5, what is the fitness of the chromosome that is obtained at end of the run (at generation 100)? * (1 Point) 20 27.5 30 O 25 None of listed options 24 Assume that after certain generations you are not satisfied with the fitness of the final generation, which of the below you may do in order to improve the performance * (1 Point) None of listed options Decrease number of generations Change Pc to be 0.001 Change Pm to be 0.7 Decrease initial population
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
