<div dir="ltr"><div>Yes you understand well <br>The goods can be available in any depot but we should in a first time, when the customer send his order the web app in charge of thi decide which depot will be used by taking the closest from the customer (it is not surely the best if we consider the final route but it is the way the customer want to go to ) and add the depot to the customer order. So at the routing time we know for sure the adresses of the customers and the addresses of the depot which will be used. Besides a depot can be used to pick up sevral goods fro several customers.<br>
</div>At the end We want to minimize the distance (the problem is for cities so shortest should be the fastest).<br></div><div class="gmail_extra"><br><br><div class="gmail_quote">2013/8/25 <span dir="ltr"><<a href="mailto:me@pgwelch.info" target="_blank">me@pgwelch.info</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><u></u>
<div>
<p>Hi Alain,</p>
<p>For the second problem, it may also be worthwhile you looking at the routing library part of Google's OR tools <a href="http://or-tools.googlecode.com/svn/trunk/documentation/user_manual/manual/tsp/routing_library.html" target="_blank">http://or-tools.googlecode.com/svn/trunk/documentation/user_manual/manual/tsp/routing_library.html</a></p>
<p>Just to confirm my understanding - you want to plan the order of depots and customers on courier routes, such that travel time or distance is minimised, whilst goods are always picked up before being delivered. Is this correct?</p>
<p>Do you always know which route a specific item will go onto? If so your problem is some variant of the travelling salesman problem. If not (you want the algorithm to assign goods to routes as well as order on the route), then you have a variant of the vehicle routing problem.</p>
<p>Are all depots visited on the route before any goods are delivered? Or is it possible to (for example) pickup goods A and B from a depot, deliver B, pickup goods C from another depot? If all pickups happen before any delivery your problem will probably be some variant of the vehicle routing problem with backhauls, if not it will be a variant of pickup and delivery vehicle routing problem.</p>
<p>Also what, roughly speaking, is the size of your problem? (the total number of depots and customers you want the algorithm to assign together in one go) Smaller problems are *much easier* to solve. </p><div class="im">
<p>>> One algorythm problem is there are several depot whith priority for the depot versus the customers who need good from such depot.</p>
</div><p>I didn't really understand this bit, can you elaborate? Do you always know which depot the goods for a customer should be picked up from or do you want the algorithm to decide this?</p>
<p>best regards</p>
<p>Phil</p><div><div class="h5">
<p> </p>
<p>On <a href="tel:24.08.2013%2021" value="+12408201321" target="_blank">24.08.2013 21</a>:53, Peter K wrote:</p>
<blockquote type="cite" style="padding-left:5px;border-left:#1010ff 2px solid;margin-left:5px">
<div>Hi Alain,<br><br> there are two different problems within those vehicle routing problems. The first one is to find out all necessary distances between depots and customers. And the second is to optimize the overall route taking all requirements and restrictions/priorities into account.<br>
<br> The first problem is called "many to many shortest path calculation" can be solved from graphhopper (although there are optimizations possible).<br><br> For the second I suggest to look into tools like optaplanner which uses (meta)heuristics:<br>
<a href="http://java.dzone.com/articles/false-assumptions-vehicle" target="_blank">http://java.dzone.com/articles/false-assumptions-vehicle</a><br><br> I think on the mailing list are people with more knowledge in this logistic area which could probably be of a better help :)<br>
<br> Kind Regards,<br> Peter.<br><br><br></div>
<blockquote type="cite" style="padding-left:5px;border-left:#1010ff 2px solid;margin-left:5px">
<div dir="ltr">Hi,<br><br> I've been consulted for a project involving some couriers (one in a first time) to make delivery to customers but with also several pick up on the route because the goods are provided by several depots to the courier. We have a databse with the different depots and the app will choose the depot the closest to the customer concerned.<br>
I'm a total newbie with such spatial and routing problems....<br><br> We would like to receive a list of customers address from a separate web app, feed an server app with this list of address and then process it to get the coordinate from OSM and then propose a route to the courier. <br>
One algorythm problem is there are several depot whith priority for the depot versus the customers who need good from such depot. The courier can't deliver goods that he did'nt yet get.<br> Is there somebody who can give me some clue to process with this precedence of passing to some depot to serve some customers. <br>
<br> Hoping my rough request are understandable,<br> Best regards<br> Alain</div>
<br><fieldset></fieldset><br>
<pre>_______________________________________________
GraphHopper mailing list
<a href="mailto:GraphHopper@openstreetmap.org" target="_blank">GraphHopper@openstreetmap.org</a>
<a href="http://lists.openstreetmap.org/listinfo/graphhopper" target="_blank">http://lists.openstreetmap.org/listinfo/graphhopper</a>
</pre>
</blockquote>
<br><br>
<pre>_______________________________________________
GraphHopper mailing list
<a href="mailto:GraphHopper@openstreetmap.org" target="_blank">GraphHopper@openstreetmap.org</a>
<a href="http://lists.openstreetmap.org/listinfo/graphhopper" target="_blank">http://lists.openstreetmap.org/listinfo/graphhopper</a>
</pre>
</blockquote>
<p> </p>
<div> </div>
</div></div></div>
<br>_______________________________________________<br>
GraphHopper mailing list<br>
<a href="mailto:GraphHopper@openstreetmap.org">GraphHopper@openstreetmap.org</a><br>
<a href="http://lists.openstreetmap.org/listinfo/graphhopper" target="_blank">http://lists.openstreetmap.org/listinfo/graphhopper</a><br>
<br></blockquote></div><br></div>