IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i4d10.1007_s10878-013-9676-y.html
   My bibliography  Save this article

Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks

Author

Listed:
  • Fouad Kharroubi

    (Hunan University)

  • Jing He

    (Hunan University)

  • Jin Tang

    (Hunan University)

  • Ming Chen

    (Hunan University)

  • Lin Chen

    (Hunan University)

Abstract

In this paper, we deal with the static Routing and Wavelength Assignment (RWA) problem in networks with no wavelength converters, and where a given static set of connection demands is prearranged. Our objective is to maximize the number of optical connection-requests that can be established for a given number of wavelengths. A mathematical formulation for Max-RWA was presented. In this article, we implement and compare the performance of two random search algorithms namely: the genetic algorithm and the tabu search algorithm. Using these metaheuristics we solved approximately the wavelength assignment problem for Max-RWA while we computed its routing by a deterministic method which is the backtracking. Therefore we conducted many extensive experiments under different circumstances. Diagrams and representative numerical examples indicate the accuracy of our algorithms.

Suggested Citation

  • Fouad Kharroubi & Jing He & Jin Tang & Ming Chen & Lin Chen, 2015. "Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1042-1061, November.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-013-9676-y
    DOI: 10.1007/s10878-013-9676-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9676-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-013-9676-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Thiago Noronha & Mauricio Resende & Celso Ribeiro, 2011. "A biased random-key genetic algorithm for routing and wavelength assignment," Journal of Global Optimization, Springer, vol. 50(3), pages 503-518, July.
    2. Carlos A.S. Oliveira & Panos M. Pardalos, 2011. "Mathematical Aspects of Network Routing Optimization," Springer Optimization and Its Applications, Springer, number 978-1-4614-0311-1, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jaromír Kukal & Matej Mojzeš, 2018. "Quantile and mean value measures of search process complexity," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1261-1285, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    2. Jonatas B. C. Chagas & Julian Blank & Markus Wagner & Marcone J. F. Souza & Kalyanmoy Deb, 2021. "A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem," Journal of Heuristics, Springer, vol. 27(3), pages 267-301, June.
    3. Xiaoyu Yu & Jingyi Qian & Yajing Zhang & Min Kong, 2023. "Supply Chain Scheduling Method for the Coordination of Agile Production and Port Delivery Operation," Mathematics, MDPI, vol. 11(15), pages 1-24, July.
    4. Amiyne Zakouni & Jiawei Luo & Fouad Kharroubi, 2017. "Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 726-741, February.
    5. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    6. Dianne Villicaña-Cervantes & Omar J. Ibarra-Rojas, 2024. "Accessible location of mobile labs for COVID-19 testing," Health Care Management Science, Springer, vol. 27(1), pages 1-19, March.
    7. F. Stefanello & L. S. Buriol & M. J. Hirsch & P. M. Pardalos & T. Querido & M. G. C. Resende & M. Ritt, 2017. "On the minimization of traffic congestion in road networks with tolls," Annals of Operations Research, Springer, vol. 249(1), pages 119-139, February.
    8. Perea, Federico & Yepes-Borrero, Juan C. & Menezes, Mozart B.C., 2023. "Acceptance Ordering Scheduling Problem: The impact of an order-portfolio on a make-to-order firm’s profitability," International Journal of Production Economics, Elsevier, vol. 264(C).
    9. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    10. Pedro Pinacho-Davidson & Christian Blum, 2020. "Barrakuda : A Hybrid Evolutionary Algorithm for Minimum Capacitated Dominating Set Problem," Mathematics, MDPI, vol. 8(11), pages 1-26, October.
    11. Gonçalves, José Fernando & Wäscher, Gerhard, 2020. "A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects," European Journal of Operational Research, Elsevier, vol. 286(3), pages 867-882.
    12. Julliany S. Brandão & Thiago F. Noronha & Celso C. Ribeiro, 2016. "A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks," Journal of Global Optimization, Springer, vol. 65(4), pages 813-835, August.
    13. Tangpattanakul, Panwadee & Jozefowiez, Nicolas & Lopez, Pierre, 2015. "A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite," European Journal of Operational Research, Elsevier, vol. 245(2), pages 542-554.
    14. Xinyun Wu & Shengfeng Yan & Xin Wan & Zhipeng Lü, 2016. "Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 445-468, August.
    15. Geiza Silva & André Leite & Raydonal Ospina & Víctor Leiva & Jorge Figueroa-Zúñiga & Cecilia Castro, 2023. "Biased Random-Key Genetic Algorithm with Local Search Applied to the Maximum Diversity Problem," Mathematics, MDPI, vol. 11(14), pages 1-11, July.
    16. Pinto, Bruno Q. & Ribeiro, Celso C. & Rosseti, Isabel & Plastino, Alexandre, 2018. "A biased random-key genetic algorithm for the maximum quasi-clique problem," European Journal of Operational Research, Elsevier, vol. 271(3), pages 849-865.
    17. Luís A. C. Roque & Dalila B. M. M. Fontes & Fernando A. C. C. Fontes, 2017. "A Metaheuristic Approach to the Multi-Objective Unit Commitment Problem Combining Economic and Environmental Criteria," Energies, MDPI, vol. 10(12), pages 1-25, December.
    18. Caserta, Marco & Voß, Stefan, 2019. "The robust multiple-choice multidimensional knapsack problem," Omega, Elsevier, vol. 86(C), pages 16-27.
    19. Caio César Freitas & Dario José Aloise & Fábio Francisco Costa Fontes & Andréa Cynthia Santos & Matheus Silva Menezes, 2023. "A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 903-924, September.
    20. Andrade, Carlos E. & Toso, Rodrigo F. & Gonçalves, José F. & Resende, Mauricio G.C., 2021. "The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications," European Journal of Operational Research, Elsevier, vol. 289(1), pages 17-30.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:30:y:2015:i:4:d:10.1007_s10878-013-9676-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.