On 13/02/2013 12:09, Joachim Schimpf wrote: > On 13/02/2013 10:49, Marco Gavanelli wrote: >> Dear Hadeer, >> >> your problem looks like a variation of the Hamiltonian Circuit in which >> you have different starting and ending nodes. >> >> Here you can find a solution to the Tavelling Salesperson Problem, which >> is the Hamiltonian circuit with a minimization of the travelled distance: >> >> http://eclipseclp.org/archive/eclipse-users/0471.html >> >> You might take inspiration from this solution. > > Another possibility is the cycle-constraint in ECLiPSe 6.1, > which was contributed by Lukasz Domagala > > http://www.eclipseclp.org/docs/Dev/current/bips/lib_public/cycle/index.html Another contributed library that may be applicable is Grasper by Ruben Duarte Viegas http://www.eclipseclp.org/docs/6.0/bips/lib_public/grasper/index.html You could also use library(eplex) and a MIP model - there are many, google for Traveling Salesman Problem. -- JoachimReceived on Wed Feb 13 2013 - 13:59:49 CET
This archive was generated by hypermail 2.3.0 : Tue Apr 16 2024 - 09:13:20 CEST