Answered: For a genetic algorithm the population…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

For a genetic algorithm the population size is 4. The encoding is permutation, the selection method is rank selection, the number of cross over points is 1. The current population is given below. The distances between the cities are given in the table below. The objective is to minimize the total distance of the trip while visiting each city.

Perform 2 cycles of Genetic Algorithm. Remember to show your selection process. Do one mutation total per cycle.

DBACE

AEDBC

EBDAC

DEACB

Distance between cities	A	B	C	D	E
A	-	54	14	47	32
B	-	-	69	81	24
C	-	-	-	38	72
D	-	-	-	-	59
E	-	-	-	-	-

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

Follow-up Questions

Read through expert solutions to related follow-up questions below.

Follow-up Question

This does not solve the question as no 2 cylces of genetic algorithm is being performed. The question is not simply a multple choice question as to which path is the shortest.

Solution

by Bartleby Expert

SEE SOLUTION

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions