Skip to main content
SpringerLink
Log in

An Efficient Heuristic for Solving an Extended Capacitated Concentrator Location Problem

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this paper, a mathematical model and a solution algorithm are developed for solving an extended capacitated concentrator location problem. Our model extends the conventional formulation by simultaneously addressing the two capacity constraints, total connection ports and maximum data processing rate, on each concentrator to be selected for satisfying the communication demands of the given end-user nodes. Since the problem is NP-complete, an efficient and effective Lagrangian heuristic is developed and tested by solving 100 randomly generated test problems with sizes ranging from 30(nodes)×30(concentrators) to150×30. Altogether 58% of the tested problems are solved optimally with an average solution gap 0.36% from the optimality and average solution times are from a few seconds to one half of a minute.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Balakrishnan, T.L. Magnanti and R.T.Wong, A decomposition algorithm for local access telecommunications network expansion planning, Operations Research 43 (1995) 58–76.

    Google Scholar 

  2. T.B. Boffey, Location of software in distributed computing systems, Journal of Operational Research Society 40 (1989) 863–870.

    Google Scholar 

  3. R.R. Boorstyn and H. Frank, Large-scale network topological optimization, IEEE Transactions on Communications 25 (1977) 29–46.

    Google Scholar 

  4. S.-G. Chang and B. Gavish, Lower bounding procedures for multiperiod telecommunications network expansion problems, Operations Research 43 (1995) 43–57.

    Google Scholar 

  5. S. Chung, Y. Myung and D. Tcha, Optimal design of a distributed network with a two-level hierarchical structure, European Journal of Operational Research 62 (1992) 105–115.

    Google Scholar 

  6. A. Dutta, G. Koehler and A.Whinston, On optimal allocation in a distributed processing environment, Management Science 28 (1982) 839–853.

    Google Scholar 

  7. A. Dutta and J.I. Lim, A multiperiod capacity planning model for backbone computer communication networks, Operations Research 40 (1992) 689–705.

    Google Scholar 

  8. H.G. Dysart and N.D. Georganas, NEWCLUST: An algorithm for the topological design of two-level multidrop teleprocessing networks, IEEE Transactions on Communications 26 (1978) 55–61.

    Google Scholar 

  9. P.C. Fetterolf and G. Anandalingam, A Lagrangian relaxation technique for optimizing interconnection of local area networks, Operations Research 40 (1992) 678–688.

    Google Scholar 

  10. M.L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11 (1981) 109–124.

    Google Scholar 

  11. B. Gavish, Topological design of centralized computer networks-formulations and algorithms, Networks 12 (1982) 355–377.

    Google Scholar 

  12. B. Gavish, Configuring wide area computer networks, OR Spektrum 14 (1992) 115–128.

    Google Scholar 

  13. B. Gavish, Topological design of computer communication networks-the overall design problem, European Journal of Operational Research 58 (1992) 149–172.

    Google Scholar 

  14. B. Gavish and H. Pirkul, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Mathematical Programming 31 (1985) 78–105.

    Google Scholar 

  15. A. Geoffrion and R.McBride, Lagrangian relaxation applied to capacitated facility location problems, AIIE Transactions 10 (1978) 40–47.

    Google Scholar 

  16. A. Gersht and R. Weihmayer, Joint optimization of data network design and facility selection, IEEE Journal on Selected Areas in Communications 8 (1990) 1667–1681.

    Google Scholar 

  17. G. Held, Network Management-Techniques, Tools and Systems (Wiley, New York, 1992) pp. 71–72.

    Google Scholar 

  18. G.K. Janssens, F. Broeckx and L. Kaufman, Combined capacity planning and concentrator location in computer communications networks, Optimization 21 (1990) 775–784.

    Google Scholar 

  19. J.G. Klincewicz and H. Luss, A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints, Journal of Operational Research Society 37 (1986) 495–500.

    Google Scholar 

  20. C.Y. Lee, An algorithm for the design of multitype concentrator networks, Journal of Operational Research Society 44 (1993) 471–482.

    Google Scholar 

  21. C.C. Lo and A. Kershenbaum, A two-phase algorithm and performance bounds for the star-star concentrator location problem, IEEE Transactions on Communications 37 (1989) 1151–1163.

    Google Scholar 

  22. P.V. McGregor and D. Shen, Network design: An algorithm for the access facility location problem, IEEE Transactions on Communications 25 (1977) 61–73.

    Google Scholar 

  23. A. Mirzaian, Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds, Networks 15 (1985) 1–20.

    Google Scholar 

  24. A. Mirzaian and K. Steiglitz, A note on the complexity of the star-star concentrator problem, IEEE Transactions on Communications 29 (1981) 1549–1552.

    Google Scholar 

  25. S. Narasimhan, The concentrator location problem with variable coverage, Computer Networks and ISDN Systems 19 (1990) 1–10.

    Google Scholar 

  26. [26] S. Narasimhan and H. Pirkul, Hierarchical concentrator location problem, Computer Communications 15 (1992) 185–191.

    Google Scholar 

  27. S. Narasimhan, H. Pirkul and P. De, Route selection in backbone data communication networks, Computer Networks and ISDN Systems 15 (1988) 121–133.

    Google Scholar 

  28. H. Pirkul, Efficient algorithms for the capacitated concentrator location problem, Computers and Operations Research 14 (1987) 197–208.

    Google Scholar 

  29. H. Pirkul and V. Nagarajan, Locating concentrators in centralized computer networks, Annals of Operations Research 36 (1992) 247–262.

    Google Scholar 

  30. H. Pirkul and S. Narasimhan, Primary and secondary route selection in backbone computer networks, ORSA Journal on Computing 6 (1994) 50–60.

    Google Scholar 

  31. H. Pirkul, S. Narasimhan and P. De, Locating concentrators for primary and secondary coverage in a computer communication network, IEEE Transactions on Communications 36 (1988) 450–458.

    Google Scholar 

  32. E. Ramos, A. Schroeder and A. Beheler, Data communications and networking, in: Fundamentals Using Novell NetWare (1994) pp. 62–63.

  33. G.M. Schneider and M.N. Zastrow, An algorithm for the design of multilevel concentrator networks, Computer Networks 6 (1982) 1–11.

    Google Scholar 

  34. D. Skorin-Kapov, On a cost allocation problem arising from a capacitated concentrator covering problem, Operations Research Letters 13 (1993) 315–323.

    Google Scholar 

  35. A.S. Tanenbaum, Computer Networks (Prentice-Hall, Englewood Cliffs, NJ, 1982) pp. 67–87.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Accounting, Finance and Information Management College of Business, Oregon State University, Corvallis, OR, 97331-2603, USA

    V.T. Raja

  2. Department of Business Information Systems, Haworth College of Business, Western Michigan University, Kalamazoo, MI, 49008, USA

    Bernard T. Han

Authors
  1. V.T. Raja
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernard T. Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Raja, V., Han, B.T. An Efficient Heuristic for Solving an Extended Capacitated Concentrator Location Problem. Telecommunication Systems 23, 171–199 (2003). https://doi.org/10.1023/A:1023629205039

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1023629205039

Search

Navigation