Output details
11 - Computer Science and Informatics
Brunel University London
Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks
<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.