A multi-population memetic algorithm for dynamic shortest path routing in mobile ad-hoc networks
Download
Full text for this resource is not available from the Research Repository.
Export
Turky, Ayad ORCID: 0000-0001-8415-7328 (external link), Sabar, NR and Song, Andy (2016) A multi-population memetic algorithm for dynamic shortest path routing in mobile ad-hoc networks. In: IEEE World Congress on Computational Intelligence (IEEE WCCI 2016), 24 Jul 2016 - 29 Jul 2016, Vancouver, Canada.
Dimensions Badge
Altmetric Badge
Item type | Conference or Workshop Item (Paper) |
URI | https://vuir.vu.edu.au/id/eprint/42917 |
DOI | 10.1109/CEC.2016.7744313 (external link) |
Official URL | https://ieeexplore.ieee.org/document/7744313 (external link) |
ISBN | 9781509006243 |
Subjects | Current > FOR (2020) Classification > 4602 Artificial intelligence Current > Division/Research > College of Science and Engineering |
Keywords | multi-population memetic algorithm; dynamic optimisation; dynamic shortest path routing problem; DSPR; MANET |
Citations in Scopus | 13 - View on Scopus (external link) |
Download/View statistics | View download statistics for this item |
CORE (COnnecting REpositories)