That can not really help you, but here is a link to a web page (in french) with a java applet using this kind of algorithm to resolve the shortest route problem...

http://www.eudil.fr/~vmagnin/coursag/voyageur/voyageur.html


>Oh - great! Thanks for the offer. It seems there's a lot more to worry about in this process - which calls get assigned to each driver, for instance. How to divvy up a bunch of calls to a bunch of drivers so it fills their 8 hour workday while also minimizing each driver's travel distance...
>
>A lot to wrap my mind around right now... My application also requires that each driver must have a minimum expertise for each particular job... It's a field dispatch application...
>
>>Jenny(author) and I worked toghether on this project for the trucking company. So let me know if you need any further help...
>>
>>>Exactly right - much thanks!
>>>
>>>>It was in Sept,2001 FPA article. It is based on Genetic Algorithm. Right??
>>>>
>>>>>I seem to remember an article - probably in FPA - on a technique that used a brute force method to assign service calls to a team and figure out the shortest route for each technician.
>>>>>
>>>>>Can anyone point me to that issue? I can't seem to find it using my own brute force methods, and foxadvisor web searches came up blank.
>>>>>
>>>>>TIA