Home
Forums
New posts
Search forums
What's new
New posts
Latest activity
Members
Current visitors
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Search forums
Menu
Log in
Register
Install the app
Install
Home
Forums
Brown Cafe UPS Forum
UPS Discussions
At UPS, the Algorithm Is the Driver
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Reply to thread
Message
<blockquote data-quote="Signature Only" data-source="post: 1531742" data-attributes="member: 21043"><p><span style="font-size: 15px"><span style="color: #0000ff">For a detailed explanation just google TSP or see Wikipeda.</span></span></p><p><span style="font-size: 15px"><span style="color: #0000ff"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">I'll give you the basics. TSP (Traveling Salesman Problem) on which Orion is based originated in the 1800s as Irish mathematician William R. Hamilton considered a way to compute the shortest route a salesman could take upon leaving his hometown, calling on his accounts and returning home.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">Later British mathematician Thomas Hinkman's work led to Karl Menger proposing a brute force algorithm (computing every possible route and selecting the one with the shortest distance).</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">Around 1930 Princeton mathematician Hassler Whitney named this concept TSP.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">Considerable contributions in refining algorithms where made by George Dantzig, Selmer Johnson and the renown Delbert Fulkerson at Santa Monica's Rand Corporation in the 1960s.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">Until this point advancements in computers and algorithms led to more and more cities or in our case, stops or individual addresses being considered for solution inclusion.</span></span></p><p></p><p><span style="color: #0000ff"><span style="font-size: 15px">Dr. Arora broke ground when he found or rather envisioned a way to restate the TSP concept as a calculus equation to which the first branch of calculus (the derivative) would be useful.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">Upon solving the equation he found that as friend(x) where x=optimal solution, approaches infinity (considering the many variables and with a permissible solution acquisition time of 1 hour) the result was 85%.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">This meant that regardless of available computational power or algorithm elegance, the best result that can ever be achieved is 85%. </span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">You should look deeper into this particularly in the field of cognitive research as scientist there have shown repeatedly that humans with no previous training can outperform the best computer and best algorithms, arriving at solutions 92 to 97 percent of optimal within 5 minutes.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">The best computers would take a month to match that.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">And computers don't provide an 85% result constantly. Remember 85% is the very best you'll ever get. Most times its between 30 to 60% of optimal. Just change 1 thing in a DOL and rerun Orion and see how many different results you get. Then consider the nearly infinite variables a driver takes into account each and every day.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">So now, cognitive research is centered on discovering what enables humans to do such a good job with so many variables in such a short amount of time. If an algorithm could be formulated that would be half as good imagine the applications.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">The defense industry has.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">By the way, Dr. Arora's work has been authenticated by the mathematical and computer community. Hence the Godel Prize in 2008.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px">A bit long winded, I know. But check his research and you'll see that Orion is nothing but a blind alley.</span></span></p><p><span style="color: #0000ff"><span style="font-size: 15px"></span></span></p></blockquote><p></p>
[QUOTE="Signature Only, post: 1531742, member: 21043"] [SIZE=4][COLOR=#0000ff]For a detailed explanation just google TSP or see Wikipeda. [/COLOR][/SIZE] [COLOR=#0000ff][SIZE=4]I'll give you the basics. TSP (Traveling Salesman Problem) on which Orion is based originated in the 1800s as Irish mathematician William R. Hamilton considered a way to compute the shortest route a salesman could take upon leaving his hometown, calling on his accounts and returning home. Later British mathematician Thomas Hinkman's work led to Karl Menger proposing a brute force algorithm (computing every possible route and selecting the one with the shortest distance). Around 1930 Princeton mathematician Hassler Whitney named this concept TSP. Considerable contributions in refining algorithms where made by George Dantzig, Selmer Johnson and the renown Delbert Fulkerson at Santa Monica's Rand Corporation in the 1960s. Until this point advancements in computers and algorithms led to more and more cities or in our case, stops or individual addresses being considered for solution inclusion.[/SIZE][/COLOR] [COLOR=#0000ff][SIZE=4]Dr. Arora broke ground when he found or rather envisioned a way to restate the TSP concept as a calculus equation to which the first branch of calculus (the derivative) would be useful. Upon solving the equation he found that as friend(x) where x=optimal solution, approaches infinity (considering the many variables and with a permissible solution acquisition time of 1 hour) the result was 85%. This meant that regardless of available computational power or algorithm elegance, the best result that can ever be achieved is 85%. You should look deeper into this particularly in the field of cognitive research as scientist there have shown repeatedly that humans with no previous training can outperform the best computer and best algorithms, arriving at solutions 92 to 97 percent of optimal within 5 minutes. The best computers would take a month to match that. And computers don't provide an 85% result constantly. Remember 85% is the very best you'll ever get. Most times its between 30 to 60% of optimal. Just change 1 thing in a DOL and rerun Orion and see how many different results you get. Then consider the nearly infinite variables a driver takes into account each and every day. So now, cognitive research is centered on discovering what enables humans to do such a good job with so many variables in such a short amount of time. If an algorithm could be formulated that would be half as good imagine the applications. The defense industry has. By the way, Dr. Arora's work has been authenticated by the mathematical and computer community. Hence the Godel Prize in 2008. A bit long winded, I know. But check his research and you'll see that Orion is nothing but a blind alley. [/SIZE][/COLOR] [/QUOTE]
Insert quotes…
Verification
Post reply
Home
Forums
Brown Cafe UPS Forum
UPS Discussions
At UPS, the Algorithm Is the Driver
Top