Originally posted by: pulse8
Originally posted by: Colt45
what is the travelling salesman problem
Originally posted by: Achtung
Yeah I'm guessing it uses a similar algorithm, although in travelling salesman I thought you had to visit all the stops exactly once. Mapquest just finds the shortest route between points, and there is a similar algorithm for that which I remember from AI class, just not the exact name. Actually there are a couple of different ones, some quick and dirty, others longer but more exact.
Originally posted by: bigredguy
Originally posted by: Achtung
Yeah I'm guessing it uses a similar algorithm, although in travelling salesman I thought you had to visit all the stops exactly once. Mapquest just finds the shortest route between points, and there is a similar algorithm for that which I remember from AI class, just not the exact name. Actually there are a couple of different ones, some quick and dirty, others longer but more exact.
There has to be more than just that because mapquest will often tell me to take the freeway even though it is shorter to just take regular streets.
Originally posted by: notfred
Originally posted by: bigredguy
Originally posted by: Achtung
Yeah I'm guessing it uses a similar algorithm, although in travelling salesman I thought you had to visit all the stops exactly once. Mapquest just finds the shortest route between points, and there is a similar algorithm for that which I remember from AI class, just not the exact name. Actually there are a couple of different ones, some quick and dirty, others longer but more exact.
There has to be more than just that because mapquest will often tell me to take the freeway even though it is shorter to just take regular streets.
"shorter" isn't neccesarily measured by distance between points,but possibly by time between points.