Crossref DOIMemberCiteFactoropen accessissn
SJIF Impact Factor 8.659 | ISSN: 2582-3930
IJSREM Logo

International Journal of Scientific Research in Engineering and Management

(Gateway to Global Scholars - An International, Scholarly, Multi-Disciplinary, Open Access Journal)

Peer-Reviewed Journal Designed to Meet UGC's Quality Parameters

HomeCurrent IssuePast IssuesPay OnlineConferencesEditorial BoardAbout UsContact Us
IJSREM

Loading article...

Follow Us

  • Google Scholar
  • ResearchGate
  • Academia.edu
  • Mendeley
  • LinkedIn
  • Facebook
  • Instagram

Journal Policies

  • Peer Review Policy
  • Publication Ethics
  • Copyright Infringement
  • Refund & Cancellation Policy
  • Terms and Conditions
  • Privacy Policy

Journal Identifiers & Licenses

  • ISSN Verified: 2582-3930ISSN Verified: 2582-3930
  • Crossref DOI: 10.55041Crossref DOI: 10.55041
  • SJIF Ranking: 08.659SJIF Ranking: 08.659
  • Licensed under CC BY 4.0Licensed under CC BY 4.0
  • ISO Certification: 9001:2015ISO Certification: 9001:2015
  • Indexed & Cited In: Google ScholarIndexed & Cited In: Google Scholar

Contact Us

International Journal of Scientific Research in Engineering and Management (IJSREM)

#62/1, New No 7, 1st Cross, 2nd Main, Ganganagar, R T Nagar, Bangalore North, Bangalore, Karnataka, India – 560032
[email protected]+91 93911 67991
logos
logos
Working Hours

Mon – Sat: 9:00 AM – 6:00 PM

Sunday: 10:00 AM – 4:00 PM

+91 93911 67991

© 2026 IJSREM – International Journal of Scientific Research in Engineering and Management. This is an open-access journal. Articles are published under the Creative Commons Attribution (CC BY 4.0) License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

DisclaimerPrivacy PolicyTerms and Conditions
ArticlePeer ReviewedOpen AccessPlagiarism Passed
Paper ID:IJSREM62043

Design & Development of a TLBO – based Metaheuristic Optimization Framework for Extractive Text Summarization

Stream/Area:

-

Subject:

-

Paper ID:

IJSREM62043

Volume:

10 |

4 |

April 2026

Pages:

1-22

Publication Frequency:

Monthly (12 issues per year)

DOI
Digital Object Identifier
10.55041/IJSREM62043

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.

Share this article:

Authors

Nidhi Suthar

Nidhi Suthar

Department of Computer Engineering

Sankalchand Patel University

Download Author Certificate
HKP

Heena K. Patel

Department of Computer Engineering

Sankalchand Patel University

Download Co-Author Certificate
HM

Hiral Modi

Department of Computer Engineering

Sankalchand Patel University

Download Co-Author Certificate
RP

Rudrax Pandya

Department of Computer Engineering

Sankalchand Patel University

Download Co-Author Certificate

Author Services & Downloads

Full ArticlesAcceptance Certificate

Abstract

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

Keyword: Automatic Text Summarization Metaheuristics optimization Extractive Summarization NLP

Cite This Article

Nidhi Suthar, Heena K. Patel, Hiral Modi, Rudrax Pandya, "Design & Development of a TLBO – based Metaheuristic Optimization Framework for Extractive Text Summarization," International Journal of Scientific Research in Engineering and Management, vol. 10, no. 4, pp. 1-22, April 2026. https://doi.org/10.55041/IJSREM62043

Full Article/Conclusion

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.

References

[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.

Editorial & Review Transparency

Publication Date

4/30/2026

Peer Review Type

Double-Blind Peer Review

Review Rounds: 2

Documents

Review Report (Confidential)
Copyright Form (Office)

Article Metrics & Impact

Article Views

0

Total views since publication

PDF Downloads

4

Total downloads since publication

Geographic Reach

5

Indexing, Archiving & Preservation

Google Scholar
Academia
ResearchGate
Crossref
SSRN
Semantic Scholar
Thomson Reuters
WorldCat
Mendeley
OpenAlex
EBSCO
Zenodo

Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.

Ethics, Compliance & Transparency

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.

Similar & Recommended Articles

Similar Articles by Topic

Related research in the same subject area

Loading similar articles...