Computational Management Science

, Volume 9, Issue 4, pp 531–542 | Cite as

Network design for time-constrained delivery using subgraphs

Original Paper


Delivery companies are offering an increasing number of time-definite services. Yet, little research has been done that explores the design of delivery networks that can support these types of services. In this paper, we explore such design problems for networks with a specified number of edges \(B > n-1\), where \(n\) is the number of nodes in the problem. We present a two-phase heuristic solution approach that first constructs a network and then improves the network via local search. For the improvement phase, we extend neighborhood structures that have proven effective for tree-structured solutions and also identify a new search neighborhood that takes advantage of specific features of subgraph solutions. We present a computational analysis of our solution approach as well as managerial insights.


Logistics Heuristics Time Definite 

Supplementary material

10287_2012_154_MOESM1_ESM.pdf (817 kb)
Supplementary material 1 (pdf 817 KB)


  1. Caccetta L, Hartman IBA, Huang J (2001) Concerning the number of edges in a graph with diameter constraints. J Comb Math Comb Comput 36:161–173Google Scholar
  2. Chen H (2008) Network-design for time-constrained delivery. PhD thesis, The University of Iowa, Tippie College of BusinessGoogle Scholar
  3. Chen H, Campbell AM, Thomas BW (2008) Network-design for time-constrained delivery. Naval Res Logist 55(6):493–515CrossRefGoogle Scholar
  4. Chen H, Campbell AM, Thomas BW, Tamir A (2009) Minimax flow tree problems. Networks 54(3): 117–129CrossRefGoogle Scholar
  5. Chen H, Campbell A, Thomas B (2012) Online supplementary materials for network design for time-constrained delivery using subgraphs. Online at Computational Management Science websiteGoogle Scholar
  6. Daskin MS (1997) 150 U.S. largest cities.
  7. Datamonitor (2010) Express logistics in the united states.
  8. Johnson DS, Lenstra JK, Kan AHGR (1978) The complexity of the network design problem. Networks 8:279–285CrossRefGoogle Scholar
  9. Li CL, Mccormick ST, Simchi-Levi D (1992) On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper Res Lett 11:303–308CrossRefGoogle Scholar
  10. Maurits de Jonge J (2008) No break in the storm. Traffic WorldGoogle Scholar
  11. Plesník J (1981) The complexity of designing a network with minimum diameter. Networks 11:77–85CrossRefGoogle Scholar
  12. Plesník J (1984) On the sum of all distances in a graph or digraph. J Graph Theory 8:1–21CrossRefGoogle Scholar
  13. Rosenberg E (2005) Hierarchical topological network design. IEEE/ACM Trans Netw 13:1402–1409CrossRefGoogle Scholar
  14. Thuermer KE (2008) Tweaking the supply chain to optimize value and minimize cost. World Trade 21(10):24Google Scholar
  15. United Parcel Service (2011) U.S. ground maps for calculating service time and cost., accessed on June 23, 2011
  16. Wu BY, Chao KM, Tang CY (2002) Light graphs with small routing cost. Networks 39:130–138CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Hui Chen
    • 1
  • Ann M. Campbell
    • 2
  • Barrett W. Thomas
    • 2
  1. 1.Delta AirlinesAtlantaUSA
  2. 2.Department of Management SciencesUniversity of IowaIowa CityUSA

Personalised recommendations