Click to open the HelpDesk interface
AECE - Front page banner



JCR Impact Factor: 1.102
JCR 5-Year IF: 0.734
Issues per year: 4
Current issue: Feb 2021
Next issue: May 2021
Avg review time: 54 days


Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


2,773,496 unique visits
Since November 1, 2009

Robots online now


SCImago Journal & Country Rank


Anycast DNS Hosting

 Volume 21 (2021)
     »   Issue 1 / 2021
 Volume 20 (2020)
     »   Issue 4 / 2020
     »   Issue 3 / 2020
     »   Issue 2 / 2020
     »   Issue 1 / 2020
 Volume 19 (2019)
     »   Issue 4 / 2019
     »   Issue 3 / 2019
     »   Issue 2 / 2019
     »   Issue 1 / 2019
 Volume 18 (2018)
     »   Issue 4 / 2018
     »   Issue 3 / 2018
     »   Issue 2 / 2018
     »   Issue 1 / 2018
 Volume 17 (2017)
     »   Issue 4 / 2017
     »   Issue 3 / 2017
     »   Issue 2 / 2017
     »   Issue 1 / 2017
  View all issues  


Application of the Firefly Algorithm for Optimizing a Single-switch Class E ZVS Voltage-Source Inverter's Operating Point, KLEMPKA, R., WARADZYN, Z., SKALA, A.
Issue 2/2018


Acquisition and Transmission of ECG Signals Through Stainless Steel Yarn Embroidered in Shirts, MUNTEANU, R. A., BANULEASA, S., RUSU, A., BUTACU, D.-G.
Issue 2/2020


A Programmable Biopotential Aquisition Front-end with a Resistance-free Current-balancing Instrumentation Amplifier, FARAGO, P., GROZA, R., HINTEA, S., SOSER, P.
Issue 2/2018


Electrical Signature Analysis for Condition Monitoring of Permanent Magnet Synchronous Machine, SALOMON, C. P., FERREIRA, C., LAMBERT-TORRES, G., TEIXEIRA, C. E., BORGES DA SILVA, L. E., SANTANA, W. C., BONALDI, E. L., DE OLIVEIRA, L. E. L.
Issue 4/2018


Shannon Energy Application for Detection of ECG R-peak using Bandpass Filter and Stockwell Transform Methods, SUBOH, M. Z., JAAFAR, R., NAYAN, N. A., HARUN, N. H.
Issue 3/2020


Improved Classification by Non Iterative and Ensemble Classifiers in Motor Fault Diagnosis, PANIGRAHY, P. S., CHATTOPADHYAY, P.
Issue 1/2018



Clarivate Analytics published the InCites Journal Citations Report for 2019. The InCites JCR Impact Factor of Advances in Electrical and Computer Engineering is 1.102 (1.023 without Journal self-cites), and the InCites JCR 5-Year Impact Factor is 0.734.

Starting on the 15th of June 2020 we wiil introduce a new policy for reviewers. Reviewers who provide timely and substantial comments will receive a discount voucher entitling them to an APC reduction. Vouchers (worth of 25 EUR or 50 EUR, depending on the review quality) will be assigned to reviewers after the final decision of the reviewed paper is given. Vouchers issued to specific individuals are not transferable.

Starting on the 15th of December 2019 all paper authors are required to enter their SCOPUS IDs. You may use the free SCOPUS ID lookup form to find yours in case you don't remember it.

Clarivate Analytics published the InCites Journal Citations Report for 2018. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.650, and the JCR 5-Year Impact Factor is 0.639.

Starting today, the minimum number a pages for a paper is 8, so all submitted papers should have 8, 10 or 12 pages. No exceptions will be accepted.

Read More »


  2/2020 - 7

Firefly Algorithm Based Optimization Model for Planning of Optical Transport Networks

