303 reputation
18
bio website
location
age
visits member for 3 years, 6 months
seen May 14 '12 at 13:10

Mar
3
awarded  Editor
Mar
3
revised Best routing algorithm for this scenario
spec more specific
Mar
3
comment Best routing algorithm for this scenario
Ok I'll try and clarify a few points.. the number of stages won't be known - it could be 100 or it could be 10 as long as it meets the time constraints. It would be preferable not to traverse legs more than once but it could be done if required. Limo concept is a good way of looking at it.. start/end point can be the same place, loops aren't allowed, travelling over same edges is unpreferred but acceptable. Does that help to clarify things? I'll update the original spec to make it clear as well..
Mar
3
awarded  Commentator
Mar
3
comment Best routing algorithm for this scenario
Good concept, but I'm not sure on the idea of slowing down or waiting at each stage.. the travelling should be constant and consistent. In regards to the constant speed of travelling vs. impedances, an impedance might be that one type of road is preferred to another, but the travelling speed can be the same. An example of this could be a horse walking down a road, but it'd prefer to do walk down a muddy path.
Mar
2
comment Best routing algorithm for this scenario
Interesting concept! I'm struggling to visualise it though, with the knapsack problem you specify boxes, their constraints and values. Presumably the constraint in this case would be time required of the route leg. However, I'm not sure what the value would be. Also, I assume you have to link the boxes together to represent they are route legs that link together - or would you just run one instance of the algorithm for each route? Hope that makes sense!
Mar
2
comment Best routing algorithm for this scenario
I've got to be careful what I say as I don't want to give away the full project. It's basically travelling for enjoyment rather than for a purpose.
Mar
2
asked Best routing algorithm for this scenario
Feb
23
awarded  Nice Question
Jan
26
comment Route optimisation for multiple vehicles
Hi Uffe, can it take into account vehicle restrictions (weight and dimensions) and sort the packages onto the vehicles accordingly? Also, does it work in the UK and use road history data to work out speeds etc?
Jan
26
comment Trouble installing pgrouting
Oh wow, wish I had known about this before, spent the last 5 days failing to get everything up and running! I'll download this now and give it a shot.
Jan
26
comment Trouble installing pgrouting
Hi Nicklas, I actually had both Boost and Boost-devel installed.. however it wasn't the latest version and it wasn't available via yum. I tried compiling it manually but it still picked up the old version even though that was uninstalled. I've given up and am gonna try OSGeo!
Jan
24
comment Trouble installing pgrouting
Great idea, I'll give that a shot.
Jan
24
asked Trouble installing pgrouting
Jan
21
comment Route optimisation for multiple vehicles
I initially saw the DARP algorithm but brushed over it as I didn't realise it could be used for couriers. Looks like that'll do the job nicely! It's a pity the documentation page doesn't have any examples of usage though, might be a case of hunting through the sourcecode to see how it works.
Jan
21
comment Route optimisation for multiple vehicles
I went down to ESRI HQ last week to discuss this software for them, but it doesn't appear to meet our needs (needs to run on a server and is also quite expensive). Excellent piece of kit though!
Jan
21
comment Route optimisation for multiple vehicles
Thanks Daniel, that's an excellent function you've built there. I didn't realise it could be used for delivery purposes but it definitely looks feasible. Thanks!
Jan
21
awarded  Scholar
Jan
21
accepted Route optimisation for multiple vehicles
Jan
21
awarded  Supporter