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 Union Issues
ORION discipline
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: 1397628" data-attributes="member: 21043"><p><span style="font-family: 'Verdana'"><span style="font-size: 15px"><span style="color: #0000ff">From the Journal of Problem Solving. (Volume 1, no. 1 Fall 2006)</span></span></span></p><p></p><p><span style="font-family: 'Verdana'"><span style="color: #0000ff">Considering the classic Travelling Salesman Problem, as the number of nodes or stops is increased, the number of possible solutions increases factorially: (n - 1)!/2</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000ff"></span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000ff">That means for Orion, a 5 point array or 5 stop route has 12 possible solutions.</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000ff">A 10 stop route has 181,440 solutions, and a 15 stop route has (4 x 10)10 possible solutions.</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000ff"></span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000ff">Despite the apparent intractability of TSP,research into human performance with visually presented TSP problems show that participants are capable of solving the arrays to near optimal accuracy with a minimum of cognitive effort.</span></span></p><p></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3">Also consider the work of Dr. Sanjeer Arora, Theoretical Computer Scientist with Princeton, MIT and UC Berkley. He found that regardless of the algorithm's elegance and complexity or the computer used for calculations, any solution reached will be no better than one arrived at by the human brain.</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3"></span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3">In fact, a computer's solution would be no better than a 89% optimization of what a person could do.</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3"></span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3">And it takes the computer a lot longer to reach its solution.</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3"></span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3"></span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3">See:</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3">MIC 99 - 111 Metaheuristics International Conference</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: #0000b3"> (Analyzing the Run-Time Behavior of Iterated</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: rgb(0, 0, 179)"> Local Search for the TSP)</span></span></p><p><span style="font-family: 'Verdana'"><span style="color: rgb(0, 0, 179)"></span></span></p><p><span style="font-family: 'Verdana'"><span style="color: rgb(0, 0, 179)"></span></span></p><p><span style="font-family: 'Verdana'"><span style="color: rgb(0, 0, 179)">Bottom line: Orion is useful. But if UPS is interested in mileage and time savings, nothing beats the human brain.</span></span></p></blockquote><p></p>
[QUOTE="Signature Only, post: 1397628, member: 21043"] [FONT=Verdana][SIZE=4][COLOR=#0000ff]From the Journal of Problem Solving. (Volume 1, no. 1 Fall 2006)[/COLOR][/SIZE][/FONT] [FONT=Verdana][COLOR=#0000ff]Considering the classic Travelling Salesman Problem, as the number of nodes or stops is increased, the number of possible solutions increases factorially: (n - 1)!/2 That means for Orion, a 5 point array or 5 stop route has 12 possible solutions. A 10 stop route has 181,440 solutions, and a 15 stop route has (4 x 10)10 possible solutions. Despite the apparent intractability of TSP,research into human performance with visually presented TSP problems show that participants are capable of solving the arrays to near optimal accuracy with a minimum of cognitive effort.[/COLOR][/FONT] [FONT=Verdana][COLOR=#0000b3]Also consider the work of Dr. Sanjeer Arora, Theoretical Computer Scientist with Princeton, MIT and UC Berkley. He found that regardless of the algorithm's elegance and complexity or the computer used for calculations, any solution reached will be no better than one arrived at by the human brain. In fact, a computer's solution would be no better than a 89% optimization of what a person could do. And it takes the computer a lot longer to reach its solution. See: MIC 99 - 111 Metaheuristics International Conference (Analyzing the Run-Time Behavior of Iterated[/COLOR] [COLOR=rgb(0, 0, 179)] Local Search for the TSP) Bottom line: Orion is useful. But if UPS is interested in mileage and time savings, nothing beats the human brain.[/COLOR][/FONT] [/QUOTE]
Insert quotes…
Verification
Post reply
Home
Forums
Brown Cafe UPS Forum
UPS Union Issues
ORION discipline
Top