Balanced, capacitated, location-allocation problems on networks with a continuum of demand

Simple item page
dc.contributor.authorNordai, Frederick Leonen
dc.contributor.committeechairSherali, Hanifen
dc.contributor.committeememberDisney, Ralph L.en
dc.contributor.committeememberJohnson, Lee W.en
dc.contributor.committeememberMalmborg, Charles J.en
dc.contributor.committeememberNachlas, Joel A.en
dc.contributor.departmentIndustrial Engineering and Operations Researchen
dc.date.accessioned2015-07-09T20:43:40Zen
dc.date.available2015-07-09T20:43:40Zen
dc.date.issued1985en
dc.description.abstractLocation-allocation problems can be described generically as follows: Given the location or distribution (perhaps, probabilistic) of a set of customers and their associated demands for a given product or service, determine the optimum location of a number of service facilities and the allocation of products or services from facilities to customers, so as to minimize total (expected) location and transportation costs. This study is concerned with a particular subclass of location-allocation problems involving capacitated facilities and a continuum of demand. Specifically, two minisum, network-based location-allocation problems are analyzed in which facilities having known finite capacities are to be located so as to optimally supply/serve a known continuum of demand. The first problem considered herein, is an absolute p-median problem in which p > l capacitated facilities are to be located on a chain graph having both nodal and link demands, the latter of which are defined by nonnegative, integrable demand functions. In addition, the problem is balanced, in that it is assumed the total demand equals the total supply. An exact solution procedure is developed, wherein the optimality of a certain location-allocation scheme (for any given ordering of the facilities) is used to effect a branch and bound approach by which one can identify an optimal solution to the problem. Results from the chain graph analysis are then used to develop an algorithm with which one can solve a dynamic, sequential location-allocation problem in which a single facility per period is required to be located on the chain. Finally, an exact solution procedure is developed for locating a capacitated, absolute 2-median on a tree graph having both nodal and link demands and for which the total demand is again equal to the total supply. This procedure utilizes an algorithm to construct two subtrees, each of whose ends constitute a set of candidate optimal locations for one of the two elements of an absolute 2-median. Additional localization results are used to further reduce the number of candidate pairs (of ends) that need to be considered, and then a post-localization analysis provides efficient methods of comparing the relative costs of the remaining pairs.en
dc.description.degreePh. D.en
dc.format.extentix, 205 leavesen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/10919/54313en
dc.language.isoen_USen
dc.publisherVirginia Polytechnic Institute and State Universityen
dc.relation.isformatofOCLC# 12867517en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V856 1985.N672en
dc.subject.lcshNetwork analysis (Planning)en
dc.subject.lcshResource allocation -- Mathematical modelsen
dc.subject.lcshSupply and demand -- Mathematical modelsen
dc.titleBalanced, capacitated, location-allocation problems on networks with a continuum of demanden
dc.typeDissertationen
dc.type.dcmitypeTexten
thesis.degree.disciplineIndustrial Engineering and Operations Researchen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.leveldoctoralen
thesis.degree.namePh. D.en

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V856_1985.N672.pdf
Size:
6.29 MB
Format:
Adobe Portable Document Format
Download

Collections

Doctoral Dissertations