Subj : Re: Travelling Salesman problem -- Finding shortest path in ship warehouse
To   : comp.programming
From : Gerry Quinn
Date : Tue Aug 16 2005 12:14 pm

In article <1124129292.572649.51750@f14g2000cwb.googlegroups.com>, 
supermanreloaded@gmail.com says...
> 
> Because I do not need to tell them the walking route, I do not think it
> is a travelling salesman problem, but I may be wrong. I would really
> appreciate for any help to generate an algorithm of my problem.

It's a complicated variation on the travelling salesman problem.  The 
same principles will apply, i.e. there is no general solution except 
exhaustive search, so for non-trivial problems you will need to use 
some probabilistic method (simulated annealling was suggested, and 
should be suitable) to find a 'good' solution.

- Gerry Quinn

.