Network design for time-constrained delivery

Naval Research Logistics

Volumn 55, Issue 6, 2008, Pages 493-515

  Chen, Hui ^a   Campbell, Ann Melissa ^a   Thomas, Barrett W ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Local search; Network design; Time constraints; Tree structure networks

Indexed keywords

LOCAL SEARCH; NETWORK DESIGN; TIME CONSTRAINTS; TIME-CONSTRAINED; TREE-STRUCTURE NETWORKS;

COMPUTER NETWORKS;

EID: 51349111711     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20302     Document Type: Article

References (34)

1. R. Ahuja and V. Murty, Exact and heuristic algorithms for the optimum communication spanning tree problem. Transportation Sci 21 (1987), 163-170.
2. E. Althaus, S. Funke, S. Har-Peled, J. Könemann, E.A. Ramos, and M. Skutella, Approximating k-hop minimum spanning trees, Oper Res Lett 33 (2005), 115-120.
3. C. Barnhart, N. Krishnan, D. Kim, and K. Ware, Network design for express shipment delivery, Comput Optim Appl 21 (2002), 239-262.
4. B. Carey, Expedited grows on the surface, Traffic World (January 2, 2006), 1.
5. H. Chen, Network design for time-constrained delivery, The University of Iowa, Tippie College of Business, May 2008.
6. H. Chen, A.M. Campbell, B.W. Thomas, and A. Tamir, Minimax flow tree problems, Available at http://myweb.uiowa.edu/bthoa/Research.html, Submitted for publication. Accessed February 6, 2008.
7. G. Dahl, The 2-hop spanning tree problem, Oper Res Lett 23 (1998), 21-26.
8. M.S. Daskin, SITATION: Facility location software to accompany Network and Discrete Location: Models, Algorithms, and Applications, Available at http://users.iems.northwestern.edu/~msdaskin/, 1997, Accessed February 6, 2008.
9. DC Velocity Staff. A sea change for air freight? Available at http://www.dcvelocity.com/news/?article_id= 1237, September 2007. Accessed January 11, 2008.
10. DHL. Domestic ground transit maps, Available at http://www.dhl-usa.com/ groundMaps/jsp/GroundMaps.jsp, 2008. Accessed March 19, 2008.
11. DHL. DHL extends industry-leading time definite delivery service (tdd) to united states, Available at http://www.dhl.co.in/publish/in/en/press/press/ 2007/april_10_2007.high.html, April 2007. Accessed January 11, 2008.
12. FedEx. Ground service maps, Available at http://www.fedex.com/grd/maps/ ShowMapEntry.do?cc=US&language=en, 2008. Accessed March 19, 2008.
13. M.R. Garey and D.S. Johnson, Computer and intractability: A guide to the theory of NP-completeness, W. H. Freeman and Company, New York, 1979.
14. L. Gouveia, Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints, Comput Oper Res 22 (1995), 959-970.
15. L. Gouveia, Multicommodity flow models for spanning trees with hop constraints, Eur J Oper Res 95 (1996), 178-190.
16. L. Gouveia and C. Requejo, A new Lagrangian relaxation approach for the hop-constrained minimum spanning tree problem, Eur J Oper Res 132 (2001), 539-552.
17. M. Gruber, J. van Hemert, and G.R. Raidl, Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO, GECCO '06: Proc 8th Annual Conf Genetic and Evolutionary Computation, 2006, pp. 1187-1194.
18. T.C. Hu, Optimum communication spanning trees, SIAM J Comput 3 (1974), 188-195.
19. J. Siek, L.-Q. Lee, and A. Lumsdaine, Boost graph library, Available at http://www.boost.org/libs/graph/doc/, 2001. Accessed March 20, 2008.
20. D.S. Johnson, J.K. Lenstra, and A.H.G.R. Kan, The complexity of the network design problem, Networks 8 (1978), 279-285.
21. P. Manyem and M.F.M. Stallmann, Some approximation results in multicasting, Working Paper, 1996.
22. D. Peleg, Polylogarithmic approximation for minimum communication spanning trees, Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, 1997, CS97-10.
23. D. Peleg and E. Reshef, Deterministic polylog approximation for minimum communication spanning trees (extended abstract), Lecture Notes Comput Sei 1443 (1998), 670-681.
24. C.C. Ribeiro and M.C. Souza, Variable neighborhood search for the degree-constrained minimum spanning tree problem, Dis Appl Math 118 (2002), 43-54.
25. S. Root and A. Cohn, A novel modeling approach for express package carrier planning, Available at http://www-personal.umich.edu/~amycohn/papers. html, Submitted for publication.
26. M. Savelsbergh and A. Volgenant, Edge exchange in the degree-constrained minimum spanning tree problem, Comput Oper Res 12 (1985), 341-348.
27. S. Steiner and T. Radzik, Solving the bi-objective minimum spanning tree problem using a k-best algorithm, Technical report, King's College London, London, UK, 2003.
28. United Parcel Service. U.S. ground maps for calculating service time and cost, Available at http://www.ups.com/maps?loc=en_US&WT.svl=SubNav, 2007. Accessed December 1, 2007.
29. United Parcel Service. About UPS, Available at http://www.corporate-ir. net/ireye/ir_site.zhtml ?ticker=UPS&script=2100&layout=7, 2002. Accessed November 30, 2006.
30. S. Voss, The steiner tree problem with hop constraints, Ann Oper Res 86 (1999), 321-345.
31. B.Y. Wu, A polynomial-time approximation scheme for the two-source minimum routing cost spanning trees, J Algorith 44 (2002), 359-378.
32. B.Y. Wu, G. Lancia, V. Bafna, K.-M. Chao, R. Ravi, and C.Y. Tang, A polynomial-time approximation scheme for minimum routing cost spanning trees, SIAM J Comput 29 (1999), 761-778.
33. B.Y. Wu, K-M. Chao, and C.Y. Tang, Approximation algorithm for some optimum communication spanning tree problems, Dis Appl Math 102 (2000), 245-266.
34. B.Y. Wu, K.-M. Chao, and C.Y. Tang, Approximation algorithm for the shortest total path length spanning tree problem, Dis Appl Math 105 (2000), 273-289.