Open Table of Contents

Allocation

Allocates a set of demand points (Customers) to user specified number of supply points (Facilities) out of a Facilities point dataset based on the Euclidian distance between the Customers and Facilities. In other words the function selects N Facilities out of K candidates to service a set of M Customer locations in such a way that each Customer is allocated to a single Facility (based on Euclidean distance) and the total distance between the Customers and selected Facilities is minimized.

The function uses heuristic vertex substitution algorithm modified from Teitz and  Bart (1968) and can handle comparatively large problems (Number of Customers * Number Facilities < 5 Million)

Inputs:

Outputs:

Illustration:
Input Facilities and Customers - No required facilities Result (Selected facilities in green)
Input Facilities and Customers - Two required facilities Result (Selected facilities in green)

Notes:

References: