IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v9y2018i4p22-36.html
   My bibliography  Save this article

Solving Multi-Objective Multicast Routing Problem Using a New Hybrid Approach

Author

Listed:
  • Mohammed Mahseur

    (University of Sciences and Technology Houari Boumediene, Algeria)

  • Abdelmadjid Boukra

    (University of Sciences and Technology Houari Boumediene, Algeria)

  • Yassine Meraihi

    (University of M'Hamed Bougara Boumerdes, Algeria)

Abstract

Multicast routing is the problem of finding the spanning tree of a set of destinations whose roots are the source node and its leaves are the set of destination nodes by optimizing a set of quality of service parameters and satisfying a set of transmission constraints. This article proposes a new hybrid multicast algorithm called Hybrid Multi-objective Multicast Algorithm (HMMA) based on the Strength Pareto Evolutionary Algorithm (SPEA) to evaluate and classify the population in dominated solutions and non-dominated solutions. Dominated solutions are evolved by the Bat Algorithm, and non-dominated solutions are evolved by the Firefly Algorithm. Old and weak solutions are replaced by new random solutions by a process of mutation. The simulation results demonstrate that the proposed algorithm is able to find good Pareto optimal solutions compared to other algorithms.

Suggested Citation

  • Mohammed Mahseur & Abdelmadjid Boukra & Yassine Meraihi, 2018. "Solving Multi-Objective Multicast Routing Problem Using a New Hybrid Approach," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 9(4), pages 22-36, October.
    • Handle: RePEc:igg:jaec00:v:9:y:2018:i:4:p:22-36
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAEC.2018100102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jaec00:v:9:y:2018:i:4:p:22-36. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.