Figuring out the best place to live in Helsinki
1–10 of 50 posts
Re: Figuring out the best place to live in Helsinki
#2Nice work, is the source available? I'd love to do something similar for Sydney, Australia.
Re: Figuring out the best place to live in Helsinki
#3Nice work, is the source available? I'd love to do something similar for Sydney, Australia.
Not at the moment, https://github.com/lvanhala?tab=repositories doesn't list it.
Re: Figuring out the best place to live in Helsinki
#4From what I read there I think he assumes he is always visiting his homebase in between. But when he travels in one day from client A directly to client B (and even C) without visiting his homebase the stuff get's much more complex and results may vary. If you want to know more do research about the "traveling salesman problem". TL;DR: It's not so easy.
Re: Figuring out the best place to live in Helsinki
#5Did you do it for /each address/ or each building? It seems like comparing each building (or even block?) to the rest would be faster in that case.
How long did it all take?
Re: Figuring out the best place to live in Helsinki
#6From what I read there I think he assumes he is always visiting his homebase in between. But when he travels in one day from client A directly to client B (and even C) without visiting his homebase the stuff get's much more complex and results may vary. If you want to know more do research about the "traveling salesman problem". TL;DR: It's not so easy.
If you want to know more do research about the "traveling salesman problem". TL;DR: It's not so easy.
It's not easy to optimize the travelling salesman problem, but if you're happy to brute force it using 30B searches it's incredibly straightforward.
Re: Figuring out the best place to live in Helsinki
#7From what I read there I think he assumes he is always visiting his homebase in between. But when he travels in one day from client A directly to client B (and even C) without visiting his homebase the stuff get's much more complex and results may vary. If you want to know more do research about the "traveling salesman problem". TL;DR: It's not so easy.
For a small number of clients tsp isn't so bad. The best known exact algorithm is n^2*2^n. And absolutely trivial for the approximate solution algorithms.
Re: Figuring out the best place to live in Helsinki
#8From what I read there I think he assumes he is always visiting his homebase in between. But when he travels in one day from client A directly to client B (and even C) without visiting his homebase the stuff get's much more complex and results may vary. If you want to know more do research about the "traveling salesman problem". TL;DR: It's not so easy.
Could be that he only works by the day, so going from client A to client B will be rare.
Disregarding changes in travel time due to the different time of say, we know that A -> Origin + Origin -> B is an upper bound on A -> B so the solution is still good even if it's not quite optimal.
Re: Figuring out the best place to live in Helsinki
#9From what I read there I think he assumes he is always visiting his homebase in between. But when he travels in one day from client A directly to client B (and even C) without visiting his homebase the stuff get's much more complex and results may vary. If you want to know more do research about the "traveling salesman problem". TL;DR: It's not so easy.
usually development contract jobs are for weeks/months so i think usually you would go only to one client per day.
Re: Figuring out the best place to live in Helsinki
#10From what I read there I think he assumes he is always visiting his homebase in between. But when he travels in one day from client A directly to client B (and even C) without visiting his homebase the stuff get's much more complex and results may vary. If you want to know more do research about the "traveling salesman problem". TL;DR: It's not so easy.
Could be that he only works by the day, so going from client A to client B will be rare. Disregarding changes in travel time due to the different time of say, we know that A -> Origin + Origin -> B is an upper bound on A -> B so the solution is still good even if it's not quite optimal.
Yes you're right. It all depends on amount of clients he visits in one day, if they are flexible in time or not and how to get from client A to client B (or C).