License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09261.3
URN: urn:nbn:de:0030-drops-21768
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2176/
Go to the corresponding Portal

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

A Network Design Problem

pdf-format:
09261.KleywegtAnton.Paper.2176.pdf (0.4 MB)

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:DagSemProc.09261.3,
  author =	{Kleywegt, Anton J. and Lee, Jinpyo and Ward, Amy R.},
  title =	{{A Network Design Problem}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--56},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2009/2176},
  URN =		{urn:nbn:de:0030-drops-21768},
  doi =		{10.4230/DagSemProc.09261.3},
  annote =	{Keywords: Network design, continuous approximation}
}

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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI