get the optimum/closest path using dijkstra and tsp algorithm (without using google map) and plot the path on open street map(osm)

$10-30 USD

Completato

Pubblicato

più di 4 anni fa

$10-30 USD

Pagato al completamento

I want to identify the most optimum path by using dijkstra and tsp(travelling salesman problem) [login to view URL] that case I am using Open Street Map.(Not allow to use google maps).Then I want to get the accuracy of these algorithm with compared to the Google [login to view URL] this project I am using python for the backend and android(jave only,not kotlin) for the frontend.

Rif. progetto: 21745742

Info sul progetto

2 proposte

Progetto a distanza

Attivo 5 anni fa

Hai voglia di guadagnare un po'?

Indirizzo Email

I vantaggi delle offerte su Freelancer

Imposta il tuo budget e le scadenze

Fatti pagare per il lavoro svolto

Delinea la tua proposta

La registrazione e le offerte sui lavori sono gratuite

Assegnato a:

@vaithiebby

Hi,I Can Do For You Let Me Chat About Your Requirements With Some More Details......................................

$35 USD in 7 giorni

0,0

(0 valutazioni)

0,0

2 freelance hanno fatto un'offerta media di $42 USD

@hemsingh1

Python, Android, Google Maps API, Javascript, MySQL skilled professional with the required expertise. Can help to deliver the solution as needed on the expected lines. Please private message me to discuss the project further. Hope to build a long term business relationship. Thanks!

$48 USD in 7 giorni