A discrete equal-capacity p-Median problem
dc.contributor.author | Marathe, Vikram | en |
dc.contributor.department | Industrial and Systems Engineering | en |
dc.date.accessioned | 2014-03-14T21:51:03Z | en |
dc.date.adate | 2009-12-05 | en |
dc.date.available | 2014-03-14T21:51:03Z | en |
dc.date.issued | 1992 | en |
dc.date.rdate | 2009-12-05 | en |
dc.date.sdate | 2009-12-05 | en |
dc.description.abstract | This thesis deals with the analysis of a discrete equal-capacity p-median problem, where the costs are directly proportional to the shipping distance and the amount shipped. A mixed integer programming formulation of the unbalanced, but equal capacitated case is analyzed. First we develop a dynamic programming procedure for a p-median problem on a chain graph. In the second part we develop an algorithm to solve a p-median problem on a general network. First a heuristic algorithm is used to obtain an upper bound on the problem. Next, we obtain a lower bound on the problem by solving a Lagrangian relaxation of a reformulated problem via a conjugate subgradient optimization procedure. We obtain Benders’ cuts from the above procedures and proceed to a modified Benders’ approach to solve the continuous relaxation of the original problem. Finally a branch-and-bound algorithm that enumerates over the location decision variable space is used to obtain an integer optimal solution. Computational experience is provided to demonstrate the efficacy of the algorithm. | en |
dc.description.degree | Master of Science | en |
dc.format.extent | viii, 105 leaves | en |
dc.format.medium | BTD | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.other | etd-12052009-020104 | en |
dc.identifier.sourceurl | http://scholar.lib.vt.edu/theses/available/etd-12052009-020104/ | en |
dc.identifier.uri | http://hdl.handle.net/10919/46134 | en |
dc.language.iso | en | en |
dc.publisher | Virginia Tech | en |
dc.relation.haspart | LD5655.V855_1992.M372.pdf | en |
dc.relation.isformatof | OCLC# 26354943 | en |
dc.rights | In Copyright | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject.lcc | LD5655.V855 1992.M372 | en |
dc.subject.lcsh | Mathematical optimization | en |
dc.title | A discrete equal-capacity p-Median problem | en |
dc.type | Thesis | en |
dc.type.dcmitype | Text | en |
thesis.degree.discipline | Industrial and Systems Engineering | en |
thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
thesis.degree.level | masters | en |
thesis.degree.name | Master of Science | en |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- LD5655.V855_1992.M372.pdf
- Size:
- 3.88 MB
- Format:
- Adobe Portable Document Format
- Description: