• Re: Traveling Salesman problem

    From =?UTF-8?Q?V_=C3=B5_l_u_r?=@21:1/5 to Jake Stern on Mon Jun 19 18:53:27 2023
    Why does the salesman have to travel, when he can sell everything from home ?


    On Thursday, February 13, 2003 at 7:47:59 PM UTC+2, Jake Stern wrote:
    Does anyone have any experience with implementing a traveling salesmen
    solver in Labview, or interfacing with a publicly available .dll? I
    would like to optimize the path of a semiconductor test tool. When
    running tests that probe many devices all over the wafer, the default
    pattern that we currently use is far from the most efficient. It is unnecessary that THE optimal solution is found, but a heuristic that
    does better than simply going to the leftmost column that contains a
    device in the test, going top to bottom, then moving right to the next column, etc. would be nice.
    Some tests have very few devices, and could even be solved
    brute-force. However, some tests involve 30, 50, or even up to 200
    locations, and these could be estimated with a decent heuristic.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)