Hi list,<div><br></div><div>On Friday at FOSS4G in Denver I discussed with Steve about TSP, and I want to share a bit of what we came up with:</div><div><ul><li>According to Steve there is a way to solve TSP without GA (Genetic Algorithm), and that way we could get rid off GAUL dependency and make it a "core" function.</li>
<li>Instead of calculation of a distance matrix within the TSP function, the distance matrix could be passed as a "SELECT". Then the user could decide the way distances should be calculated. And APSP would be a nice way to calculate a distance matrix for example.</li>
</ul><div>Any other ideas how to improve the current implementation of TSP?</div></div><div>Do you have some other use cases with specific requirements?</div><div><br></div><div>Daniel</div><div><br></div><div><br clear="all">
<div><br></div>-- <br><span style="font-family:arial, sans-serif;font-size:13px;border-collapse:collapse">Georepublic UG & Georepublic Japan<br>eMail: <a href="mailto:daniel.kastl@georepublic.de" style="color:rgb(66, 99, 171)" target="_blank">daniel.kastl@georepublic.de</a><br>
Web: <a href="http://georepublic.de/" style="color:rgb(66, 99, 171)" target="_blank">http://georepublic.de</a></span><br>
</div>