ALGORITHMIC AND TECHNICAL IMPROVEMENTS: OPTIMAL SOLUTIONS TO THE (GENERALIZED) MULTI‐WEBER PROBLEM
Kenneth E. Rosing, Britton Harris · Papers of the Regional Science Association · 1992
ABSTRACT Rosing has recently demonstrated a new method for obtaining optimal solutions to the (Generalized) Multi-Weber Problem and proved the optimally of the results. The method develops all convex hulls and then covers the destinations with disjoint convex hulls. This paper seeks to improve implementation of the algorithm to make such solutions economically attractive. Four areas are considered: sharper decision rules to eliminate unnecessary searching, bit pattern matching as a method of recording a history and eliminating duplication, vector intrinsic functions to speed up comparisons, and profiling a program to maximize operating efficiency. Computational experience is also presented.