Computational Management Science

, Volume 9, Issue 4, pp 531–542

Network design for time-constrained delivery using subgraphs

Original Paper

DOI: 10.1007/s10287-012-0154-2

Cite this article as:
Chen, H., Campbell, A.M. & Thomas, B.W. Comput Manag Sci (2012) 9: 531. doi:10.1007/s10287-012-0154-2
  • 95 Downloads

Abstract

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.

Keywords

LogisticsHeuristicsTime Definite

Supplementary material

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

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