OLIVEIRA, B. Q. See more information about OLIVEIRA, B. Q. on SCOPUS See more information about OLIVEIRA, B. Q. on IEEExplore See more information about OLIVEIRA, B. Q. on Web of Science, SOUSA, M. A. See more information about  SOUSA, M. A. on SCOPUS See more information about  SOUSA, M. A. on SCOPUS See more information about SOUSA, M. A. on Web of Science, TELES VIEIRA, F. H. See more information about TELES VIEIRA, F. H. on SCOPUS See more information about TELES VIEIRA, F. H. on SCOPUS See more information about TELES VIEIRA, F. H. on Web of Science
Click to see author's profile in See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (1,392 KB) | Citation | Downloads: 184 | Views: 544

Author keywords
artificial intelligence, communication networks, genetic algorithms, optical fiber networks, optimization

References keywords
networks(21), optical(20), communications(9), algorithm(9), design(7), routing(6), optimization(6), networking(6), network(6), inspired(6)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2020-05-31
Volume 20, Issue 2, Year 2020, On page(s): 55 - 64
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2020.02007
Web of Science Accession Number: 000537943500007
SCOPUS ID: 85087444683

Quick view
Full text preview
The growth in data traffic is raising serious challenges for OTN in terms of improving their capacity efficiency in order to meet the new traffic requirements. Under these circumstances, the task of efficiently utilizing available resources opens opportunities for the development of a variety of techniques for network planning. This paper presents a decision support system for the optical transport network. It is considered the optical transport network planning problem where a traffic interest matrix between the demand nodes is specified. The network is modeled as a graph, through the arc-path approach. An Integer Linear Programming problem solved with a Firefly Algorithm is proposed for network planning, considering cost minimization. The main novelties of the proposed ILP model is that it accomplishes the optical network design with the possibility of multiple destinations of the traffic matrix and with dynamic allocation of the transmission system modularity. To solve the ILP optimization model the firefly algorithm, genetic algorithm and the exact method are used. Simulations are carried out to verify the performance of the bio-inspired algorithms in relation to the exact method. The results obtained with the firefly algorithm surpass those of the genetic algorithm and approximate the optimal result.

References | Cited By  «-- Click to see who has cited this paper

[1] A. Kumar, M. Gupta, "A review on activities of fifth generation mobile communication system," Alexandria Engineering Journal, 2017.
[CrossRef] [Web of Science Times Cited 15] [SCOPUS Times Cited 25]

[2] S. Mumtaz, A. Morgado, K. M. S. Huq, J. Rodriguez, "A survey of 5G technologies: regulatory, standardization and industrial perspectives," Digital Communications and Networks, 2017.
[CrossRef] [Web of Science Times Cited 50] [SCOPUS Times Cited 74]

[3] S. Li, L. Da Xu, S. Zhao, "5G internet of things: a survey," Journal of Industrial Information Integration, 2018.
[CrossRef] [Web of Science Times Cited 322] [SCOPUS Times Cited 434]

[4] Q. Wang, G. Ying, "OTN for the future transmission network," Symposium on Photonics and Optoelectronics, 2012.
[CrossRef] [SCOPUS Times Cited 1]

[5] T. G. Robertazzi. Optical Networks for Telecommunications. Introduction to Computer Networking. Springer, Cham, pp. 67-79, 2017.

[6] Y. S. Kavian. Intelligent Systems for Optical Networks Design: Advancing Techniques: Advancing Techniques. IGI Global, pp. 153-174, 2013.

[7] F. Musumeci, et al., "An overview on application of machine learning techniques in optical networks," IEEE Communications Surveys & Tutorials, 2018.
[CrossRef] [Web of Science Times Cited 91] [SCOPUS Times Cited 148]

[8] J. Simmons. Optical Network Design and Planning. Springer International Publishing Switzerland, pp. 10-15, 2014.

[9] X. S. Yang. Nature-Inspired Metaheuristic Algorithms. Luniver Press, Second Edition, pp. 1-5, 2010.

