Heuristic warehouse location
Date of Publication
1982
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Applied Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
The aim of this paper is to discuss a heuristic method of solving a warehouse location problem and consequently, apply the method to real-world situation. This method determines for a prescribed distribution network, the optimal number of warehouses and their locations that will minimize the total costs incurred (fixed costs, variable warehousing costs, inventory costs and transportation costs). The topics discussed in the thesis include the following: Heuristic programming, integer programming and simulation techniques. There are two sample problems and a computer program for the heuristic method.
Abstract Format
html
Language
English
Format
Accession Number
TU02806
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
68 leaves
Keywords
Warehousing; Heuristic programming
Recommended Citation
Pineda, T. S., & Lim, C. O. (1982). Heuristic warehouse location. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/15119
