Optimising the Location‐Allocation Problem with Multiple Objectives
- 1 March 1979
- journal article
- Published by Emerald Publishing in International Journal of Physical Distribution & Materials Management
- Vol. 9 (6) , 245-255
- https://doi.org/10.1108/eb014448
Abstract
The location‐allocation problem involves multiple shipping destinations, with known demands for a given product and known transportation costs from sources to destinations. The problem is to determine the number of facilities and their locations in order to best service the shipping destinations. This paper presents an approach to facility location which allows the analysis of multiple conflicting goals as an extension of previous solution approaches. Specifically, the paper applies the branch and bound integer goal programming approach to the location‐allocation problem.Keywords
This publication has 15 references indexed in Scilit:
- Optimal Location of PlantsManagement Science, 1976
- Cost vs. human values in plant locationBusiness Horizons, 1976
- Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration ConstraintsA I I E Transactions, 1971
- An Analysis of Private and Public Sector Location ModelsManagement Science, 1970
- A Branch-Bound Algorithm for Plant LocationOperations Research, 1966
- Warehouse Location Under Continuous Economies of ScaleManagement Science, 1966
- A Heuristic Program for Locating WarehousesManagement Science, 1963
- Location-Allocation ProblemsOperations Research, 1963
- A Warehouse-Location ProblemOperations Research, 1958
- A Behavioral Model of Rational ChoiceThe Quarterly Journal of Economics, 1955