go ahead... be a heretic | |
PerlMonks |
Re^3: Efficient Assignment of Many People To Many Locations?by dragonchild (Archbishop) |
on Feb 25, 2005 at 17:21 UTC ( [id://434579]=note: print w/replies, xml ) | Need Help?? |
Now, I think I'm understanding your problem better. The actual problem isn't so much the assignment of sales calls as the scheduling of sales calls. Let me rephrase it, if you don't mind:
The question is how to optimize the assignment of the arrival times at each location. For example, let's say you have two sales calls in the same building, each expected to take an hour. You can assign them both to the same salesrep and schedule one for 9am and the other for 10.30 am. Of course, I haven't seen a good definition for the cost of travel. For example, it takes longer to go from Albany to New York vs. Philadelphia to New York, even though Albany is closer. The reason is that there is excellent train service to/from Philly, but only highways to/from Albany. And, if you want to be useful, you need to take into account plane schedules (though you could assume that everyone takes the red-eye, but you won't be popular after a few months). You may also want to estimate the expected ROI for a sales call. For example, if you expect $1000 of business from a call, but the salesrep's time is worth $320 ($40/hr) and it costs $600 to get there, is that salescall worth it? But, I think we're getting too complicated. Essentially, this is really starting to approach the travelling salesman problem in complexity. Being right, does not endow the right to be rude; politeness costs nothing.
In Section
Seekers of Perl Wisdom
|
|