Opens sites S minimising sum_S f_j + sum_i w_i min_S d_ij: exact over all
subsets when 2^m - 1 <= max_enum, otherwise the Kuehn-Hamburger greedy add
followed by drop and swap moves.
Usage
FacilityLocation(
fixed_costs,
demand = NULL,
sites = NULL,
dist = NULL,
weights = NULL,
max_enum = 2e+05
)
Arguments
- fixed_costs
Fixed cost per site.
- demand, sites
Coordinate matrices (sites default to demand).
- dist
Demand-by-site distance matrix (instead of coordinates).
- weights
Demand weights.
- max_enum
Enumeration limit.
Value
list(sites, assignment, total, fixed, transport, method).
References
Kuehn, A. A. and Hamburger, M. J. (1963). A heuristic program
for locating warehouses. Management Science 9, 643-666.
Examples
FacilityLocation(c(1, 100, 1), rbind(c(0, 0), c(1, 0), c(10, 0)))$sites
#> [1] 1 3
