(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
  a ----------- c ----------- b
\                         /
\--------- d ---------- /


If the distance from a to b going through d is less than the distance from a to b going through c but there is a busy traffic intersection at d with a stop sign that is always backed up, then the route from a to b through c is faster, but the route through d is shorter.

For example,

$dist(a, c) = 10$ miles

$dist(c, b) = 5$ miles

So the distance from a to b through c is 15 miles. Assuming you drive 30 miles per hour, the time to travel this would be 30 minutes

$dist(a, d) = 5$ miles

$dist(c, b) = 5$ miles

So the distance from a to b through d is 10 miles. Assuming you drive 30 miles per hour, the time to travel this would be 20 minutes, but due to the busy intersection at d, you are delayed 15 minutes, the total time would be 35 minutes.

---

Another possible solution: You have a longer route with a higher speed and a shorter route with a lower speed. By choosing the numbers appropriately, you can make the longer route be the winner. The speed may be due to law, or due to traffic jam, or because of pot holes on the road :-)

Suppose road of length l1 has speed limit s1 and another road of length l2 has speed limit l2. The shorter route is determined by comparing l1 with l2. The faster route is determined by comparing l1/s1 with l2/s2. With positive numbers, if l1 > l2 but l1 < l2 * s1 / s2, then the faster route differs from the shorter route.
{"ft_lang_label":"__label__en","ft_lang_prob":0.9449488,"math_prob":0.98003054,"size":1441,"snap":"2020-10-2020-16","text_gpt3_token_len":377,"char_repetition_ratio":0.144746,"word_repetition_ratio":0.21575342,"special_character_ratio":0.3060375,"punctuation_ratio":0.097402595,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98351395,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-02-18T01:39:36Z\",\"WARC-Record-ID\":\"<urn:uuid:5d55d2e0-f90f-4e12-89bd-c33312173780>\",\"Content-Length\":\"16288\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a2d6f7b6-c1fc-4de9-9f93-bd39200af316>\",\"WARC-Concurrent-To\":\"<urn:uuid:f4b7a2a4-9d49-47ff-881f-be606acfbbd5>\",\"WARC-IP-Address\":\"54.214.216.106\",\"WARC-Target-URI\":\"http://www.algorist.com/algowiki/index.php?title=TADM2E_1.3&oldid=348\",\"WARC-Payload-Digest\":\"sha1:Z25UXC5M2JI3RFYGNKNH3Y5DJGCHFA55\",\"WARC-Block-Digest\":\"sha1:7OHFED4GOC2NG5CGFJFTVJHKAFGUU25O\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-10/CC-MAIN-2020-10_segments_1581875143455.25_warc_CC-MAIN-20200217235417-20200218025417-00417.warc.gz\"}"}