The main problem of the project is:
I have 1000 addresses from chile for ex in a database, also the lat and long.
I need to group the addresses in groups of 5 so a taxi (5 capacity) will know who is going with each driver and in wich order, with a logic so the passengers will not be inside taxi more then 90 minutes.
Method: first we need to apply a clustering to the addresses k-means clustering to define groups, then we will apply an algorithm like Dijkstra's or macs-vrptw (ant colony) to define order and itinerary withing the group, both sourses are available in google. All this as to be manage with a csv uploader and google map.
If there another option or developers with this type of experience, will be more appriciated then other bids
Looking to start ASAP, best regards.
The full documentation will be shortly in clarification board.
Dear sir,
I am proficient in algorithm implemention such as datamining. I have implmented aprior, ID3 and k-means algorithms and I have deep insight into graph algorithm such as shortest path algorithm, max flow algorithm and generic programming and ant antony algorithm in AI. I can do the project with high quality. I can show you demos.
Wait for your response
Thank you
BR