Scribd
Upload
9 views3 pages

Prob 15

The document presents a series of questions related to Genetic Algorithms (GA) and their application to combinatorial problems, specifically the Travelling Salesman problem and crew scheduling for an airline. It covers the features of GA, fitness evaluation, crossover operations, and the suitability of problems for GA. Additionally, it discusses the representation of chromosomes, fitness functions, and the necessity of GA for solving complex scheduling issues.

Uploaded by

gauravbhardwaj752
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views3 pages

Prob 15

The document presents a series of questions related to Genetic Algorithms (GA) and their application to combinatorial problems, specifically the Travelling Salesman problem and crew scheduling for an airline. It covers the features of GA, fitness evaluation, crossover operations, and the suitability of problems for GA. Additionally, it discusses the representation of chromosomes, fitness functions, and the necessity of GA for solving complex scheduling issues.

Uploaded by

gauravbhardwaj752
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Questions 15:

Genetic Algorithms
Roman Belavkin

Middlesex University

Question 1

Give an example of combinatorial problem. What is the most difficult in


solving these problems?

Question 2

Name and describe the main features of Genetic Algorithms (GA).

Question 3

Consider the problem of finding the shortest route through several cities,
such that each city is visited only once and in the end return to the starting
city (the Travelling Salesman problem). Suppose that in order to solve this
problem we use a genetic algorithm, in which genes represent links between
pairs of cities. For example, a link between London and Paris is represented
by a single gene ‘LP ’. Let also assume that the direction in which we travel
is not important, so that LP = P L.

a) How many genes will be used in a chromosome of each individual if


the number of cities is 10?

b) How many genes will be in the alphabet of the algorithm?

Question 4

Suppose a genetic algorithm uses chromosomes of the form x = abcdef gh


with a fixed length of eight genes. Each gene can be any digit between 0
and 9. Let the fitness of individual x be calculated as:

f (x) = (a + b) − (c + d) + (e + f ) − (g + h) ,

1
BIS3226 2

and let the initial population consist of four individuals with the following
chromosomes:
x1 = 6 5 4 1 3 5 3 2
x2 = 8 7 1 2 6 6 0 1
x3 = 2 3 9 2 1 2 8 5
x4 = 4 1 8 5 2 0 9 4

a) Evaluate the fitness of each individual, showing all your workings, and
arrange them in order with the fittest first and the least fit last.
b) Perform the following crossover operations:
i) Cross the fittest two individuals using one–point crossover at the
middle point.
ii) Cross the second and third fittest individuals using a two–point
crossover (points b and f ).
iii) Cross the first and third fittest individuals (ranked 1st and 3rd)
using a uniform crossover.
c) Suppose the new population consists of the six offspring individuals
received by the crossover operations in the above question. Evaluate
the fitness of the new population, showing all your workings. Has the
overall fitness improved?
d) By looking at the fitness function and considering that genes can only
be digits between 0 and 9 find the chromosome representing the opti-
mal solution (i.e. with the maximum fitness). Find the value of the
maximum fitness.
e) By looking at the initial population of the algorithm can you say
whether it will be able to reach the optimal solution without the mu-
tation operator?

Question 5

What two requirements should a problem satisfy in order to be suitable for


solving it by a GA?

Question 6

A budget ariline company operates 3 plains and employs 5 cabin crews. Only
one crew can operate on any plain on a single day, and each crew cannot
work for more than two days in a row. The company uses all planes every
day. A Genetic Algorithm is used to work out the best combination of crews
on any particular day.
BIS3226 3

a) Suggest what chromosome could represent an individual in this algo-


rithm?

b) Suggest what could be the alphabet of this algorithm? What is its


size?

c) Suggest a fitness function for this problem.

d) How many solutions are in this problem? Is it necessary to use Genetic


Algorithms for solving it? What if the company operated more plains
and employed more crews?

You might also like