A Heuristic Programming Algorithm for Warehouse Location
- 1 December 1970
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 2 (4) , 334-339
- https://doi.org/10.1080/05695557008974773
Abstract
A new heuristic programming method of solving a particular type of warehouse location problem is presented. The problem is to allocate K or less facilities to N possible locations so as to service M demand centers at minimum cost. The algorithm presented is suitable for hand calculation of medium-size problems (50 × 50) or when computerized will readily solve large-scale problems of the order of (600 × 600); i.e., 600 demand centers and 600 possible locations.Keywords
This publication has 16 references indexed in Scilit:
- A branch‐bound algorithm for the capacitated facilities location problemNaval Research Logistics Quarterly, 1969
- A Dynamic Programming Algorithm for Facility Location and AllocationA I I E Transactions, 1969
- A Branch-Bound Algorithm for Plant LocationOperations Research, 1966
- Warehouse Location Under Continuous Economies of ScaleManagement Science, 1966
- Siting a Distribution Centre, An Analogue Computer ApplicationManagement Science, 1966
- Plant Location Under Economies-of-Scale—Decentralization and ComputationManagement Science, 1964
- THE SITING OF DEPOTSInternational Journal of Production Research, 1963
- Evaluation of Transport Costs for Alternative Factory Sites — A Case StudyJournal of the Operational Research Society, 1962
- Fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1961
- A Warehouse-Location ProblemOperations Research, 1958