transporter travel problem

hello!
I want to simulate order-picking problem in a warehouse.
I've build a model that have many Queues, each Queue linked to own network node.
So that I design a routing network for transporter.

The problem is when transporter reveive the order(means many ports),
how can I control the transporter to caculate the total minimun travel distance of this order automatically?
So that transporter can adjust the picking sequence(like Travelling salesman problem).

Thanks...

Nicky,

that is a nice question. It looks like a work for several hours or even days.
My first approach would be to wait a certain time, collect the different tasksequences in one dispatcher. Then i close the collecting and sort the loading station to distance of travel. Then I choose the closest station and search for the next station closest to that station. And so on. Another appraoch would be to cluster stations which are not far apart. After building a travel list. I would change the priority of the tasksequences corresponding to the list and dispatch or move the tasksequences to one operator and let flexsim do the work.

Jörg

thanks Jörg Vogel

I'm not quite understand your reply.
My idea is calculate the shortest distance of each Queue to Queue.
I've study your reply "http://www.flexsim.com/community/for...ead.php?t=2024". But I didn't success on Sink OnEntry Trigger this part.
If I can calculate the shortest distance of each Queue to Queue.
That I can use it to write heuristic program to get the tasksequence.
Then I can continue the flexsim part.

Or there are other better approach?
thanks you!