Output details
11 - Computer Science and Informatics
Brunel University London
Return to search
Output 0 of 0 in the submission
Article title
Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks
Type
D - Journal article
Title of journal
IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
Article number
-
Volume number
40
Issue number
1
First page of article
52
ISSN of journal
1094-6977
Year of publication
2009
Number of additional authors
2
Additional information
<12> Published in a journal ranked 2nd (out of 21) in Computer Science (Cybernetics) according to ISI Web of Knowledge, this is the first paper that investigated the effectiveness and efficiency of immigrants and memory-based genetic algorithms in solving dynamic shortest path routing problems in real-world networks, e.g., mobile ad hoc networks. Supported by EPSRC, the paper was a result of a successful collaboration between the academics and industry (BT) and has received the 11th highest number of citations among 298 papers (top 4%) published in IEEE TSMC Part C since 2011.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
34
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
