License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-21768
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2176/
Go to the corresponding Portal


Kleywegt, Anton J. ; Lee, Jinpyo ; Ward, Amy R.

A Network Design Problem

pdf-format:
Document 1.pdf (457 KB)


Abstract

We consider the problem of designing a distribution network to facilitate the repeated movement of shipments from many origins to many destinations. A sufficient number of the origin-destination shipments require less than the capacity of a vehicle, so that consolidation of shipments is economical. We consider the case in which consolidation takes place at terminals, and we assume each shipment moves through exactly one terminal on its way from its origin to its destination. Then, a major design decision is to determine the best number of terminals. We develop a continuous approximation method to estimate transportation costs as a function of the number of terminals. We use the continuous approximation method to choose the number of terminals that minimizes the sum of terminal cost and transportation cost. Numerical results indicate that the design resulting from the continuous approximation method facilitates operations with lower cost than those resulting from a widely used integer programming based design.

BibTeX - Entry

@InProceedings{kleywegt_et_al:DSP:2009:2176,
  author =	{Anton J. Kleywegt and Jinpyo Lee and Amy R. Ward},
  title =	{A Network Design Problem},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  year =	{2009},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M{\"o}hring},
  number =	{09261},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2176},
  annote =	{Keywords: Network design, continuous approximation}
}

Keywords: Network design, continuous approximation
Seminar: 09261 - Models and Algorithms for Optimization in Logistics
Issue Date: 2009
Date of publication: 02.10.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI