Large Region Location Problems.

摘要

The study describes a number of algorithms for solving single facility deterministic location problems in which the planar assumption is not appropriate. Transformations on the non-Euclidean spherical space are combined with efficient solution techniques in En. Extensive use is made of projective, synthetic and analytic geometry. Two algorithms are presented for solving single facility problems with the objective of minimizing the total sum of costs (minisum). Due to the non-convex nature of the problem, a local optimum is obtained. Computational experience in solving a number of test problems is reported. Theoretical results concerning narrowing of the search region are presented as well as a number of special properties of the problem. Application of the single facility results to the location-allocation class of multifacility minisum problem is investigated.