A dynamic programming algorithm is presented to locate m variable facilities in relation to n existing facilities situated on one route. Each of the n existing facilities has a requirement flow which must be supplied by the variable facilities. The algorithm does the allocation simultaneously...

The distances used in certain types of industrial, office or street grid layouts are often assumed to be rectangular. Because of the "doubling back" effect caused by finite block and facility sizes, actual distances travelled are often much greater than indicated by the l₁ norm. In this study...

Two geometric approaches to solving sequencing problems are described and tested. Both methods have yielded optimal or near optimal solutions in problems where the optimal is known. Further, these methods have the advantage of being programmable, with execution in relatively short computation...

Some management science models require estimates of distances between points in a road network based on the point coordinates. This paper evaluates the accuracy of a range of reasonable forms for distance estimating functions using samples of urban and rural road distances. The intent is to...

This article develops the dual program corresponding to a hyperbolic approximation, of the constrained multi-facility location model using l_p distances. The dual program is original and is a contribution to the theory of facilities location as well as providing a new efficient method of...