Multiple Route Planner

Myrm

Myrm
KK, so I have purchased a Beluga Liner with multiple cabin classes. I have just taken onboard 4 different parties, with each party wanting to see the sights in different systems. Rather than me completing, say, all the first group's requests, then the second and so on, I'd like to plan my routes more sensibly, so that I can visit the sights of each group in the order of systems I pass through.

Is is there a tool anywhere that will allow me to put in my origin and all the systems I want to visit, which will then produce a flight plan taking in all the systems I entered?

Tack.
 

Jaiotu

Jaiotu
[???]

Can't you just do this in the Galaxy map? Plug in each destination, determine where they are located in relationship to your current position and then decide on which order you'll visit them. I don't think there is anything that will automate this for you ... though I've often wished for an advanced route planner in the map that allows me to travel to specific waypoints instead of plugging in the first destination, traveling there and then entering the next stop, etc. Even if there was a third party tool for this you'd still have to go into the galaxy map and enter each waypoint by hand.
 

Qohen Leth

Qohen Leth
I don't think you'd gain anything with a software like you propose. You'd still have to enter the destinations in the game yourself.
 

Myrm

Myrm
I think people are missing the point here. I'm not looking for software that will input the route into ED for me. Rather I was wondering if there was software or a site into which I could enter, say, 10 destinations and it would then produce a list of those ten reordered into the quickest or most economical route. I could then plot my journey according to the generated list.

Anyway, seems even if it did work it wouldn't be of much benefit. I just found out that if a passenger wants to visit four systems, I have to visit them in the order the passenger requests. I was in destination 1 then jumped straight to destination 3. The passenger didn't seem to realise I was in one of her destinations as it wasn't in the order she reques ex.
 

goemon

goemon
Myrm said:
Anyway, seems even if it did work it wouldn't be of much benefit. I just found out that if a passenger wants to visit four systems, I have to visit them in the order the passenger requests..
Click to expand...

exactly.

btw., there is a tool - it's called ED pathfinder, and it even pulls destinations from your mission list via log.
 

phelbore

phelbore
Myrm said:
I think people are missing the point here. I'm not looking for software that will input the route into ED for me. Rather I was wondering if there was software or a site into which I could enter, say, 10 destinations and it would then produce a list of those ten reordered into the quickest or most economical route. I could then plot my journey according to the generated list.

Anyway, seems even if it did work it wouldn't be of much benefit. I just found out that if a passenger wants to visit four systems, I have to visit them in the order the passenger requests. I was in destination 1 then jumped straight to destination 3. The passenger didn't seem to realise I was in one of her destinations as it wasn't in the order she reques ex.
Click to expand...

Isn't this the traveling salesman problem? I thought it was notoriously hard to calculate the "best" route. I'm not saying it can't be solved, but it's computationally expensive.
 

MattG

MattG
EDJP also does this (amongst other things). Paste in destination systems and lookup or provide co-ordinates, it'll give you an efficient route. Can even take into account jump distance of ship.
 

schlowi123

S
Do I understand correctly that one can see the destinations of the passengers and also in which order these have to be visited?

If yes, what you want is a bit more complicated than the traveling salesman problem. Basically it is the same, but the information changes during the journey. If the somebody would answer the upper question I think that this problem can be solved.
 

schlowi123

S
I think I have a solution for that. … And I don't mean for the regular traveling salesman, but for the case when new locations get added after a previous location was visited and where the order of when a location is visited important.

Including the case when it is better to first go to a further away location because two passenger want to go to a closer location but one of them doesn't want to visit it before he or she was at the further away location.

And also including the case if visiting a location twice is more effectiv. E.g. if passenger A wants to visit location FOO as second point of interest and passenger B wants to see FOO as fifth point of interest. But since passenger B must visit all the other destinations before FOO it can be more effectiv to go there twice.

An example (from the Sol system and all want back there):
traveler 1: NGC 6188 Sector LC-V c2-28 => UBV 6193' => Zhulong => NLTT 15714
traveler 2: CM Draconis => Omicron-2 Eridani => NLTT 15714
traveler 3: LAWD 49 => NLTT 15714 => Geras

shortest path: Sol => LAWD 49 => NGC 6188 Sector LC-V c2-28 => NLTT 15714 => Geras => UBV 6193 => CM Draconis => Zhulong => Omicron-2 Eridani => NLTT 15714 => Sol.
"NLTT 15714" is visited twice

However, if traveler 2 also wants to see "Charick Drift" as the fourth point of her/his journey and traveler 3 does not want to see "Geras", than "NLTT 15714" is NOT visited twice:
shortest path in this case: Sol => LAWD 49 => NGC 6188 Sector LC-V c2-28 => CM Draconis => UBV 6193 => Omicron-2 Eridani => Zhulong => NLTT 15714 => Charick Drift => Sol

It's a short python program. If there is any interest I can publish it … albeit that may take a while. Depends on how I feel to program a proper interface … and there may also not be any interest, since the names of the locations still need to be put in manually.

Also: of course should the number of locations to be visited not be too large. Otherwise the algorithm needs a very long time to find the optimal path so that flying the round not optimized will take less time. But that is the typical traveling salesman problem … enhanced by the fact that my programming skills aren't that good and thus my algorithms are inefficient and slow.
 
Last edited:

schlowi123

S
I can't find the sourcecode of EDJP. So it may do that, too. But it sounds more like it solves the original traveling salesman problem.
 
You must log in or register to reply here.
Back
Top Bottom