<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: Shop-Customer-Assignment in Mathematical Optimization, Discrete-Event Simulation, and OR</title>
    <link>https://communities.sas.com/t5/Mathematical-Optimization/Shop-Customer-Assignment/m-p/70229#M512</link>
    <description>How come the class quantities don't add to 250,000?</description>
    <pubDate>Sat, 19 Sep 2009 03:38:47 GMT</pubDate>
    <dc:creator>RAAgnew</dc:creator>
    <dc:date>2009-09-19T03:38:47Z</dc:date>
    <item>
      <title>Shop-Customer-Assignment</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Shop-Customer-Assignment/m-p/70227#M510</link>
      <description>Hello!&lt;BR /&gt;
&lt;BR /&gt;
I need an idea to following problem:&lt;BR /&gt;
&lt;BR /&gt;
Given: 300 shops, 800.000 customers&lt;BR /&gt;
&lt;BR /&gt;
Problem:&lt;BR /&gt;
&lt;BR /&gt;
250.000 customers should be assigned to the shops, optimized via distance.&lt;BR /&gt;
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).&lt;BR /&gt;
&lt;BR /&gt;
In some areas are a lot of shops in a small circle.&lt;BR /&gt;
&lt;BR /&gt;
My first solution is: &lt;BR /&gt;
1. Estimation of distance to nearest shop.&lt;BR /&gt;
2. Order customers with sorting by shops and distance to nearest shop with the lowest amount of potential costumers first.&lt;BR /&gt;
3. Select correct amount of costumers with nearest shop considering this sorting and the amount in classes.&lt;BR /&gt;
&lt;BR /&gt;
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.&lt;BR /&gt;
&lt;BR /&gt;
Any idea to do it in a job and not 'hand-made'?&lt;BR /&gt;
&lt;BR /&gt;
Thank you and greetings,&lt;BR /&gt;
&lt;BR /&gt;
Martin</description>
      <pubDate>Wed, 09 Sep 2009 09:13:54 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Shop-Customer-Assignment/m-p/70227#M510</guid>
      <dc:creator>deleted_user</dc:creator>
      <dc:date>2009-09-09T09:13:54Z</dc:date>
    </item>
    <item>
      <title>Re: Shop-Customer-Assignment</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Shop-Customer-Assignment/m-p/70228#M511</link>
      <description>Unstated, but presumably you have zip code?  You will find useful technical and conference topic-related reference information as well as SAS-hosted documentation at the SAS support  &lt;A href="http://support.sas.com/" target="_blank"&gt;http://support.sas.com/&lt;/A&gt;  website.&lt;BR /&gt;
&lt;BR /&gt;
Scott Barry&lt;BR /&gt;
SBBWorks, Inc.&lt;BR /&gt;
&lt;BR /&gt;
Usage Note 5325: Calculating the distance between ZIP codes&lt;BR /&gt;
&lt;A href="http://support.sas.com/kb/5/325.html" target="_blank"&gt;http://support.sas.com/kb/5/325.html&lt;/A&gt;</description>
      <pubDate>Wed, 09 Sep 2009 11:20:36 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Shop-Customer-Assignment/m-p/70228#M511</guid>
      <dc:creator>sbb</dc:creator>
      <dc:date>2009-09-09T11:20:36Z</dc:date>
    </item>
    <item>
      <title>Re: Shop-Customer-Assignment</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Shop-Customer-Assignment/m-p/70229#M512</link>
      <description>How come the class quantities don't add to 250,000?</description>
      <pubDate>Sat, 19 Sep 2009 03:38:47 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Shop-Customer-Assignment/m-p/70229#M512</guid>
      <dc:creator>RAAgnew</dc:creator>
      <dc:date>2009-09-19T03:38:47Z</dc:date>
    </item>
    <item>
      <title>Re: Shop-Customer-Assignment</title>
      <link>https://communities.sas.com/t5/Mathematical-Optimization/Shop-Customer-Assignment/m-p/70230#M513</link>
      <description>In sum there are 250.000, but 17% are not signed to the nearest shop. &lt;BR /&gt;
&lt;BR /&gt;
The cause is, if there are a lot of shops at the same location and I firstly fill up the shops with a small costumer density around, I get a lot of wrong classifications. I think I need a re-classification in a second step to change some customers between the shops.</description>
      <pubDate>Thu, 24 Sep 2009 12:38:26 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Mathematical-Optimization/Shop-Customer-Assignment/m-p/70230#M513</guid>
      <dc:creator>deleted_user</dc:creator>
      <dc:date>2009-09-24T12:38:26Z</dc:date>
    </item>
  </channel>
</rss>

