Designing of fiber-optic network for the three-level by considering the backbone network and local access networks simultaneously

Document Type: Research Paper

Authors

1 Professor School of Industrial Engineering, college of Engineering ,University of Tehran

2 College of Engineering, University of Tehran

Abstract

Today, fiber-optic due to its higher bandwidth and cost effective in compare with other similar technologies is one of the most important tools of data transfer. In this paper, an integrated mathematical model is presented for the three-level network of fiber-optic by considering the backbone network and local access networks simultaneously. Used topologies in its levels are respectively ring, star, and star. The purpose of this model is determine the location of the central hubs and concentrators, communication of central hubs and also assign each user to one of the concentrators such that the costs of the fiber link and installation the concentrators get minimize as well as providing the bandwidth required per user. Due to NP-hardness of this problem, small size of proposed model validated by GAMS software, then the model is solved by two meta-heuristic methods of DE and GA in large-sizes and the results of the two algorithms have been compared in terms of time and objective function value. The result shows the required time to achieve optimum solution in the DE is less than GA and also DE has better performance in small and medium-sized of problem but for the large size of problem the GA algorithm is better than DE

Keywords

Main Subjects


  1. Brimberg, J.  et al. (2017). “General Variable Neighborhood Search for the Uncapacitated Single Allocation P-Hub Center Problem”, Optimization Letters, Vol. 11, No. 2, PP. 377-388.
  2. Saboury, A. et al. (2013). “Applying Two Efficient Hybrid Heuristics for Hub Location Problem with Fully Interconnected Backbone and Access Networks”, Computers and Operations Research, Vol. 40, No.10, PP. 2493-2507.  
  3. Jadhav, R. A., and Shitole, D. S. (2013). “Fiber Optics Communication and Application. “International Journal of Innovative Research in Engineering an Science, Vol. 2. No. 4, PP. 2319-5665.       
  4. Ortiz-Garcia, E. G. et al. (2009). “A Parallel Evolutionary Algorithm for the Hub Location Problem with Fully Inter Connected Backbone and Access Networks”, IEEE Congress on Evolutionary Computation, Vol. CEC, PP. 1501-1506.
  5. Yazar, B. (2013). Fiber Optical Network Design Problem: Case for Turkey, M. Sc. Thesis, Industrial Engineering of Bilkent University.  
  6. Kumar, V., and Jangra, K. D. (2014). “A Survey of Passive Optical Networks”, International Journal of Advance Research in Computer Science and Management Studies, Vol. 2. No. 8, PP. 2321-7782.      
  7. Yazar, B. et al. (2016). “Fiber Optical Network Design Problems: A Case For Turkey”, Omega, Vol. ???, No. 63, PP. 23-40.
  8. Gavish, B., Li, C., and Simchi-Levi, D. (1992). “Analysis of Heuristics for the Design of Tree Networks”, Annals of Operations Research, Vol. 36. No. 1, PP. 77-86.
  9. Ho, K. S., Zhou, M., and Cheung, K. (2006). “A New Approach for Designing the Next Generation Survivable Backbone Network”, In:12th International Telecommunications  Network Strategy and Planning Symposium, IEEE, PP. 1-6.                                                                                      
  10. Beheshti, Z., Shamsuddin, S. M., and Yuhaniz, S. S. (2013). “Binary Accelerated Particle Swarm Algorithm (BAPSA) for Discrete Optimization Problems”, Journal of Global Optimization, Vol. 57, No. 2, PP. 549-573.  
  11. Brimberg, J. et al. (2017). “A Basic Variable Neighborhood Search Heuristic for the Uncapacitated Multiple Allocation P-Hub Center Problem”, Optimization Letters, Vol. 11, No. 2, PP. 313-327.
  12. Abyazi-Sani, R., and Ghanbari, R. (2016). “An Efficient Tabu Search for Solving the Uncapacitated Single Allocation Hub Location Problem”, Computers and Industrial Engineering, Vol. 93, No. 93, PP. 99-109.
  13. Thomadsen, T., and Stidsen, T. (2005). “Hierarchical Ring Network Design Using Branch-And-Price”, Telecommunication Systems, Vol. 29. No. 1, PP. 61-76.                                                 
  14. Contreras, I., Tanash, M., and Vidyarthi, N. (2017). “Exact and Heuristic Approaches for the Cycle Hub Location Problem”, Annals of Operations Research, Vol. 2, No. 258, PP. 655-677.
  15. Martinsde S. E. et al. (2015). “The Hub Line Location Problem”, Transportation Science,Vol.49,NO.3,PP.500-518.    
  16. Meraklı, M., & Yaman, H. (2016). Robust Intermodal Hub Location Under Polyhedral Demand Uncertainty. Transportation Research Part B: Methodological86, 66-85.
  17. Elmastas, S. (2006). Hub Location Problem for Air-Ground Transportation Systems with Time Restrictions, M.S. Thesis, Industrial Engineering of Bilkent University.                                       
  18. Chen, S., Ljubic, I., and Raghavan, S. (2010) “The Regenerator Location Problem”, Networks, Vol. 55, No. 3, PP. 205-220.                                           
  19. Duarte, A. et al. (2014). “Improved Heuristics for the Regenerator Location Problem”, International Transactions in Operational Research, Vol. 21. No. 4, PP. 541-558.     
  20. Topcuoglua, H. et al. (2005). “Solving the Uncapacitated Hub Location Problem Using Genetic Algorithms”, Computers and Operations Research, Vol. 32, No. 4 , PP. 967-984.      
  21. Rabbani, M. et al. (2017). “A New Mathematical Model in Cell Formation Problem with Consideration of Inventory and Backorder: Genetic and Particle Swarm Optimization Algorithms”, Iranian Journal of Management Studies, Vol. 10, No. 4, PP. 819-852.