<div dir="ltr">Hi,<div><br></div><div>I was able to make pgr_apspjohnson work but came to the conclusion that when we have available a valid distance matrix suitable for TSP/VRP it makes no sense to feed anything else to pgr_tsp or pgr_vpronedepot as the results will be suboptimal.</div>
<div><br></div><div>Regarding pgr_vrponedepot I was able to also make it work however I guess I stumbled on several issues:</div><div><ul><li>Depot open/close time seems to not be obeyed;</li><li>Traveltime also seems to not being considered between departure and arrival time every time;</li>
<li>After each query I have to restart PostgreSQL as last query result seems to be stuck "somewhere" (memory?) and all subsequent queries return the very same result;</li><li>When I have to cancel some running query, cancelling procedure takes forever and the only way I found to stop it is by killing postgresql process.</li>
</ul><div>As some of these issues are too serious, I'm not sure if my merging & build may have some problem...</div></div><div>If someone want to get a look, I've merged several Steve's develop tree with Daniel's develop-vrp, and also merged by hand some other small fixes and contributions I found interesting like Dave Potts and others, that I'm testing as I have free time. You can find everything here: <a href="https://github.com/ZupoLlask/pgrouting/tree/develop">https://github.com/ZupoLlask/pgrouting/tree/develop</a>.</div>
<div><br></div><div class="gmail_extra"><div><div dir="ltr"><div>--</div><div>Helder Alves </div></div></div>
<br><br><div class="gmail_quote">On Sun, Jan 5, 2014 at 8:28 PM, Helder Alves <span dir="ltr"><<a href="mailto:helderalvespt@gmail.com" target="_blank">helderalvespt@gmail.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div dir="ltr">Hi Steve,<div><br></div><div>I'm already beyond that stage but thanks anyway! ;-)</div><div><br></div><div>Steve/Daniel,</div><div><br></div><div>Regarding my assumptions regarding pgr_apspjohnson, they seem to be wrong. Can you please elaborate a little bit on exactly which data must be fed into pgr_apspjohnson?<br>
</div><div><br></div><div>From the pgRouting examples I read, it seems to return the equivalent to the distance matrix used by pgr_TSP however I don't understand exactly which part of a routable table must be queried in a viable way for an algorithm to be able to infer which nodes have to be routed. Can you help me with this one?</div>
<div><br></div><div>Thanks!</div><div class="gmail_extra"><br clear="all"><div><div dir="ltr"><div>--</div><div>Helder Alves </div></div></div><div><div class="h5">
<br><br><div class="gmail_quote">On Sun, Jan 5, 2014 at 7:52 PM, Stephen Woodbridge <span dir="ltr"><<a href="mailto:woodbri@swoodbridge.com" target="_blank">woodbri@swoodbridge.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
<div>On 1/5/2014 2:16 PM, Helder Alves wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
Hi Daniel,<br>
<br>
Regarding pgr_apspjohnson, I came to the conclusion that SQL query<br>
passed into pgr_apspjohnson must already return a shortest path distance<br>
matrix including all the stop points we want to optimize. Am I getting<br>
it right?<br>
<br>
What I'm about to try now is to unnest the distance matrix generated for<br>
pgr_TSP to feed pgr_apspjohnson...<br>
</blockquote>
<br></div>
You might be able to use something like this to convert the distance matrix into a table:<br>
<br>
with dm as (<br>
select '{{1,2,3,4,5},<br>
{6,7,8,9,10},<br>
{11,12,13,14,15},<br>
{16,17,18,19,20},<br>
{21,22,23,24,25}}'::int[] as dm<br>
)<br>
select i, j, <a href="http://dm.dm" target="_blank">dm.dm</a>[j][i]<br>
from generate_series(1, 5) i,<br>
generate_series(1, 5) j,<br>
dm;<br>
<br>
-Steve<br>
<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex"><div>
Problem was that from all my previous reading I thought that at some<br>
point APSP Johnson would itself generate the routing graphs, what seems<br>
not to be the case, if my understanding from the source code is right...<br>
Meaning APSP Johnson only takes care of the total route minimum cost<br>
(permutations) avoiding the problem of TSP with negative costs.<br>
<br>
Please let me know if I made foolish assumptions! :-)<br>
<br>
--<br>
Helder Alves<br>
<br>
<br>
<br>
<br>
<br></div><div>
______________________________<u></u>_________________<br>
Pgrouting-users mailing list<br>
<a href="mailto:Pgrouting-users@lists.osgeo.org" target="_blank">Pgrouting-users@lists.osgeo.<u></u>org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-users" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-<u></u>users</a><br>
<br>
</div></blockquote><div><div>
<br>
______________________________<u></u>_________________<br>
Pgrouting-users mailing list<br>
<a href="mailto:Pgrouting-users@lists.osgeo.org" target="_blank">Pgrouting-users@lists.osgeo.<u></u>org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-users" target="_blank">http://lists.osgeo.org/<u></u>mailman/listinfo/pgrouting-<u></u>users</a><br>
</div></div></blockquote></div><br></div></div></div></div>
</blockquote></div><br></div></div>