Program logistics for multiple taxis?

Be that periodically there are 15-25 people who need to taxi to plant city. Is there any program/service that would allow to automate the process of separation of people on the machines, taking into account the reduction of costs?


Or take the API documentation of Google Maps, and write your own?

UPD. I'm not a taxi driver, and do not intend to open his own taxi company. I'm just one of those 15-25 people (and they are always different), and we don't want to pay for a taxi... the Only thing that saves: the number of cars, time, and distance that the machine preodoleyut. All taxis will always begin from one point, and we don't care where they go.
October 8th 19 at 02:29
4 answers
October 8th 19 at 02:31
There are hardly any public services of this kind, however, have the correct company providers for a taxi something like that certainly is.

But on the other hand, it is not just matmodel, which is something to consider. Almost certainly it is a complex of hardware and software that, working together, result in an automated taxi dispatching.
First, it is a continuous monitoring of the location of taxis (GPS, GLONASS). He is?
Second, this continuous monitoring of napravlennosti taxi (and how you wanted to count the costs without gasoline?) To be honest, no idea how to make the collection of this information.
Thirdly, where we take the distance between points on the map? Rely on Google Maps? I'm not sure that it has a similar function. If not — it is necessary to develop...

That's just what immediately came to mind, nuances certainly much more.

Make kernel the optimal dispatch I would probably be able to take on, provided that all necessary data are already available at the input of the algorithm.
That's all well and good, but I wasn't going to open his own taxi firm. I'm just one of those 15-25 people (and they are always different), and we don't want to pay for a taxi... the Only thing that saves: the number of cars, time, and distance that the machine preodoleyut.
I guess I'm not exactly the question asked, now I will specify. - elisa.Schaefer commented on October 8th 19 at 02:34
October 8th 19 at 02:33
Service mass distribution of employees after corporate drinking :)

In General, it is best to have SENSIBLE person who knows the city )
Cheap and cheerful.

About the rest of it is so specific task, that it seems that the easiest "something different".
Now these people are doing. But would like to make their jobs easier.

Did not think that it is highly specific... What would you recommend, to recursively test all combinations (of people-not so much), or to develop a special algorithm that will do it in less number of iterations? - elisa.Schaefer commented on October 8th 19 at 02:36
October 8th 19 at 02:35
Basically, if you try, you can solve it using salesman. Limiting a length of the hop on the 4 strokes.

View:
db.tt/QI6FScXB

Can you inspire)
4 strokes because 4 people in the car. - elisa.Schaefer commented on October 8th 19 at 02:38
Thank you very much! Have no idea what you just texted me, but that means tomorrow morning for me will open new heights of attainment! Thanks again. - elisa.Schaefer commented on October 8th 19 at 02:41
ru.wikipedia.org/wiki/Задача_коммивояжера - lisa_Corw commented on October 8th 19 at 02:44
October 8th 19 at 02:37
It is about that... But I would like to have a database with people where you could just lay the box who this time goes... In General, it seems that it is easier to do it myself... - elisa.Schaefer commented on October 8th 19 at 02:40

Find more questions by tags Google MapsSoftware