Traveller salesman problem

$10-30 USD

Finalizat

Data postării:

peste 2 ani în urmă

$10-30 USD

Plata la predare

build a system using only Java that solves travelling salesman problems. The travelling salesman problem is to go to each city exactly once and return to the start. Solving the problem should give a path and the length of the path. There are optimal solutions, that is solutions with the shortest path. Sample files are provided below. They have n lines for n cities. The first integer in the line is the city number (starting with 1 and ending with n) and the second and third integers are the X and Y coordinates of the city. Distance is standard Euclidean distance. The system should solve the three training sets

Java

Artificial Intelligence

ID-ul proiectului: 31878420

Despre proiect

2 propuneri

Proiect la distanță

Activ: 3 ani în urmă

Vrei să câștigi bani?

Adresa de e-mail

Avantajele de a licita pe platforma Freelancer

Stabilește bugetul și intervalul temporal

Îți primești plata pentru serviciile prestate

Evidențiază-ți propunerea

Te înregistrezi și licitezi gratuit pentru proiecte

Acordat utilizatorului:

@karambis

Hello, I am interested in your project. Please contact me for further details.

$25 USD în 2 zile

5,0

(2 recenzii)

1,8

2 freelanceri plasează o ofertă medie de $25 USD pentru proiect

@Jerrysmit0913

Hi, Dear friend. I am interesting in your project since I have plenty experience in your fields. Could you send me your project description in detail. I hope to work with you on your project in future. thanks.

$25 USD în 1 zi