[10] A. Eira, J. Santos, J. Pedro, J. Pires, "Multi-objective design of survivable flexible-grid DWDM networks," IEEE/OSA Journal of Optical Communications and Networking, vol. 3, pp. 326-339, 2014.
[CrossRef] [Web of Science Times Cited 21] [SCOPUS Times Cited 22]

[11] D. Din, "Heuristic and genetic algorithms for solving the virtual topology design problem on elastic optical networks," Journal of Information Science & Engineering, vol. 33, 2017.
[CrossRef] [SCOPUS Times Cited 1]

[12] D. Din, "Genetic algorithm for virtual topology design on MLR WDM networks," Optical Switching and Networking, vol. 18, pp. 20-34, 2015.
[CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 4]

[13] S. A. Fernandez, A. A. Juan, J. A. Adrian, J., D. G. Silva, D. R. Terren, "Metaheuristics in telecommunication systems: network design, routing, and allocation problems," IEEE Systems Journal, vol. 12, pp. 3948-3957, 2018.
[CrossRef] [Web of Science Times Cited 8] [SCOPUS Times Cited 10]

[14] J. Mata, et al., "Artificial intelligence (AI) methods in optical networks: A comprehensive survey," Optical Switching and Networking, vol. 28, pp. 43-57, 2018.
[CrossRef] [Web of Science Times Cited 101] [SCOPUS Times Cited 138]

[15] X. S. Yang, S. F. Chien, T. O. Ting. Bio-inspired computation in telecommunications. Morgan Kaufmann, pp. 23-38, 2015.

[16] C. Papagianni, et al., "Communication network design using particle swarm optimization," IEEE International Multiconference on Computer Science and Information Technology, pp. 915-920, 2008.
[CrossRef] [SCOPUS Times Cited 21]

[17] J. Triay, C. Cervello, "An ant-based algorithm for distributed routing and wavelength assignment in dynamic optical networks," IEEE journal on selected areas in communications, vol. 28, pp. 542-552, 2010.
[CrossRef] [Web of Science Times Cited 31] [SCOPUS Times Cited 54]

[18] A. Rubio, M. A. Veja, and D. L. González, "An improved multiobjective approach inspired by the flashing behaviour of fireflies for Traffic Grooming in optical WDM networks," Applied Soft Computing, pp. 617-636, 2014.
[CrossRef] [Web of Science Times Cited 3] [SCOPUS Times Cited 3]

[19] J. Pedro, "Designing transparent flexible-grid optical networks for maximum spectral efficiency," IEEE/OSA Journal of Optical Communications and Networking, 2017.
[CrossRef] [Web of Science Times Cited 13] [SCOPUS Times Cited 16]

[20] H. Liu, C. Xiong, Y. Chen, C. Li, D. Chen, "An optimization method of VON mapping for energy efficiency and routing in elastic optical networks," Optical Fiber Technology, vol. 41, pp. 173-181, 2018.
[CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 5]

[21] A. Eira, J. Pedro, J. Pires, "Cost-optimized dimensioning of translucent WDM networks with mixed-line-rate spectrum-flexible channels," IEEE 13th International Conference on High Performance Switching and Routing, 2012.
[CrossRef] [SCOPUS Times Cited 5]

[22] X. Chen, J. Admela, "Optimized parallel transmission in otn/wdm networks to support high-speed ethernet with multiple lane distribution," Journal of Optical Communications and Networking, pp. 248-258, 2012.
[CrossRef] [Web of Science Times Cited 6] [SCOPUS Times Cited 9]

[23] J. R. Santos, A. Eira, J. Pires, "A Heuristic Algorithm for Designing OTN Over Flexible-Grid DWDM Networks," Journal of Communications, 2017.

[24] M. S. Bazaraa, J. J. Jarvis, H. D. Sherali. Linear Programming and Network Flows. 4a ed., Willey, pp. 1-35, 2010.

