A discrete equal-capacity p-Median problem

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.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

masters

Discipline thesis:degree_discipline

Industrial and Systems Engineering

Department dc:contributor.department

Industrial and Systems Engineering

Grantor dc:publisher

Virginia Tech

Year dc:date.issued

1992

Author dc:creator

• Marathe, Vikram

Statement dc:rights

• In Copyright

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Language dc:language.iso

en

Dc Identifier Other

etd-12052009-020104

OAI identifier oai:identifier

oai:vtechworks.lib.vt.edu:10919/46134