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
Orian= the new EDD???
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="pretzel_man" data-source="post: 788326" data-attributes="member: 927"><p>Sober,</p><p> </p><p>Actually, its a bad analogy, but for a much different reason. The point of the analogy was just to say never rule things out....</p><p> </p><p>The delivery problem is not unique:</p><p> </p><p><span style="color: blue">The <strong>Travelling Salesman Problem</strong> (<strong>TSP</strong>) is an </span><a href="http://en.wikipedia.org/wiki/NP-hard" target="_blank"><span style="color: blue">NP-hard</span></a><span style="color: blue"> problem in </span><a href="http://en.wikipedia.org/wiki/Combinatorial_optimization" target="_blank"><span style="color: blue">combinatorial optimization</span></a><span style="color: blue"> studied in </span><a href="http://en.wikipedia.org/wiki/Operations_research" target="_blank"><span style="color: blue">operations research</span></a><span style="color: blue"> and </span><a href="http://en.wikipedia.org/wiki/Theoretical_computer_science" target="_blank"><span style="color: blue">theoretical computer science</span></a><span style="color: blue">. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once.</span></p><p><span style="color: blue">The problem was first formulated as a mathematical problem in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of </span><a href="http://en.wikipedia.org/wiki/Heuristics" target="_blank"><span style="color: blue">heuristics</span></a><span style="color: blue"> and exact methods are known, so that some instances with tens of thousands of cities can be solved.</span></p><p> </p><p>Remember, 300 drivers are using this today.... Never say never.</p></blockquote><p></p>
[QUOTE="pretzel_man, post: 788326, member: 927"] Sober, Actually, its a bad analogy, but for a much different reason. The point of the analogy was just to say never rule things out.... The delivery problem is not unique: [COLOR=blue]The [B]Travelling Salesman Problem[/B] ([B]TSP[/B]) is an [/COLOR][URL="http://en.wikipedia.org/wiki/NP-hard"][COLOR=blue]NP-hard[/COLOR][/URL][COLOR=blue] problem in [/COLOR][URL="http://en.wikipedia.org/wiki/Combinatorial_optimization"][COLOR=blue]combinatorial optimization[/COLOR][/URL][COLOR=blue] studied in [/COLOR][URL="http://en.wikipedia.org/wiki/Operations_research"][COLOR=blue]operations research[/COLOR][/URL][COLOR=blue] and [/COLOR][URL="http://en.wikipedia.org/wiki/Theoretical_computer_science"][COLOR=blue]theoretical computer science[/COLOR][/URL][COLOR=blue]. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once.[/COLOR] [COLOR=blue]The problem was first formulated as a mathematical problem in 1930 and is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of [/COLOR][URL="http://en.wikipedia.org/wiki/Heuristics"][COLOR=blue]heuristics[/COLOR][/URL][COLOR=blue] and exact methods are known, so that some instances with tens of thousands of cities can be solved.[/COLOR] Remember, 300 drivers are using this today.... Never say never. [/QUOTE]
Insert quotes…
Verification
Post reply
Home
Forums
Brown Cafe UPS Forum
UPS Discussions
Orian= the new EDD???
Top