[25] R. Goscien, "Two metaheuristics for routing and spectrum allocation in cloud-ready survivable elastic optical networks," Swarm and Evolutionary Computation, vol. 44, pp. 388-403, 2019.
[CrossRef] [Web of Science Times Cited 6] [SCOPUS Times Cited 5]

[26] R. Goscien, M. Lozano, "Artificial bee colony for optimization of cloud-ready and survivable elastic optical networks," Computer Communications, vol. 128, pp. 35-45, 2018.
[CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 6]

[27] D. T. Hai, "A bi-objective integer linear programming model for the routing and network coding assignment problem in WDM optical networks with dedicated protection," Computer Communications, vol. 133, pp. 51-58, 2019.
[CrossRef] [Web of Science Times Cited 6] [SCOPUS Times Cited 7]

[28] K. D. R. Assis, I. Queiroz, R. C. Almeida, H. Waldman, "MILP formulation for resource optimization in Spectrum-Sliced Elastic Optical Path Networks," Microwave & Optoelectronics Conference (IMOC), SBMO/IEEE MTT-S International, 2013.
[CrossRef] [SCOPUS Times Cited 4]

[29] A. Ghosh, S. Tsutsui. Advances in Evolutionary Computing: Theory and Applications. Springer Science & Business Media, pp. 441-461, 2012.

[30] X. S. Yang. Cuckoo Search and Firefly Algorithm: Theory and Applications. Vol. 516, Springer, pp. 315-331, 2013.

[31] X. S. Yang, X. He, "Firefly algorithm: recent advances and applications." International Journal of Swarm Intelligence, vol. 1, pp. 36-50, 2013.

[32] W. T. Lunardi, V. Holger, "Comparative study of genetic and discrete firefly algorithm for combinatorial optimization." Proceedings of the 33rd Annual ACM Symposium on Applied Computing. ACM, 2018.
[CrossRef] [Web of Science Times Cited 2] [SCOPUS Times Cited 3]

[33] A. M. Mohsen, W. Al-Sorori, "A new hybrid discrete firefly algorithm for solving the traveling salesman problem." Applied Computing and Information Technology." Springer, Cham, 2017. p. 169-180.
[CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 4]

[34] G. K. Jati, R. Manurung, "Discrete firefly algorithm for traveling salesman problem: A new movement scheme." Swarm Intelligence and Bio-Inspired Computation. Elsevier, pp. 295-312, 2013.
[CrossRef] [Web of Science Times Cited 11] [SCOPUS Times Cited 28]

[35] X. S. Yang, X. He, "Applications of nature-inspired algorithms." In Mathematical Foundations of Nature-Inspired Algorithms, Springer, pp. 87-97, 2019.

[36] D. R. Morrison, S. H. Jacobson, J. J. Sauppe, E. C. Sewell, "Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning." Discrete Optimization, vol. 19, pp. 79-102, 2016.
[CrossRef] [Web of Science Times Cited 64] [SCOPUS Times Cited 89]

[37] A. Schickedanz, D. Ajwani, U. Meyer, P. Gawrychowski, "Average case behavior of k-shortest path algorithms." In International Conference on Complex Networks and their Applications, Springer, pp. 28-40, 2018.
[CrossRef] [SCOPUS Times Cited 2]

[38] F. Gang, "Finding k-shortest simple paths in directed graphs: A node classification algorithm." Networks, vol. 64, pp. 6-17, 2014.
[CrossRef] [Web of Science Times Cited 5] [SCOPUS Times Cited 8]

References Weight

Web of Science® Citations for all references: 773 TCR
SCOPUS® Citations for all references: 1,126 TCR

Web of Science® Average Citations per reference: 20 ACR
SCOPUS® Average Citations per reference: 29 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2021-03-05 13:48 in 189 seconds.

Note1: Web of Science® is a registered trademark of Clarivate Analytics.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2021
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania

All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.

Website loading speed and performance optimization powered by: