A multi-memory 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

Sabar, NR, Turky, Ayad ORCID logoORCID: https://orcid.org/0000-0001-8415-7328 and Song, Andy (2016) A multi-memory multi-population memetic algorithm for dynamic shortest path routing in mobile ad-hoc networks. In: PRICAI 2016, 22 Aug 2016 - 26 Aug 2016, Phuket, Thailand.

Dimensions Badge

Altmetric Badge

View Altmetric information about this item.

Item type Conference or Workshop Item (Paper)
URI https://vuir.vu.edu.au/id/eprint/42916
DOI 10.1007/978-3-319-42911-3_34
Official URL https://link.springer.com/chapter/10.1007%2F978-3-...
ISBN 9783319429106
Subjects Current > FOR (2020) Classification > 4602 Artificial intelligence
Current > Division/Research > College of Science and Engineering
Keywords shortest path routing problems; multi-memory multi-population; memetic algorithm; dynamic optimization; DSPR; MANET
Citations in Scopus 11 - View on Scopus
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login

CORE (COnnecting REpositories)