2026-07-20T01:20:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2176 2024-03-06T11:08:48Z ddc:004 open_access

A Network Design Problem Kleywegt, Anton J. Lee, Jinpyo Ward, Amy R. Network design continuous approximation 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Anton J. Kleywegt and Jinpyo Lee and Amy R. Ward 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09261.3 urn:nbn:de:0030-drops-21768 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.3 eng https://creativecommons.org/licenses/by/4.0/legalcode