Routing algorithm question
From: JLB (IHateSpam_at_nospam.net)
Date: 07/07/04
- Next message: H.W. Stockman: "Re: More info on new Magellan eXplorist series"
- Previous message: JLB: "Mapopolis Downgrade??"
- Next in thread: Louis Cohen: "Re: Routing algorithm question"
- Reply: Louis Cohen: "Re: Routing algorithm question"
- Reply: Stan Gosnell: "Re: Routing algorithm question"
- Reply: Dale DePriest: "Re: Routing algorithm question"
- Reply: Fred: "Re: Routing algorithm question"
- Reply: Bert Hyman: "Re: Routing algorithm question"
- Messages sorted by: [ date ] [ thread ]
Date: Tue, 6 Jul 2004 21:27:28 -0400
Just curious.
Are there any web sites that explain the algorithm the various GPS auto
routing programs use?
I assume it is some sort of least-cost routing algorithm, perhaps similar to
the traveling salesman problem.
My basic question is: How do they pick the quickest route (or shortest)?
Do they include a factor for the number of traffic lights on a route? How
about the 'normal' amount of traffic? Of course they can not know about
unusual traffic (unless you pay the extra $200 and get a wireless PDA).
What I am talking about is some routes may be quicker in theory, but other
routes (taking a side road around a city instead of going straight through,
for example) may be quicker.
-- Jim N8EE to email directly, send to my call sign at arrl dot net
- Next message: H.W. Stockman: "Re: More info on new Magellan eXplorist series"
- Previous message: JLB: "Mapopolis Downgrade??"
- Next in thread: Louis Cohen: "Re: Routing algorithm question"
- Reply: Louis Cohen: "Re: Routing algorithm question"
- Reply: Stan Gosnell: "Re: Routing algorithm question"
- Reply: Dale DePriest: "Re: Routing algorithm question"
- Reply: Fred: "Re: Routing algorithm question"
- Reply: Bert Hyman: "Re: Routing algorithm question"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|