EcoRestoration and Nano Bioremediation of Polluted Soil Using Nanomaterial-Synthesized Biosurfactants

EcoRestoration and Nano Bioremediation of Polluted Soil Using Nanomaterial-Synthesized Biosurfactants
  IJETT-book-cover           
  
© 2025 by IJETT Journal
Volume-73 Issue-8
Year of Publication : 2025
Author : Prayoga Yudha Pamungkas
DOI : 10.14445/22315381/IJETT-V73I8P126

How to Cite?
Prayoga Yudha Pamungkas,"EcoRestoration and Nano Bioremediation of Polluted Soil Using Nanomaterial-Synthesized Biosurfactants", International Journal of Engineering Trends and Technology, vol. 73, no. 8, pp.303-311, 2025. Crossref, https://doi.org/10.14445/22315381/IJETT-V73I8P126

Abstract
The newly proposed Modified Sailfish Optimizer (MSFO) is designed to address the issue of the Traveling Salesmen Problem (TSP) effectively. In this modification, Opposition-Based Learning (OBL) is hybridized to enhance population diversity and speed up convergence. A simplified attack power mechanism improves the exploration-exploitation balance, which helps MSFO escape local optima and find better solutions. Experimental results on benchmark TSP instances prove that MSFO outperforms among the compared algorithms. It achieves optimal solutions with zero deviation and is better than the compared algorithms. MSFO can discover the minimum possible tours that other algorithms cannot reach, and the best solution. These results confirm that the proposed modifications significantly improve the effectiveness of the original Sailfish Optimizer.

Keywords
Modified Sailfish Optimizer, metaheuristics, Opposition based learning, Traveling Salesman Problem, Discrete optimization.

