Decomposition strategies for large-scale continuous location–allocation problems

Abstract

The continuous location–allocation problem requires finding sites for m new facilities in the plane in order to serve n users such that the total transportation costs are minimized. Several heuristics have been developed to solve this well-studied global optimization problem. However, little work has been done using decomposition techniques. In this paper, we examine a few new ways to decompose the location–allocation problem. These strategies are then embedded in a variable neighbourhood decomposition search heuristic and tested on large instances of this problem.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 33 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.