Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
IJSREM62043
Volume:
10 |
4 |
April 2026
Pages:
1-22
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.

Department of Computer Engineering
Sankalchand Patel University
Department of Computer Engineering
Sankalchand Patel University
Department of Computer Engineering
Sankalchand Patel University
Department of Computer Engineering
Sankalchand Patel University
Nowadays, various types of digital text data are available online and offline like news, research articles. The sudden explosion in digital text data has created a great need for efficient summarization methods that are capable of extracting important information quickly. It becomes increasingly difficult to extract any specific information from all this large data. The empirical basis of digital data has made automatic text summarization (ATS) an important area of research in natural language processing (NLP). Various methods are available for automatic text summarization like extractive text summarization and abstractive text summarization. Among various techniques, extractive summarization is widely used due to its simplicity and effectiveness. However, traditional heuristic and statistical approaches often struggle with redundancy, coherence and textual consistency. This research paper presents a comprehensive metaheuristic-based extractive text summarization using a Teaching-Learning based optimization algorithm. This algorithm optimizes sentence selection by balancing average, diversity and information. Benchmark datasets, including DUC2005 and DUC2006, along with evaluation metrics such as ROUGE and BLEU, are important for evaluating performance.
KEYWORDS
Extractive text summarization based on metaheuristics turns out to be a potent way to deal with the constantly increasing amount of digital data. By leveraging algorithms such as Firefly, Frog Leaping, and Teaching-Learning-Based optimization, these approaches effectively balance relevance, coherence, and coverage while minimizing redundancy. Compared to conventional methods, they demonstrate superior performance on benchmark datasets and hold strong potential for multilingual, domain-specific, and real-time applications. Hence, metaheuristic-driven summarization stands as a promising direction for advancing efficient and intelligent information retrieval in NLP.
[1] Vilca, G. C. V., & Cabezudo, M. a. S. (2017b). A study of abstractive summarization using semantic representations and discourse level information. In Lecture notes in computer science (pp. 482–490). https://doi.org/10.1007/978-3-319-64206-2_54 [2] El-Kassas, W. S., Salama, C. R., Rafea, A. A., & Mohamed, H. K. (2020). Automatic text summarization: A comprehensive survey. Expert Systems With Applications, 165, 113679. https://doi.org/10.1016/j.eswa.2020.113679 [3] Sri, S. H. B., & Dutta, S. R. (2021b). A survey on Automatic text Summarization Techniques. Journal of Physics Conference Series, 2o4o(1), o12o44. https://doi.org/10.1088/1742-6596/2040/1/012044 [4] Patel, V., & Tabrizi, N. (2022). An automatic text summarization: a systematic review. Computación Y Sistemas, 26(3). https://doi.org/10.13053/cys-26-3-4347 [5] Sharma, G., & Sharma, D. (2022). Automatic Text Summarization Methods: A Comprehensive Review. SN Computer Science, 4(1). https://doi.org/10.1007/s42979-022-01446-w [6] Bhat, I. K., Mohd, M., & Hashmy, R. (2017b). SUMITUP: a Hybrid Single-Document text Summarizer. In Advances in intelligent systems and computing (pp. 619–634). https://doi.org/10.1007/978-981-10-5687-1_56 [7] I. K. Bhat, M. Mohd, and R. Hashmy, “SumItUp: A hybrid single-document text summarizer,” Adv. Intell. Syst. Comput., vol. 583, pp. 619–634, 2018, doi: 10.1007/978-981-10-5687-1_56. [8] F. Dernoncourt, M. Ghassemi, and W. Chang, “A repository of corpora for summarization,” in Proc. 11th Int. Conf. Lang. Resour. Eval. (LREC), 2018, pp. 3221–3227. [9] K. Woodsend and M. Lapata, “Automatic generation of story highlights,” in Proc. Annu. Meet. Assoc. Comput. Linguist., Jul. 2010, pp. 565–574. [10] A. Tandel, B. Modi, P. Gupta, S. Wagle, and S. Khedkar, “Multi-document text summarization – a survey,” in Proc. Int. Conf. Data Min. Adv. Comput. (SAPIENCE), 2016, pp. 331–334, doi: 10.1109/SAPIENCE.2016.7684115.
Publication Date
4/30/2026
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
4
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...