References
[1] Petrică C. Pop et al., “A Comprehensive Survey on the Generalized Traveling Salesman Problem,” European Journal of Operational Research, vol. 314, no. 3, pp. 819-835, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[2] Mohd Arfian Ismail, “A GPU Accelerated Parallel Genetic Algorithm for the Traveling Salesman Problem,” Journal of Soft Computing and Data Mining, vol. 5, no. 2, pp. 137-150, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Irina Dumitrescu, and Thomas Stützle, Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms, Annals of Information Systems, Boston, Massachusetts, vol. 10, pp. 103-134, 2009.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Agung Chandra, and Aulia Naro, “S-Metaheuristics Approach to Solve Traveling Salesman Problem,” Metris: Journal of Science and Technology, vol. 21, no. 2, pp. 111-115, 2020.
[CrossRef] [Google Scholar] [Publisher Link]
[5] S. Shadravan, H.R. Naji, and V.K. Bardsiri, “The Sailfish Optimizer: A Novel Nature-Inspired Metaheuristic Algorithm for Solving Constrained Engineering Optimization Problems,” Engineering Applications of Artificial Intelligence, vol. 80, pp. 20-34, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Mamta Kumari et al., “Utilizing A Hybrid Metaheuristic Algorithm to Solve Capacitated Vehicle Routing Problem,” Results in Control and Optimization, vol. 13, pp. 1-15, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[7] Battina Srinuvasu Kumar, S.G. Santhi, and S. Narayana, “Sailfish Optimizer Algorithm (SFO) for Optimized Clustering in Wireless Sensor Network (WSN),” Journal of Engineering, Design and Technology, vol. 20, no. 6, pp. 1449-1467, 2022.
[CrossRef] [Google Scholar] [Publisher Link]
[8] Mesfer Al Duhayyim et al., “Sailfish Optimization with Deep Learning Based Oral Cancer Classification Model,” Computer Systems Science and Engineering, vol. 45, no. 1, pp. 753-767, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Safaa. M. Azzam, O.E. Emam, and Ahmed Sabry Abolaban, “An Improved Differential Evolution with Sailfish Optimizer (DESFO) for Handling Feature Selection Problem,” Scientific Reports, vol. 14, pp. 1-27, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[10] R. Sathyavani, K. JaganMohan, and B. Kalaavathi, “Sailfish Optimization Algorithm with Deep Convolutional Neural Network for Nutrient Deficiency Detection in Rice Plants,” Journal of Pharmaceutical Negative Results, vol. 14, no. 2, pp. 1713-1728, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[11] Mazen Mushabab Alqahtani et al., “Sailfish Optimizer with EfficientNet Model for Apple Leaf Disease Detection,” Computers, Materials and Continua, vol. 74, no. 1, pp. 217-233, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[12] Utkarsh Mahadeo Khaire et al., “Instigating the Sailfish Optimization Algorithm based on Opposition-Based Learning to Determine the Salient Features from a High-Dimensional Dataset,” International Journal of Information Technology & Decision Making, vol. 22, no. 5, pp. 1617-1649, 2023.
[CrossRef] [Google Scholar] [Publisher Link]
[13] Caio Paziani Tomazella, and Marcelo Seido Nagano, “A Comprehensive Review of Branch-and-Bound Algorithms: Guidelines and Directions for Further Research on the Flowshop Scheduling Problem,” Expert Systems with Applications, vol. 158, pp. 1-19, 2020.
[CrossRef] [Google Scholar] [Publisher Link]
[14] P. Rajarajeswari, and D. Maheswari, “Travelling Salesman Problem Using Branch and Bound Technique,” International Journal of Mathematics Trends and Technology, vol. 66, no. 5, pp. 202-206, 2020.
[CrossRef] [Google Scholar] [Publisher Link]
[15] Wenqiang Yanget al., “Improved Shuffled Frog Leaping Algorithm for Solving Multi-aisle Automated Warehouse Scheduling Optimization,” Communications in Computer and Information Science, Berlin, Germany, pp. 82-92, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[16] Li Li et al., “A Discrete Artificial Bee Colony Algorithm for TSP Problem,” Lecture Notes in Computer Science, Berlin, Heidelberg, pp. 566-573, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[17] Rajesh Matai, Surya Singh, and Murari Lal Mittal, Traveling Salesman Problem: An Overview of Applications, Formulations, and Solution Approaches, InTech, pp. 1-26, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[18] G. Dantzig, R. Fulkerson, and S. Johnson, “Solution of a Large-Scale Traveling-Salesman Problem,” Journal of the Operations Research Society of America, vol. 2, no. 4, pp. 393-410, 1954.
[CrossRef] [Google Scholar] [Publisher Link]
[19] Dalia T. Akl et al., “IHHO: An Improved Harris Hawks Optimization Algorithm for Solving Engineering Problems,” Neural Computing and Applications, vol. 36, pp. 12185-12298, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[20] Woong Sagong, Woo-Pyung Jeon, and Haecheon Choi, “Hydrodynamic Characteristics of the Sailfish (Istiophorus Platypterus) and Swordfish (Xiphias gladius) in Gliding Postures at their Cruise Speeds,” PLoS One, vol. 8, no. 12, pp. 1-14, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[21] James E. Herbert-Read et al., “Proto-Cooperation: Group Hunting Sailfish Improve Hunting Success by Alternating Attacks on Grouping Prey,” Proceedings of the Royal Society B: Biological Sciences, vol. 283, no. 1842, pp. 1-9, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[22] Tae Jong Choi, Julian Togelius, and Yun-Gyung Cheong, “A Fast and Efficient Stochastic Opposition-Based Learning for Differential Evolution in Numerical Optimization,” Swarm and Evolutionary Computation, vol. 60, pp. 1-25, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[23] Shahryar Rahnamayan, Hamid R. Tizhoosh, and Magdy M. A. Salama, “Opposition-Based Differential Evolution,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 1, pp. 64-79, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[24] Hamid R. Tizhoosh, and Mario Ventresca, Oppositional Concepts in Computational Intelligence, Studies in Computational Intelligence, vol. 155, 2008.
[CrossRef] [Google Scholar] [Publisher Link]
[25] TSPLIB, Discrete and Combinatorial Optimization, Ruprecht-Karls-University Heidelberg, 2013. [Online]. Available: http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/