Skip to main content

An Evolutionary Algorithm for the Design of Hybrid Fiber Optic-Coaxial Cable Networks in Small Urban Areas

  • Conference paper
  • First Online:
Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence (IWANN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2084))

Included in the following conference series:

Abstract

Telecommunication is one of the fastest growing business sectors. Future networks will need to integrate a wide variety of services demanding different qualities and capacities from the network. In this paper, network architecture based on hybrid fiber optic-coaxial cable (HFC) is proposed to develop cable integrated telematic services. An evolutionary algorithm is presented to solve the problem in suitable computation times when dealing with real times civil works problems. Finally we present the results over both problem library and real life scenarios.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Belvaux, G., Boissin, N., Sutter, A. and Wolsey L. A.: Optimal placement of add/drop multiplexers: static and dynamic models. Eur J Opl Res 108 (1998) 26–35

    Article  MATH  Google Scholar 

  2. Sutter, A., Vanderbeck, F. and Wolsey, L. A.: Optimal placement of add/drop multiplexers: heuristic and exact algorithms. Opns Res 46 (1998) 719–728

    Article  MATH  Google Scholar 

  3. Winter, P.: Steiner problem in networks. Networks 17 (1987) 129–167

    Article  MATH  MathSciNet  Google Scholar 

  4. Cortes, P., Larrañeta, J., Onieva, L. and Garcia, J. M.: Multi-injection model to solve the Steiner problem. In: Sforza, A. (ed.): Simulation and Optimisation in Operations Management. Edizioni Scientifiche Italiane, Napoli (1999) 83–84

    Google Scholar 

  5. Wong, R. T.: A dual ascent approach for Steiner tree problems on a directed graph. Math Program 28 (1984) 271–287

    Article  MATH  Google Scholar 

  6. Magnanti, T. L., Wolsey, L. A.: Optimal trees. In: Ball, M. O. et al (eds.): Network Models. North-Holland, Elsevier (1995) 503–615

    Google Scholar 

  7. Grefenstette, J. J.: Incorporating Problem-Specific Knowledge into Genetic Algorithms. In Davis, L. (ed.): Genetic Algorithms and their Applications. Morgan Kaufmann, Los Angeles (1987)

    Google Scholar 

  8. Beasley, J. E.: OR-Library. http://mscmga.ms.ic.ac.uk/info.html (2001).

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cortés, P., Guerrero, F., Canca, D., García, J.M. (2001). An Evolutionary Algorithm for the Design of Hybrid Fiber Optic-Coaxial Cable Networks in Small Urban Areas. In: Mira, J., Prieto, A. (eds) Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence. IWANN 2001. Lecture Notes in Computer Science, vol 2084. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45720-8_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-45720-8_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42235-8

  • Online ISBN: 978-3-540-45720-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics