drich@klaatu.lanl.gov (David O. Rich) (05/29/90)
I'm looking for a CL implementation of a variation of the travelling salesperson problem, where the optimal tour avoids a set of known obstacles. Let O be the set of obstacles (perhaps simple geometric figures), N be the set of nodes (cities). The problem is to find the minimum cost tour from N1 to N2 which visits every Ni in T, a subset of N, and the edges avoid intersections with the members of O. -- ============================================================= David Rich | Military Systems Analysis Group (A-5) Email: dor@lanl.gov | Los Alamos National Laboratory Phone: (505) 665-0726 | Los Alamos, NM 87545 <><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>< "This is my job, not my life." --R. Pecherer (LANL) =============================================================