Skip to main content

An (MI)LP-Based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9597))

Abstract

We investigate the 3-architecture Connected Facility Location Problem arising in the design of urban telecommunication access networks integrating wired and wireless technologies. We propose an original optimization model for the problem that includes additional variables and constraints to take into account wireless signal coverage represented through signal-to-interference ratios. Since the problem can prove very challenging even for modern state-of-the art optimization solvers, we propose to solve it by an original primal heuristic that combines a probabilistic fixing procedure, guided by peculiar Linear Programming relaxations, with an exact MIP heuristic, based on a very large neighborhood search. Computational experiments on a set of realistic instances show that our heuristic can find solutions associated with much lower optimality gaps than a state-of-the-art solver.

The work of Fabio D’Andreagiovanni and Jonad Pulaj was partially supported by the Einstein Center for Mathematics Berlin (ECMath) through Project MI4 (ROUAN) and by the German Federal Ministry of Education and Research (BMBF) through Project VINO (Grant 05M13ZAC) and Project ROBUKOM (Grant 05M10ZAA) [1].

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

References

  1. Bauschert, T., Büsing, C., D’Andreagiovanni, F., Koster, A.M.C.A., Kutschka, M., Steglich, U.: Network planning under demand uncertainty with robust optimization. IEEE Comm. Mag. 52, 178–185 (2014)

    Article  Google Scholar 

  2. Grötschel, M., Raack, C., Werner, A.: Towards optimizing the deployment of optical access networks. EURO J. Comp. Opt. 2, 17–53 (2014)

    Article  MATH  Google Scholar 

  3. Zotkiewicz, M., Mycek, M., Tomaszewski, A.: Profitable areas in large-scale FTTH network optimization. Telecommun. Syst. 61(3), 591–608 (2015). doi:10.1007/s11235-015-0016-7

    Article  Google Scholar 

  4. Leitner, M., Ljubic, I., Sinnl, M., Werner, A.: On the two-architecture connected facility location problem. ENDM 41, 359–366 (2013)

    Google Scholar 

  5. Ghazisaidi, N., Maier, M., Assi, C.: Fiber-wireless (FiWi) access networks: a survey. IEEE Comm. Mag. 47, 160–167 (2009)

    Article  Google Scholar 

  6. D’Andreagiovanni, F.: Pure 0–1 programming approaches to wireless network design. 4OR-Q: J. Oper. Res. 10, 211–212 (2012)

    Article  Google Scholar 

  7. D’Andreagiovanni, F.: Revisiting wireless network jamming by SIR-based considerations and multiband robust optimization. Optim. Lett. 9, 1495–1510 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. IBM ILOG CPLEX. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer

  9. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)

    MATH  Google Scholar 

  10. Gollowitzer, S., Ljubic, I.: MIP models for connected facility location: A theoretical and computational study. Comput. & OR 38, 435–449 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In Harrison, M., et al. (eds.) Proceedings of the STOC 2001, 389–398. ACM, New York (2001)

    Google Scholar 

  12. Ljubic, I., Gollowitzer, S.: Layered graph approaches to the hop constrained connected facility location problem. INFORMS J. Comp. 25, 256–270 (2013)

    Article  MathSciNet  Google Scholar 

  13. D’Andreagiovanni, F.: On improving the capacity of solving large-scale wireless network design problems by genetic algorithms. In: Di Chio, C., et al. (eds.) EvoApplications 2011, Part II. LNCS, vol. 6625, pp. 11–20. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Rappaport, T.: Wirel. Commun.: Princ. Pract. Prentice Hall, Upper Saddle River (2001)

    Google Scholar 

  15. D’Andreagiovanni, F., Mannino, C., Sassano, A.: GUB covers and power-indexed formulations for wireless network design. Manag. Sci. 59, 142–156 (2013)

    Article  Google Scholar 

  16. Nehmauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons, Hoboken (1988)

    Book  Google Scholar 

  17. D’Andreagiovanni, F., Mannino, C., Sassano, A.: Negative cycle separation in wireless network design. In: Pahl, J., Reiners, T., Voß, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 51–56. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Dely, P., D’Andreagiovanni, F., Kassler, A.: Fair optimization of mesh-connected WLAN hotspots. Wirel. Commun. Mob. Comput. 15, 924–946 (2015)

    Article  Google Scholar 

  19. Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J. Comp. 11, 358–369 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  20. D’Andreagiovanni, F., Krolikowski, J., Pulaj, J.: A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods. App. Soft Comp. 26, 497–507 (2015)

    Article  Google Scholar 

  21. D’Andreagiovanni, F., Nardin, A.: Towards the fast and robust optimal design of wireless body area networks. App. Soft Comp. 37, 971–982 (2015)

    Article  Google Scholar 

  22. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B 26, 29–41 (1996)

    Article  Google Scholar 

  23. Gambardella, L.M., Montemanni, R., Weyland, D.: Coupling ant colony systems with strong local searches. Europ. J. Oper. Res. 220, 831–843 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  24. Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comp. 11, 4135–4151 (2011)

    Article  MATH  Google Scholar 

  25. Italian Authority for Telecommunications (AGCOM): Specifications for a dvb-t planning software tool. http://www.agcom.it/Default.aspx?message=downloaddocument&DocID=3365 Accessed: 15 October 2015

  26. Büsing, C., D’Andreagiovanni, F.: New results about multi-band uncertainty in robust optimization. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 63–74. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabio D’Andreagiovanni .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

D’Andreagiovanni, F., Mett, F., Pulaj, J. (2016). An (MI)LP-Based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design. In: Squillero, G., Burelli, P. (eds) Applications of Evolutionary Computation. EvoApplications 2016. Lecture Notes in Computer Science(), vol 9597. Springer, Cham. https://doi.org/10.1007/978-3-319-31204-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-31204-0_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-31203-3

  • Online ISBN: 978-3-319-31204-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics