A Survey of Solution Methods for the Continuous Location-Allocation Problem

Abstract

Abstract⎯In this survey, we examine an important class of facility location problems known as the multisource Weber problem (also referred to as the continuous location-allocation problem). We also show how recent advances in the use of metaheuristic rules have significantly improved the ability to solve problems of this type. The new solution methods are discussed for both the well known multisource Weber problem and its counterpart the capacitated case. Research issues which we believe to be worthwhile exploring in future are also highlighted. Keywords⎯Location, Continuous space, Heuristics 1.

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 — 95 citations exist upstream.

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