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...

Full description

Saved in:
Bibliographic Details
Main Authors: Pineda, Teodoro S., Jr., Lim, Charles O.
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
id oai:animorepository.dlsu.edu.ph:etd_bachelors-15632
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-156322021-11-21T03:40:08Z Heuristic warehouse location Pineda, Teodoro S., Jr. Lim, Charles O. 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. 1982-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/15119 Bachelor's Theses English Animo Repository Warehousing Heuristic programming
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Warehousing
Heuristic programming
spellingShingle Warehousing
Heuristic programming
Pineda, Teodoro S., Jr.
Lim, Charles O.
Heuristic warehouse location
description 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.
format text
author Pineda, Teodoro S., Jr.
Lim, Charles O.
author_facet Pineda, Teodoro S., Jr.
Lim, Charles O.
author_sort Pineda, Teodoro S., Jr.
title Heuristic warehouse location
title_short Heuristic warehouse location
title_full Heuristic warehouse location
title_fullStr Heuristic warehouse location
title_full_unstemmed Heuristic warehouse location
title_sort heuristic warehouse location
publisher Animo Repository
publishDate 1982
url https://animorepository.dlsu.edu.ph/etd_bachelors/15119
_version_ 1772834920128839680