traveling salesman problem in winprolog

write a program that finds the shortest route that visits all the cities .the input to the program should be the starting city and the list of cities to be visited.

houston dallas austin abiline waco san-antonio

houston *** 241 162 351 183 198

dallas 241 *** 202 186 97 271

austin 162 202 *** 216 106 77

abiline 351 186 216 *** 186 244

waco 183 97 106 106 *** 183

san-antonio 198 271 77 244 183 ***

now we have to design a code to read the distance between the cities from a text file for the first 5 cities and test the program using houston the starting [url removed, login to view] your code work if additional city ,say san-antonio is added to the list and if so,what is the shortest route with tht addition?samples of text file are below.

original input text file

houston dallas 241

houston austin 162

houston abiline 351

houston waco 183

dallas austin 202

dallas abiuline 186

dallas waco 97

austin abilene 216

austin waco 106

abilene waco 186

extended text file has

houston san antonio 198 afer houston waco


dallas san antonio 271 after dallas waco

austin san antonio 77after austin waco

abilene san antonio 244after abilene waco

waco san antnio 183

in the original text file....

the program should be written in such a way that it determines the shortest path when the starting city is entered while [url removed, login to view] instance, if we pass the argument tsp(houston,shortestpath,distance).it should determine the shortest path which starts from houston and comes back to houston traveling all the cities .simlarly for other cities too...please help me out .....

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):

a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.

b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.

3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).

## Platform

windows xp or vista...the program should run in winprolog 4.6....

Habilidades: Administração de Bancos de Dados, Engenharia, MySQL, PHP, Arquitetura de software, Teste de Software, SQL, Tradução

Veja mais: web design traveling, web design san antonio, web design dallas, web design austin, traveling web design, php dallas, design argument, dallas web design, dallas php, city of waco, city of austin, austin web design, argument from design, web design houston, houston web design, abilene, traveling, salesman, hire a salesman, Austin, traveling salesman problem tsp, program extended desktop, traveling salesman problem code using, tsp problem, traveling salesman code

Acerca do Empregador:
( 0 comentários ) United States

ID do Projeto: #2967631

1 freelancer está oferecendo em média $43 para esse trabalho


See private message.

$42.5 USD in 3 dias
(103 Comentários)