<?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: Location-Allocation equations in ArcGIS Network Analyst Questions</title>
    <link>https://community.esri.com/t5/arcgis-network-analyst-questions/location-allocation-equations/m-p/337288#M3225</link>
    <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;There is reference to&amp;nbsp;&lt;A class="link-titled" href="http://desktop.arcgis.com/en/arcmap/latest/extensions/network-analyst/algorithms-used-by-network-analyst.htm" title="http://desktop.arcgis.com/en/arcmap/latest/extensions/network-analyst/algorithms-used-by-network-analyst.htm"&gt;Algorithms used by the ArcGIS Network Analyst extension—Help | ArcGIS for Desktop&lt;/A&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Which for your case ...&amp;nbsp;&lt;A class="link-titled" href="http://desktop.arcgis.com/en/arcmap/latest/extensions/network-analyst/algorithms-used-by-network-analyst.htm#ESRI_SECTION1_6FFC9C48F24746E182082F5DEBDBAA92" title="http://desktop.arcgis.com/en/arcmap/latest/extensions/network-analyst/algorithms-used-by-network-analyst.htm#ESRI_SECTION1_6FFC9C48F24746E182082F5DEBDBAA92"&gt;Algorithms used by the ArcGIS Network Analyst extension—Help | ArcGIS for Desktop&lt;/A&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;which cites&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;The location-allocation solver starts by generating an origin-destination matrix of shortest-path costs between all the facilities and demand point locations along the network. It then constructs an edited version of the cost matrix by a process known as Hillsman editing. This editing process enables the same overall solver heuristic to solve a variety of different problem types. The location-allocation solver then generates a set of semirandomized solutions and applies a vertex substitution heuristic (&lt;STRONG&gt;Teitz and Bart&lt;/STRONG&gt;) to refine these solutions creating a group of good solutions. A metaheuristic then combines this group of ....&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Since I knew I had heard this before and that the actual references weren't in the help.... this brought me back to a page that gives them from &amp;nbsp;&lt;A href="https://community.esri.com/migrated-users/3160"&gt;Jay Sandhu&lt;/A&gt;&amp;nbsp;a more authoritive reference.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;A href="https://community.esri.com/thread/174520"&gt;Algorithm used by location-allocation (Maximize Coverage problem type)&lt;/A&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;But I will copy a portion of his response for posterity.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;"....&lt;/P&gt;&lt;P&gt;Here is a reference to the original paper by Ed Hillsman:&lt;BR /&gt;Hillsman, E.L. (1984). The p-median structure as a unified linear model for location-allocation analysis. Environment and Planning A, 16 (3), 305-318&lt;BR /&gt; &lt;BR /&gt;And here is another researcher using a similar approach:&lt;BR /&gt;&lt;A href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.4638&amp;amp;rep=rep1&amp;amp;type=pdf"&gt;http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.4638&amp;amp;rep=rep1&amp;amp;type=pdf&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;..."&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
    <pubDate>Thu, 03 Nov 2016 21:52:59 GMT</pubDate>
    <dc:creator>DanPatterson_Retired</dc:creator>
    <dc:date>2016-11-03T21:52:59Z</dc:date>
    <item>
      <title>Location-Allocation equations</title>
      <link>https://community.esri.com/t5/arcgis-network-analyst-questions/location-allocation-equations/m-p/337287#M3224</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;Hi everyone,&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Are the governing equations for the location-allocation tool available on official ArcGIS (or related) sources?&lt;/P&gt;&lt;P&gt;I'd like to see the math behind, not really the script.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Thank you very much.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Alessandro&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 03 Nov 2016 16:21:55 GMT</pubDate>
      <guid>https://community.esri.com/t5/arcgis-network-analyst-questions/location-allocation-equations/m-p/337287#M3224</guid>
      <dc:creator>AlessandroSinglitico</dc:creator>
      <dc:date>2016-11-03T16:21:55Z</dc:date>
    </item>
    <item>
      <title>Re: Location-Allocation equations</title>
      <link>https://community.esri.com/t5/arcgis-network-analyst-questions/location-allocation-equations/m-p/337288#M3225</link>
      <description>&lt;HTML&gt;&lt;HEAD&gt;&lt;/HEAD&gt;&lt;BODY&gt;&lt;P&gt;There is reference to&amp;nbsp;&lt;A class="link-titled" href="http://desktop.arcgis.com/en/arcmap/latest/extensions/network-analyst/algorithms-used-by-network-analyst.htm" title="http://desktop.arcgis.com/en/arcmap/latest/extensions/network-analyst/algorithms-used-by-network-analyst.htm"&gt;Algorithms used by the ArcGIS Network Analyst extension—Help | ArcGIS for Desktop&lt;/A&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Which for your case ...&amp;nbsp;&lt;A class="link-titled" href="http://desktop.arcgis.com/en/arcmap/latest/extensions/network-analyst/algorithms-used-by-network-analyst.htm#ESRI_SECTION1_6FFC9C48F24746E182082F5DEBDBAA92" title="http://desktop.arcgis.com/en/arcmap/latest/extensions/network-analyst/algorithms-used-by-network-analyst.htm#ESRI_SECTION1_6FFC9C48F24746E182082F5DEBDBAA92"&gt;Algorithms used by the ArcGIS Network Analyst extension—Help | ArcGIS for Desktop&lt;/A&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;which cites&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;The location-allocation solver starts by generating an origin-destination matrix of shortest-path costs between all the facilities and demand point locations along the network. It then constructs an edited version of the cost matrix by a process known as Hillsman editing. This editing process enables the same overall solver heuristic to solve a variety of different problem types. The location-allocation solver then generates a set of semirandomized solutions and applies a vertex substitution heuristic (&lt;STRONG&gt;Teitz and Bart&lt;/STRONG&gt;) to refine these solutions creating a group of good solutions. A metaheuristic then combines this group of ....&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;Since I knew I had heard this before and that the actual references weren't in the help.... this brought me back to a page that gives them from &amp;nbsp;&lt;A href="https://community.esri.com/migrated-users/3160"&gt;Jay Sandhu&lt;/A&gt;&amp;nbsp;a more authoritive reference.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;&lt;A href="https://community.esri.com/thread/174520"&gt;Algorithm used by location-allocation (Maximize Coverage problem type)&lt;/A&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;But I will copy a portion of his response for posterity.&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;"....&lt;/P&gt;&lt;P&gt;Here is a reference to the original paper by Ed Hillsman:&lt;BR /&gt;Hillsman, E.L. (1984). The p-median structure as a unified linear model for location-allocation analysis. Environment and Planning A, 16 (3), 305-318&lt;BR /&gt; &lt;BR /&gt;And here is another researcher using a similar approach:&lt;BR /&gt;&lt;A href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.4638&amp;amp;rep=rep1&amp;amp;type=pdf"&gt;http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.26.4638&amp;amp;rep=rep1&amp;amp;type=pdf&lt;/A&gt;&lt;/P&gt;&lt;P&gt;&lt;/P&gt;&lt;P&gt;..."&lt;/P&gt;&lt;/BODY&gt;&lt;/HTML&gt;</description>
      <pubDate>Thu, 03 Nov 2016 21:52:59 GMT</pubDate>
      <guid>https://community.esri.com/t5/arcgis-network-analyst-questions/location-allocation-equations/m-p/337288#M3225</guid>
      <dc:creator>DanPatterson_Retired</dc:creator>
      <dc:date>2016-11-03T21:52:59Z</dc:date>
    </item>
  </channel>
</rss>

