Pup Matching: Model Formulations and Solution Approaches
Name
HPCES016.pdf
Size
201.07 KB
Format
Adobe PDF
Checksum (MD5)
7f5d204f4eff66e3295f9339e59bf14a
Author(s)
Bossert, J.M.
Magnanti, Thomas L.
Date Issued
January 2002
Series/Report no.
High Performance Computation for Engineered Systems (HPCES);
Abstract
We model Pup Matching, the logistics problem of matching or pairing semitrailers known as pups to cabs able to tow one or two pups simultaneously, as an NP-complete version of the Network Loading Problem (NLP). We examine a branch and bound solution approach tailored to the NLP formulation through the use of three families of cutting planes and four heuristic procedures. Theoretically, we specify facet defining conditions for a cut family that we refer to as odd flow inequalities and show that each heuristic yields a 2-approximation. Computationally, the cheapest of the four heuristic values achieved an average error of 1.3% among solved test problems randomly generated from realistic data. The branch and bound method solved to optimality 67% of these problems. Application of the cutting plane families reduced the average relative difference between upper and lower bounds prior to branching from 18.8% to 6.4%.
Subjects
network loading
network design
cutting planes
Persistent DSpace Link
