Tutorial4 - Tutorial 4 Q1. Consider a Farmer-and-Worker...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Tutorial 4 Q1. Consider a Farmer-and-Worker Model for a parallel genetic algorithm. Assuming that there are 100 offspring to be evaluated in each generation, and there are 10 processing units (1 Farmer and 9 Workers). It takes 100ms to evaluate the fitness of a chromosome (the computation time for other genetic operation is negligible) and 15ms to transfer all the data of the allocated chromosome from Farmer to a Worker, or from a Worker to Farmer. What is the speed-up of the system? Q2. A genetic algorithm is designed for solving a multi-objective minimization problem (minimizing objectives 1 and 2). Consider a population of chromosomes in a genetic algorithm with their objective values specified as below: Chromosome Objective 1 Objective 2 A 25 30 B 20 15 C 18 33 D 12 12 E 5 25 F 20 8 (a) Find the rank of each chromosome if Fonseca-and-Fleming method is used. (b) Find the rank of each chromosome if Goldberg’s method is adopted. Q3.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/10/2011 for the course EE 4047 taught by Professor Kitsangtsang during the Spring '09 term at City University of Hong Kong.

Page1 / 2

Tutorial4 - Tutorial 4 Q1. Consider a Farmer-and-Worker...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online