The art of theTravelling Salesman Problem

From: Patrick Meuser (pmeuser_at_cogeco.ca)
Date: 02/26/04 

Date: Thu, 26 Feb 2004 13:37:48 -0500

Hello all,

The following I figured in partial as an attempt to find a route for the
ingredients of Curry Chicken. Hope you could find this useful. The
algorithm is based on the Fourier-Wavelt-Gauss method.

http://home.cogeco.ca/~pmeuser/Scan001a.pdf
http://home.cogeco.ca/~pmeuser/Scan001b.pdf

Best,

PM

Relevant Pages

  • Re: Routing algorithm question
    ... > I assume it is some sort of least-cost routing algorithm, ... The entire USA roads are divided into classifications and each ... divide the route into 3 pieces. ...
    (sci.geo.satellite-nav)
  • Re: Bus/train timetable search algorithm
    ... one could route from New Orleans to Minneapolis ... Something like Dijkstra's algorithm isn't obviously applicable because ... the quickest route does not necessarily comprise of the quickest ... I'm left with a depth first exhaustive search, ...
    (comp.programming)
  • Re: Garmin GPSmap 76C Review
    ... > routing algorithm. ... >>106 km route). ... > residential streets, while Bicycle does not. ...
    (sci.geo.satellite-nav)
  • Re: Garmin GPSmap 76C Review
    ... >task to determine the best route under all conditions and get an answer ... When I write "correct algorithm", then that only means that the ... mathematics and that the algorithms do not pose any extreme ... calculation time increases far more than proportional. ...
    (sci.geo.satellite-nav)
  • Routing algorithm question
    ... routing programs use? ... I assume it is some sort of least-cost routing algorithm, ... How do they pick the quickest route? ... What I am talking about is some routes may be quicker in theory, ...
    (sci.geo.satellite-nav)