Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Look up keyword
Like this
3Activity
0 of .
Results for:
No results containing your search query
P. 1
Further Study of Genetic Algorithms with Gene Repair

Further Study of Genetic Algorithms with Gene Repair

Ratings: (0)|Views: 41|Likes:
This thesis describes in detail the work that I completed for my final year project. In this project Genetic Algorithms are used to find near optimal solutions for the Traveling Salesman Problem . I investigated different components of the genetic algorithms . I also investigate the implications of using Genetic Algorithms to find solutions for the Asymmetric Traveling Salesman Problem.
This thesis describes in detail the work that I completed for my final year project. In this project Genetic Algorithms are used to find near optimal solutions for the Traveling Salesman Problem . I investigated different components of the genetic algorithms . I also investigate the implications of using Genetic Algorithms to find solutions for the Asymmetric Traveling Salesman Problem.

More info:

Published by: Undergraduate Awards on Sep 01, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
See more
See less

10/27/2013

 
Further Study of Genetic Algorithms with Gene Repair:
 
Niamh Nic Clámha
 
Final Year Project - 2009
 
B.Sc. Single/Double Honours in Computer Science/Computer Scienceand
 
Software Engineering
 
Department of Computer Science
 
National University of Ireland, Maynooth
 
Co. Kildare
 
Ireland
 
A thesis submitted in partial fulfillment of the requirements for the B.Sc. Single/DoubleHonours in
 
Computer Science/Computer Science and Software Engineering.
 
Supervisors: Dr
Diarmuid O’Donoghue, Amy Fitzgerald
 
 2
Declaration
I hereby certify that this material, which I now submit for assessment on the programof study leading to the award of B.Sc. Single/Double Honours in ComputerScience/Computer Science and Software Engineering, is
entirely
my own work andhas not been taken from the work of others - save and to the extent that such work hasbeen cited and acknowledged within the text of my work.Signed: _________________________________ Date: _________________
 
 3
Abstract
In this project Genetic Algorithms are used to find near optimal solutions for theTraveling Salesman Problem (TSP). Genetic Algorithms encompass a number of different components and each of these components can be performed in anumber of different ways (or sub-algorithms). My thesis will attempt toinvestigate two of these components;
selection
methods and
 gene repair 
 methods, to find out which variables yield better solutions.I will also investigate the implications of using Genetic Algorithms to findsolutions for the Asymmetric Traveling Salesman Problem (ATSP). This adds anextra constraint to the problem making it more difficult to generate validsolutions. It is expected that this might also have further implications for thegenetic repair process and consequently on the quality of results generated.

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->