IDEAS home Printed from https://ideas.repec.org/a/gvu/irosws/v2y2020i1id1102.html

A Novel Bi-Velocity Particle Swarm Optimization Scheme for Multicast Routing Problem

Author

Listed:
  • Subarna Shakya

Abstract

A nondeterministic polynomial (NP) with complete Multicast routing problem is defined using a bi-velocity particle swarm optimization (BVDPSO) is proposed in this paper. The shift of particle swarm optimization to the discrete or binary domain, stepping away from the continuous domain is the major impact of the work. Initially a bi-velocity strategy is built such that it characterizes each dimension in terms of 0 and 1. The basic function of this strategy is to describe the MRP's binary characteristics such that 0 stands for the node not being selected while 1 stands for selection. Based on the location and velocity of the original PSO in the continuous domain, the BVDPSO is updated. This will preserve the global search ability and fast convergence speed of the original PSO. 58 instances of large, medium and small scales are used for experimentation in the OR-Library. Based on the results, it is identified that it is possible to get near-optimal or optimal solutions for BVDPSO as it requires generation of limited multicast trees. This approach is found to be optimal over its peers and outperforms recent heuristic algorithms and many advanced techniques used for the MRP problem. They also outperform several PSO, ant colony optimization and genetic algorithms.

Suggested Citation

Handle: RePEc:gvu:irosws:v:2:y:2020:i:1:id:1102
DOI: 10.36548/jsws.2020.1.006
as

Download full text from publisher

File URL: https://irojournals.com/irosws/article/view/1102
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/irosws/article/download/1102/980
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jsws.2020.1.006?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
---><---

More about this item

Keywords

;
;
;
;
;

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:gvu:irosws:v:2:y:2020:i:1:id:1102. 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 Manager (email available below). General contact details of provider: https://irojournals.com/irosws .

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.