Skip to main content
SpringerLink
Log in

Steiner Trees and the Dynamic Quadratic Assignment Problem

  • Chapter
Steiner Trees in Industry

Part of the book series: Combinatorial Optimization ((COOP,volume 11))

  • 525 Accesses

Abstract

Two of the most challenging problems in network design are the Quadratic Assignment Problem (QAP) and the Steiner network problem. One of the key objectives of this paper is to show the strong link between these two network design problems. Dynamic flows in QAPs are modelled as stochastic processes. The underlying flow topology is represented as a Steiner tree queueing network topology. Customers and goods flow over tandem links of the Steiner network. A heuristic for the Stochastic Quadratic Assignment Problem SQAP is developed for solving this flow network topology problem and computational experience is presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. E. Burkard (1984), ”Locations with spatial interaction — Quadratic Assignment Problem”, in: R.L. Francis and P.B. Mirchandani (eds.), Discrete Location Theory, Academic Press, New York.

    Google Scholar 

  2. Cheah, Jenyeng, “State Dependent Queueing Models,” Masters Thesis. Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, MA, 01003. Spring 1990.

    Google Scholar 

  3. Cheah, Jenyeng and J. MacGregor Smith, “Generalized M/G/C/C State Dependent Queueing Models and Pedestrian Traffic Flows,” Queueing Systems and Their Applications (QUESTA) 15 365–386, 1994.

    Article  MATH  Google Scholar 

  4. D. Chhajed, B. Montreuil, and T. Lowe (1992), “Flow Network Design for Manufacturing System Layout”, European Journal of Operational Research 57, pp 145–161.

    Article  MATH  Google Scholar 

  5. Duncan, A.J., “Quality Control and Industrial Statistics,” Richard D. Irwin, Homewood, Il., 1986.

    Google Scholar 

  6. G. Finke and R. E. Burkard (1987), ”Quadratic Assignment Problems”, Surveys in Combinatorial Optimization, North-Holland, Amsterdam, pp 61–82.

    Google Scholar 

  7. Fruin, J.J. Pedestrian Planning and Design. Metropolitan Assoc. of Urban Des. and Env. Ping. New York NY 10008, 1971.

    Google Scholar 

  8. R. J. Gaskins and J. M. A. Tanchoco (1987), “Flow Path Design for Automated Guided Vehicle System”, International Journal of Production Research 25, No. 5, pp 667–676

    Article  Google Scholar 

  9. Gross, D., and Harris, C.M., Fundamentals of queueing theory,New York: John Wiley and Son, 1985.

    MATH  Google Scholar 

  10. Jain, Rajat, and J. MacGregor Smith, 1997. “Modelling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models,” Transportation Science 3l (4), 324–336.

    Article  Google Scholar 

  11. Koopmans, T.C., and Beckman, M., Assignment problems and the location of economic activities, Econometric 25, 53–76

    Google Scholar 

  12. Kusiak, A., and Heragu, S.S., The facility layout problem, European Journal of Operational Research 29, 229–251, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  13. Labetoulle, J. and Pujolle, G. “Isolation Method in a network of queues,” IEEE Trans.on Software Eng., Vol. SE-6, 4, 373–380, 1980.

    Article  Google Scholar 

  14. Li, Wu-Ji, “Deming’s Methodology in Inspection Criteria.” Master’s Project. Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, MA, 01003. 1988.

    Google Scholar 

  15. Li, Wu-Ji and J. MacGregor Smith, An Algorithm for Quadratic Assignment Problems, The European Journal of Operational Research. 81 (1995), 205–216.

    Article  MATH  Google Scholar 

  16. Li, Wu-Ji and J. MacGregor Smith, “Star, Grid, and Ring Topologies in Facility Location and Network Design,” in Network Design: Connectivity and Facilities Location, eds. Panos Pardalos and D.Z. Du eds. Dimacs Series in Discrete Mathemtics and Theoretical Computer Science, Volume 40, 219–246.

    Google Scholar 

  17. May, Adolf, D., 1990, Traffic Flow Fundamentals. Prentice-Hall, Inc.

    Google Scholar 

  18. Pardalos, P. and H. Wolkowicz eds. Quadratic Assignment and Related Problems, Dimacs Series in Discrete Mathemtics and Theoretical Computer Science. Volume 16. American Mathematical Society.

    Google Scholar 

  19. Ross, S., Stochastic Process,John Wiley & Sons, 1983

    Google Scholar 

  20. Sahni, S., and Gonzalez, T., P-complete approximation problems. J. ACM 23, 555–565, 1976

    Article  MathSciNet  MATH  Google Scholar 

  21. Sharpe, R., and Brochie, J., An urban systems study, R. Aust. Plann. Inst. J. 10, 3–12, 1972

    Google Scholar 

  22. Smith, J.M., and Rouse, N.B., Application of Queueing Network Models to Optimization of Resource Allocation within Libraries, Journal of The American Society for Information Science, Vol. 30, No 5, 250–263, 1978

    Article  Google Scholar 

  23. Smith, J.M., and Towsley, D., The use of Queueing Network in the Evaluation of Egress from Buildings,Environment and Planning B-8, 125–139, 1981

    Google Scholar 

  24. Smith, J.M., and Macleod, R., A relaxed assignment algorithm for the quadratic assignment problem,INFOR Vol. 26, No.3, 1988.

    Google Scholar 

  25. Smith, J.MacGregor. Cellular Arrangement Problems with Random Flows. Engineering Optimization 24 59–74, 1995.

    Article  Google Scholar 

  26. Smith, J.MacGregor and Wu-Ji Li, 2001. “Quadratic Assignment Problems and State Dependent Network Flows,” (accepted for publication in the Journal of Combinatorial Optimization).

    Google Scholar 

  27. Steinberg, L., The backboard wiring problem: a placement algorithm, SIAM Rev. 3, 37–50, 1961

    Article  MathSciNet  MATH  Google Scholar 

  28. Tregenza, P., The design of interior circulation. Van Norstand Reinhold Company, New York, N.Y., 1976

    Google Scholar 

  29. Yuhaski, S., and Smith, J.M., Modeling circulation systems in buildings using state dependent queueing models,Queueing System 4, 319–338, 1989

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical and Industrial Engineering, University of Massachusetts, Amherst, MA, 01003, USA

    Jim MacGregor Smith

Authors
  1. Jim MacGregor Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA

    Xiu Zhen Cheng  & Ding-Zhu Du  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Kluwer Academic Publishers

About this chapter

Cite this chapter

Smith, J.M. (2001). Steiner Trees and the Dynamic Quadratic Assignment Problem. In: Cheng, X.Z., Du, DZ. (eds) Steiner Trees in Industry. Combinatorial Optimization, vol 11. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0255-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0255-1_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7963-8

  • Online ISBN: 978-1-4613-0255-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation