Optimising the Location‐Allocation Problem with Multiple Objectives

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.

[1]  H. Simon,et al.  A Behavioral Model of Rational Choice , 1955 .

[2]  W. Baumol,et al.  A Warehouse-Location Problem , 1958 .

[3]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[4]  L. Cooper.  Location-Allocation Problems , 1963 .

[5]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[6]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[7]  Leon Cooper,et al.  An approximate solution method for the fixed charge problem , 1967 .

[8]  佐藤 宗弥.  Yuji Ijiri,Management Goals and Accounting for Control, Amsterdam, 1965 , 1967 .

[9]  D. H. Marks,et al.  An Analysis of Private and Public Sector Location Models , 1970 .

[10]  D. I. Steinberg,et al.  The fixed charge problem , 1970 .

[11]  P. Gray,et al.  Solving Fixed Charge Location-Allocation Problems with Capacity and Configuration Constraints , 1971 .

[12]  Edward R. Clayton,et al.  A Goal Programming Model for Academic Resource Allocation , 1972 .

[13]  Sang M. Lee,et al.  Goal programming for decision analysis , 1972 .

[14]  Sang M. Lee,et al.  Optimizing the Portfolio Selection for Mutual Funds , 1973 .

[15]  Sang M. Lee,et al.  Goal Programming for Marketing Decisions: A Case Study , 1974 .

[16]  Sang M. Lee,et al.  Goal Programming for Marketing Decisions: A Case Study , 1974 .

[17]  K. R. Student.  Cost vs. human values in plant location , 1976 .

[18]  W. Walker.  A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem , 1976 .

[19]  Gilles Muratet,et al.  Optimal Location of Plants , 1976 .

[20]  J. Kennington.  The Fixed-Charge Transportation Problem: A Computational Study with a Branch-and-Bound Code , 1976 .

[21]  Keith G. Lockyer,et al.  A practical approach to production scheduling , 1979 .