F20BC Biologically Inspired Computation

9 Pages1386 Words180 Views

Biologically Inspired Computation (F20BC)

Added on 2020-05-04

F20BC Biologically Inspired Computation

Biologically Inspired Computation (F20BC)

Added on 2020-05-04

BookmarkRelated Documents

BIO-INSPIRED COMPUTION

F20BC Biologically Inspired Computation_1

Table of ContentsIntroduction..............................................................................................................................1Part 1A) – Evolutionary Algorithm........................................................................................1Part 1B) – Neural Network Classification using MLP.........................................................3Part 2 – Research on Articles about the Bio-inspired Algorithms......................................5Conclusion.................................................................................................................................6References.................................................................................................................................6

F20BC Biologically Inspired Computation_2

IntroductionThe traveling salesman problem is an important combinatorial problem of optimization.The goal of the problem is finding the shortest distance from one city which is the source toanother city which is the destination through n different cities. In this research, an evolutionalgorithm is used for finding the shortest distance between n cities. This is used to solve tsp inless amount of time. The issues that are included in implementing the evolution algorithm isthe encoding technique of the tour and the crossover algorithm that can be used forcombining the parent tours to create the child tour. The parameters that are used in thisalgorithm are the population size and the number of generations. This research consists oftwo parts. The first part consists of the implementation of the evolutionary algorithms andcomparing the performance of the proposed algorithm with the other optimization algorithms.The sub division of the first part is the comparison of results using the neural networks. Thesecond part of the research consists of the integration part of the created Evolution algorithmand the Multilayer Perceptron using neural networks.Part 1A) – Evolutionary AlgorithmEvolutionary algorithm is used for solving the travelling salesman problem in thefastest way. The evolutionary algorithm uses a kind of initial population. There are 6parameters used in this research. They are population size, size of the group, Mutation,Number of generations and the list of cities. The population size is initially taken as 5000.The result for the 5000 population size is represented below.Solution for Travelling Salesman problem

F20BC Biologically Inspired Computation_3

End of preview

Want to access all the pages? Upload your documents or become a member.

COSC2110 Data Mining Assignment

|15

|1503

|80

F20BC Biologically Inspired Computation