Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

Re^4: Efficient Assignment of Many People To Many Locations?

by SmugX (Beadle)
on Feb 25, 2005 at 17:42 UTC ( [id://434589]=note: print w/replies, xml ) Need Help??


in reply to Re^3: Efficient Assignment of Many People To Many Locations?
in thread Efficient Assignment of Many People To Many Locations?

Ooh, no, I'm not being quite that complicated!

For the purposes of my problem, we can forget about times. Let's assume that each sales rep only has one call per day. My problem is merely about the best geographical assignment.

Cost of travel is tricky - althought nowhere near as tricky as in your situation. Most reps will hopefully not be travelling that far (if I can get this algorithm right!!!) and all will be travelling by car: hence, no plane scheduling problems, and no allowing for travelling by planes, trains or automobiles as appropriate.

Hence, I've boiled the scoring mechanism down to simply one of distance. (I'd love a way of estimating time to travel, because of course 50 miles up a motorway is slightly different to 50 miles straight across a town centre. However, whilst I'd love any help on this (I'm in the UK, if you're going to suggest any route-finding services), this is definitely out-of-scope for my original problem.)

Thanks again,
SmugX.

  • Comment on Re^4: Efficient Assignment of Many People To Many Locations?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://434589]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others taking refuge in the Monastery: (2)
As of 2024-04-19 20:57 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found