Heuristic warehouse location
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 c...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1982
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/15119 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| 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. |
|---|