Hello!
I need an idea to following problem:
Given: 300 shops, 800.000 customers
Problem:
250.000 customers should be assigned to the shops, optimized via distance.
There are different classes of shops (A,B,C,D) with different amounts of customers to assign (A=1000, B=500, C=300, D=100).
In some areas are a lot of shops in a small circle.
My first solution is:
1. Estimation of distance to nearest shop.
2. Order customers with sorting by shops and distance to nearest shop with the lowest amount of potential costumers first.
3. Select correct amount of costumers with nearest shop considering this sorting and the amount in classes.
After that I got 83% correct classification, 83% of the customers are assigned to the nearest shop. In 17% are assigned to other shops (second best, third best, ...). The Problem is to achiev the correct amount of costumers in the classes. It is not possible to become 100% correct assignments ... but I think it is possible to get more then 83%. You can see it in a map.
Any idea to do it in a job and not 'hand-made'?
Thank you and greetings,
Martin