You are on page 1of 1

Submittedby:

AnoopGR
12ME31006
granoop6@gmail.com
9474828281

Title:
Tryingtosolvealargesearchspaceproblemusingspecialsoftcomputingtools

ProblemStatement:

The
travellingsalesmanproblem
(
TSP
)asksthefollowingquestion:
Givenalistofcitiesand
thedistancesbetweeneachpairofcities,whatistheshortestpossibleroutethatvisitseachcity
exactlyonceandreturnstotheorigincity?

TechniquesandAlgorithmused:

SimulatedAnnealingAlgorithmisusedwithahighlevelprogramminglanguage.
IamtryingtoimplementthissimultaneouslyinCommonLispaswellasJava.Letsseewhich
languagesucceeds.

IhavebeentryingtodevelopaDomainSpecificLanguageforthisprobleminCommonLisp.
IthinkImayhaveabettershotwithJava.

Workyettobedone:

Extendingthealgorithmtolargenumberofcitiesandproperlydocumentingitsperformance.
Rightnow,Ionlyhaveannonoptimizedimplementationfor4citiesonly,Ineedtoextenditto
somethinglike20citiesonamap.So,lotsofworkyettobedone.

Also,needtoaddreferencesandliteraturereview,andconvertthetenseofsentencesto
passivetonethroughout.

You might also like