Abstract
This study investigates the dynamic shortest path routing (DSPR) problem in mobile ad-hoc networks. The goal is to find the shortest possible path that connects a source node with the destination node while effectively handling dynamic changes occurring on the ad-hoc networks. The key challenge in DSPR is how to simultaneously keep track changes and search for the global optima. A multi-memory based multi-population memetic algorithm is proposed for DSPR in this paper. The proposed algorithm combines the strength of three different strategies, multi-memory, multi-population and memetic algorithm, aiming to effectively explore and exploit the search space. It divides the search space by multiple populations. The distribution of solutions in each population is kept in the associated memory. The multi-memory multi-population approach is to capture dynamic changes and maintain search diversity. The memetic component, which is a hybrid Genetic Algorithm (GA) and local search, is to find high quality solutions. The performance of the proposed algorithm is evaluated on benchmark DSPR instances under both cyclic and acyclic environments. Our method obtained better results when compared with existing methods in the literatures, showing the effectiveness of the proposed algorithm in handling dynamic optimisation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ahn, C.W., Ramakrishna, R.S.: A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans. Evol. Comput. 6(6), 566–579 (2002)
Branke, J.: Evolutionary Optimization in Dynamic Environments, vol. 3. Springer Science & Business Media, New York (2012)
Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT press, Cambridge (1992)
Lee, S., Soak, S., Kim, K., Park, H., Jeon, M.: Statistical properties analysis of real world tournament selection in genetic algorithms. Appl. Intell. 28(2), 195–205 (2008)
Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech Concurrent Comput. Program, C3P Rep. 826, 1989 (1989)
Neri, F., Cotta, C.: Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol. Comput. 2, 1–14 (2012)
Oh, S., Ahn, C.W., Ramakrishna, R.S.: A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints. In: King, I., Wang, J., Chan, L.-W., Wang, D.L. (eds.) ICONIP 2006. LNCS, vol. 4234, pp. 807–816. Springer, Heidelberg (2006)
Sabar, N.R., Song, A.: Dual population genetic algorithm for the cardinality constrained portfolio selection problem. In: Dick, G., Browne, W.N., Whigham, P., Zhang, M., Bui, L.T., Ishibuchi, H., Jin, Y., Li, X., Shi, Y., Singh, P., Tan, K.C., Tang, K. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 703–712. Springer, Heidelberg (2014)
Sabar, N.R., Song, A., Tari, Z., Yi, X., Zomaya, A.: A memetic algorithm for dynamic shortest path routing on mobile ad-hoc networks. In: 2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS), pp. 60–67. IEEE (2015)
Sabar, N.R., Song, A., Zhang, M.: A variable local search based memetic algorithm for the load balancing problem in cloud computing. In: Squillero, G., Burelli, P. (eds.) EvoApplications 2016. LNCS, vol. 9597, pp. 267–282. Springer, Heidelberg (2016). doi:10.1007/978-3-319-31204-0_18
Turky, A.M., Abdullah, S., Sabar, N.R.: A hybrid harmony search algorithm for solving dynamic optimisation problems. Procedia Comput. Sci. 29, 1926–1936 (2014)
Yang, S., Cheng, H., Wang, F.: Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks. IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev. 40(1), 52–63 (2010)
Yang, S., Yao, X.: Population-based incremental learning with associative memory for dynamic environments. IEEE Trans. Evol. Comput. 12(5), 542–561 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Sabar, N.R., Turky, A., Song, A. (2016). A Multi-memory Multi-population Memetic Algorithm for Dynamic Shortest Path Routing in Mobile Ad-hoc Networks. In: Booth, R., Zhang, ML. (eds) PRICAI 2016: Trends in Artificial Intelligence. PRICAI 2016. Lecture Notes in Computer Science(), vol 9810. Springer, Cham. https://doi.org/10.1007/978-3-319-42911-3_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-42911-3_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42910-6
Online ISBN: 978-3-319-42911-3
eBook Packages: Computer ScienceComputer Science (R0)