Analysis to implementation


PART 1:
f(ch) = (x0 + x1) − (x2 + x3) + (x4 + x5 ) − (x6 + x7)
This problem is a maximisation problem.
In this scenario we initially have a population of four chromosomes as shown below:
  • ch1 = (6, 5, 4, 1, 3, 5, 3, 2)
  • ch2 = (8, 7, 1, 2, 6, 6, 0, 1)
  • ch3 = (2, 3, 9, 2, 1, 2, 8, 5)
  • ch4 = (4, 1, 8, 5, 2, 0, 9, 4)
// fitness calculations
Ch1 = f(ch) = ( 6 + 5 ) - (4 + 1 ) + ( 3 + 5 ) - ( 3 + 2 ) = 9
Ch2 = f(ch) = ( 8 + 7 ) - (1 + 2 ) + (6 + 6 ) - (0 + 1 ) = 23
Ch3 = f(ch) = ( 2 + 3 ) - (9 + 2 ) + (1 + 2 ) - (8 + 5 ) = -16
Ch4 = f(ch) = ( 4 + 1 ) - (8 + 5 ) + (2 + 0 ) - (9 + 4 ) = -19
Sort:

  • Ch2 ( 23 )
  • Ch1 ( 9 )
  • Ch3 ( - 16 )
  • Ch4 ( - 19 )


1 )

  • child1 = ( 6, 5, 4, 1 |  6, 6, 0, 1 )  
  • child2 = ( 8, 7, 1, 2 | 3, 5, 3, 2 )  

2 )
Ch1 = (6, 5, 4, 1, 3, 5, 3, 2)
  • child1 = ( 6, 5, 9, 2, 1, 2, 3, 2  )
Ch3 = ( 2, 3, 9, 2, 1, 2, 8, 5)
  • child2 =  ( 2, 3, 4, 1, 3, 5, 8, 5 )

3 )
Ch1 = (8, 7, 1, 2, 6, 6, 0, 1)
  • child1 = (8, 7, 9, 2, 6, 6, 0, 5)
Ch3 = (2, 3, 9, 2, 1, 2, 8, 5)
  • child2  = (2, 3, 1, 2, 1, 2, 8, 1)

PART 3, Fitnesses of newly generated offspring:

  • child1 = ( 6, 5, 4, 1 ,  6, 6, 0, 1 )  =  (6 + 5 ) - (4 + 1 ) + ( 6 + 6 ) - ( 0 + 1 ) = 17
  • child2 = (8, 7, 1, 2 , 3, 5, 3, 2)  =  (8 + 7 ) - (1 + 2 ) + ( 3+ 5 ) - ( 3 + 2 ) = 15
  • child3 = ( 6, 5, 9, 2, 1, 2, 3, 2  )  =  (6 + 5 ) - (9 + 2 ) + ( 1 + 2 ) - ( 3 + 2 ) =  -2
  • child4 = (2, 3, 4, 1, 3, 5, 8, 5)  =  (2 + 3 ) - (4 + 1 ) + ( 3 + 5 ) - ( 8 + 5 ) = -5
  • child5 = (8, 7, 9, 2, 6, 6, 0, 5)  =  (8 + 7 ) - (9 + 2 ) + ( 6 + 6 ) - ( 0 + 5 ) = 11
  • child6= (2, 3, 1, 2, 1, 2, 8, 1)  =  (2 + 3 ) - (1 + 2 ) + ( 1 + 2 ) - ( 8 + 1 ) = -4


PART 4:
(9 + 9) − (0 + 0) + (9 + 9 ) − (0 + 0) = 36
[ 9, 9, 0, 0, 9, 9, 0, 0 ]

PART 5

  • ch1 = (6, 5, 4, 1, 3, 5, 3, 2)
  • ch2 = (8, 7, 1, 2, 6, 6, 0, 1)
  • ch3 = (2, 3, 9, 2, 1, 2, 8, 5)
  • ch4 = (4, 1, 8, 5, 2, 0, 9, 4)
  • ch5 = (9, 9, 0, 0, 9, 9, 0, 0)


Comments

Post a Comment

Popular posts from this blog

Physical Computing, Final Project

Image
Physical Computing Final Project Technical Details For my final project, I have made a set of analog synthesizers. What I mean by analog is that I haven’t used any microcontrollers for this project. I will only be working with 9V batteries and a series of different IC’s ( Integrated circuits ). These are the IC chips I have used for my final build: CD4046 CD40106 CD4066 CD4017 LM386 The Synthesizer This is a very simple circuit that is generating a square wave. The small yellow 0.1uF capacitor is the capacitor that is setting the frequency range of the oscillator. The potentiometer is adjusting the fundamental frequency. First oscillator prototype This is how the oscillator sounds: https://youtu.be/j2es7WL2imU The next step is to add more effects to the synthesizer so it sounds a bit more interesting. Next I am setting up another oscillator using the CD40106 chip. The CD40106 is a Hex Schmitt Trigger or more eas...
Read more

Extended DFO Experimentation

Image
This week we have continued working on our optimisation algorithm using DFO and the focus this week was to apply our DFO to a specific problem. The assigned problem for our DFO is to find the brightest pixels in an image. The image have replaced the sphere function I used in previous post. In this experiment I am generating a black and white image using perlin noise, I am using the continuous randomising image as my search space. This will make the search space dynamic and the flies will always try to find the brightest pixel. My initial idea was to use the webcam to move the brightest pixel around but I found this more aesthetically appealing. ( I'm a huge fan of perlin noise ) The calculation to get the brightest pixel is very simple, I iterate through all the flies in my population and I take the fly’s current position and subtracting the brightness value from that particular location from 255, which is the maximum brightness. This means that if the current pixel b...
Read more

Dispersive Flies Optimisation ( DFO )

Image
Dispersive Flies Optimisation (DFO) is a global optimisation algorithm that is inspired by observing behaviour of swarming flies in the real world. The algorithm is going through a defined search space and it’s trying to find the most optimal value, which will converge the flies towards their target. We use the DFO to benchmark different test functions for our optimisation. The swarming behaviour of the flies optimisation is based on a value called ‘fitness’. This value judges how optimal the data is and based on the value of the ‘fitness’, it will attract the swarm of flies towards the new found optimal position. During the test of finding the most optimal fitness value, the algorithm is also applying random values to disburse the flies across the search space and away from the best fitness value. This is an attempt to further explore the search space and perhaps find a better potential fitness value. Together with Terry, we implemented the algorithm that was given to us in t...
Read more