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. 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, August.
    2. 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.
    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. 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.
    4. 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.
    5. Pessoa, Luciana S. & Andrade, Carlos E., 2018. "Heuristics for a flowshop scheduling problem with stepwise job objective function," European Journal of Operational Research, Elsevier, vol. 266(3), pages 950-962.
    6. M. A. Raayatpanah & P. M. Pardalos, 2018. "Reliability evaluation of a multicast over coded packet networks," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 921-940, April.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Galrão Ramos, A. & Oliveira, José F. & Gonçalves, José F. & Lopes, Manuel P., 2016. "A container loading algorithm with static mechanical equilibrium stability constraints," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 565-581.
    12. 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).
    13. Sam Heshmati & Jannes Verstichel & Eline Esprit & Greet Vanden Berghe, 2019. "Alternative e-commerce delivery policies," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 217-248, September.
    14. 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.
    15. 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.
    16. Ghorashi Khalilabadi, S. M. & Roy, D. & de Koster, M.B.M., 2022. "A Data-driven Approach to Enhance Worker Productivity by Optimizing Facility Layout," ERIM Report Series Research in Management ERS-2022-003-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    17. 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.
    18. Bernardo F. Almeida & Isabel Correia & Francisco Saldanha-da-Gama, 2018. "A biased random-key genetic algorithm for the project scheduling problem with flexible resources," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 283-308, July.
    19. 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.
    20. Fabrizio Altarelli & Alfredo Braunstein & Luca Dall’Asta & Caterina De Bacco & Silvio Franz, 2015. "The Edge-Disjoint Path Problem on Random Graphs by Message-Passing," PLOS ONE, Public Library of Science, vol. 10(12), pages 1-18, December.

    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.