Modeling and solving variations of the Network Loading Problem

Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, 2002.Includes bibliographical references (p. 146-149).We examine three variations of a class of network design problems known as Network Loading Problems (NLP). For'each variation we develop a tailored branch and bound solution approach equipped with heuristic procedures and problem specific cutting planes. The first variation formulates a logistics problem known as Pup Matching that involves matching semitrailers to cabs that are able to tow one or two of the trailers simultaneously. Theoretically, we show that four heuristics each yield a 2-approximation and we specify facet defining conditions for a cut family that we refer to as odd flow inequalities. Computationally, we solved to optimality 67 percent of test instances randomly generated from realistic data. The average minimum heuristic error among solved instances was 1.3 percent. Cutting planes reduced the average relative difference between upper and lower bounds prior to branching from 18.8 percent to 6.4 percent. The second problem variation concerns three NLP generalizations (segregated, nested, and general compartments) that we refer to collectively as Compartmentalized Network Loading (CNLP). We model these problems, extend to the case of segregated compartments convex hull results of Magnanti, Mirchandani, and Vachani on single arc and three node problems, and employ the routine of Atamtiirk and Rajan to efficiently separate certain (residual capacity) inequalities for all three CNLP models.(cont.) On randomly generated instances, we conducted four series of tests designed to isolate the computational impact of problem parameters including graph density and model type. The third variation, Single Commodity Network Loading (SCNLP), requires loading discrete capacity units sufficient to satisfy the demand for standard network flow (multiple source, multiple destination problem). We cast the limiting case of large capacity within the constrained forest framework of Goemans and Williamson, characterize the optimal solution to the single cut special case, and describe cutset, residual capacity, and three partition inequalities for this variation. We solved five randomly generated 15 node SCNLP instances in an average of 19.1 CPU seconds, but only three of five similarly defined NLP instances.by John M. Bossert.Ph.D