Recent research in finding the optimal path by ant colony optimization

4Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

The computation of the optimal path is one of the critical problems in graph theory. It has been utilized in various practical ranges of real world applications including image processing, file carving and classification problem. Numerous techniques have been proposed in finding optimal path solutions including using ant colony optimization (ACO). This is a nature-inspired metaheuristic algorithm, which is inspired by the foraging behavior of ants in nature. Thus, this paper study the improvement made by many researchers on ACO in finding optimal path solution. Finally, this paper also identifies the recent trends and explores potential future research directions in file carving.

Cite

CITATION STYLE

APA

Sari, S. A., & Mohamad, K. M. (2021). Recent research in finding the optimal path by ant colony optimization. Bulletin of Electrical Engineering and Informatics, 10(2), 1015–1023. https://doi.org/10.11591/eei.v10i2.2690

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free