Robust Uncapacitated Network Design and International Sourcing Problems

  • Panos Kouvelis
  • Gang Yu
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 14)

Abstract

In Chapter 2, Examples 15, we introduced the robust uncapacitated network design problem. This problem, as introduced in Chapter 2, addresses the way of configuring a network accounting for the fixed costs of arcs chosen to be in the network as well as the cost of routing goods through the network defined by the arcs. The main uncertainties to this problem are routing costs for the various commodities and the volumes of these commodities to be transported through the network.

Keywords

Network Design Master Problem Robust Solution Network Design Problem Bender Decomposition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Benders, J.J. (1962), “Partitioning Procedure for Solving Mixed Variable Programming Problems,” Numerische Mathematik, 4, 238–252.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    Carter, J.R., R. Narashimhan and S.K. Vickery (1988), International Sourc-ing for Manufacturing Operations, Monograph No. 3 (Operations Management Association, Waco, TX).Google Scholar
  3. [3]
    Dalby, J.S. and M.T. Flaherty (1991), International Financial Data, Harvard Business School Note 9–689–039.Google Scholar
  4. [4]
    Dijkstra, E.W. (1959), “A Note on Two Problems in Connection with Graphs,” Numerische Mathematik, 1, 269–271.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    Efroymson, M.A. and T.L. Ray (1966), “A Branch and Bound Algorithm for Plant Location,” Operations Research, 14, 361–368.CrossRefGoogle Scholar
  6. [6]
    Erlenkotter, D. (1978), “A Dual-Based Procedure for Uncapacitated Facility Location,” Operations Research, 26, 992–1009.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    Florian, M., G.G. Guerrin and G. Bushel (1976), “The Engine Scheduling Problem on a Railway Network,” INFOR J., 14, 121–128.MATHGoogle Scholar
  8. [8]
    Geoffrion, A.M. and G. Graves (1974), “Multicommodity Distribution System Design by Benders Decomposition,” Management Science, 5, 822–844.MathSciNetCrossRefGoogle Scholar
  9. [9]
    Gupta, S.K. and J. Rosenhead (1972), “Robustness in Sequential Investment Decisions,” Management Science, 15, 2, 18–29.Google Scholar
  10. [10]
    Gutierrez, G.J. and P. Kouvelis (1995), “A Robustness Approach to International Sourcing,” Annals of Operations Research, 59, 165–193.MATHCrossRefGoogle Scholar
  11. [11]
    Gutierrez, G.J. and P. Kouvelis (1996), “Robust Flowpath Designs for Automated Guided Vehicle Systems (AGVS),” Working Paper, Management Department, University of Texas at Austin.Google Scholar
  12. [12]
    Gutierrez, G.J., P. Kouvelis and A.A. Kurawarwala (1996), “A Robustness Approach to Uncapacitated Network Design Problems,” European Journal of Operational Research, forthcoming.Google Scholar
  13. [13]
    Hoang, H.H. (1982), “Topological Optimization of Networks: A Nonlinear Mixed Integer Model Employing Generalized Benders Decomposition,” Working Paper, IEEE Transactions on Automatic Control, AC-27, 164–169.MATHCrossRefGoogle Scholar
  14. [14]
    Klingman, D., A. Napier, and J. Sturz (1974), “NETGEN — A Program for Generating Large Scale (Un)Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems,” Management Science, 20, 5, 814–821.MATHCrossRefGoogle Scholar
  15. [15]
    Kouvelis, P., A.A. Kurawarwala and G.J. Gutierrez (1992), “Algorithms for Robust Single and Multiple Period Layout Planning for Manufacturing Systems,” European Journal of Operational Research, 63, 287–303.MATHCrossRefGoogle Scholar
  16. [16]
    Magnanti, T.L. and Wong, R.T. (1984), “Network Design and Transportation Planning: Models and Algorithms,” Transportation Science, 18, 1, 1–55.CrossRefGoogle Scholar
  17. [17]
    Magnanti, T.L. and Wong, R.T. (1981), “Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria,” Operations Research, 29, 464–484.MathSciNetMATHCrossRefGoogle Scholar
  18. [18]
    Magnanti, T.L., P. Mireault and Wong, R.T. (1986), “Tailoring Benders Decomposition for Uncapacitated Network design,” Mathematical Programming Study 26, 112–154.MathSciNetMATHCrossRefGoogle Scholar
  19. [19]
    Nemhauser, G.L. and L.A. Wolsey (1988), Integer and Combinatorial Optimization, Wiley, New York.MATHGoogle Scholar
  20. [20]
    Richardson, R. (1976), “An Optimization Approach to Routing Aircraft,” Transportation Science, 10, 52–71.CrossRefGoogle Scholar
  21. [21]
    Rosenblatt, M.J. and H.L. Lee (1987), “A Robustness Approach to Facilities Design,” International Journal of Production Research, 25, 479–486.CrossRefGoogle Scholar
  22. [22]
    Rosenhead, M.J., M. Elton and S.K. Gupta (1972), “Robustness and Optimally as Criteria for Strategic Decisions,” Operational Research Quarterly 23, 4, 413–430.CrossRefGoogle Scholar
  23. [23]
    Stougie, L. (1987), Design and Analysis of Algorithms for Stochastic Integer Programming, CWI Tract 37, Centre for Mathematics and Computer Science, Amsterdam.MATHGoogle Scholar
  24. [24]
    Van Roy, T.J. and D. Erlenkotter (1982), “A Dual-Based Procedure for Dynamic Facility Location,” Management Science, 28, 10, 1091–1105.MATHCrossRefGoogle Scholar
  25. [25]
    Womack, J.P., D.T. Jones and D. Roos (1990), The Machine that Changed the World, Rawson Assoc, New York.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1997

Authors and Affiliations

  • Panos Kouvelis
    • 1
  • Gang Yu
    • 2
  1. 1.Olin School of BusinessWashington University at St. LouisSt. LouisUSA
  2. 2.Center for Cybernetic StudiesThe University of TexasAustinUSA

Personalised recommendations