Subj : Re: Travelling Salesman problem -- Finding shortest path in ship warehouse
To   : comp.programming
From : Boris
Date : Mon Aug 15 2005 12:38 pm

The definition of 'Overall distance' is the distance from start point
to end point (which are same). So, the shipper may go to any aisle
first, but the overall walking dstance should be minimum when he gets
back to the start position.

The only hesitation I have is that in TSP, you must visit every
location once. In my problem, you don't have to because of OPTIONS of
going to one of multiple location for certain items.

Thanks,
Boris

Duane Bozarth wrote:
> Boris wrote:
> >
> ...
> > In a shipping warehouse, items need to be picked from the shelved on
> > different aisle of the warehouse (Aisles and shelves are similart to
> > grocery store aisles). However, an item may be found on multiple
> > locations. ... [otoh] There
> > are some item that exist in only one location. ...
> >
> > All I have to do is to highlight the location of the shelves that need
> > to be visited. But I need to highlight in a way that overall distance
> > should be minimum. The starting point and end point are the same.
> ...
> > 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.
>
> At least one question first...does the definition of "overall distance"
> include aisle length or simply the number and relative spacing between
> aisles?
>
> Either way, it seems like a form of the salesman problem to me.
> 
> (And sorry for what may be an empty post...)

.