{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:57:18Z","timestamp":1773194238907,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T00:00:00Z","timestamp":1675296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T00:00:00Z","timestamp":1675296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007102","name":"Zagazig University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007102","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Due to the exponential overflow of textual information in various fields of knowledge and on the internet, it is very challenging to extract important information or to generate a summary from some multi-document collection in a specific field. With such a gigantic amount of textual content, human text summarization becomes impractical since it is expensive and consumes a lot of time and effort. So, developing automatic text summarization (ATS) systems is becoming increasingly essential<jats:bold>.<\/jats:bold> ATS approaches are either extractive or abstractive. The extractive approach is simpler and faster than the abstractive approach. This work proposes an extractive ATS system that aims to extract a small subset of sentences from a large multi-document text. First, the whole text is preprocessed by applying some natural language processing techniques such as sentences segmentation, words tokenization, removal of stop-words, and stemming to provide a structured representation of the original document collection. Based on this structured representation, the ATS problem is formulated as a multi-objective optimization (MOO) problem that optimizes the extracted summary to maintain the coverage of the main text content while avoiding redundant information. Secondly, an evolutionary sparse multi-objective algorithm is developed to solve the formulated large-scale MOO. The output of this algorithm is a set of non-dominated summaries (Pareto front). A novel criterion is proposed to select the target summary from the Pareto front. The proposed ATS system has been examined using (DUC) datasets, and the output summaries have been evaluated using (ROUGE) metrics and compared with the literature.\n<\/jats:p>","DOI":"10.1007\/s40747-023-00967-y","type":"journal-article","created":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T04:58:36Z","timestamp":1675313916000},"page":"4629-4644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Automatic multi-documents text summarization by a large-scale sparse multi-objective optimization algorithm"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0875-2202","authenticated-orcid":false,"given":"H.","family":"Abo-Bakr","sequence":"first","affiliation":[]},{"given":"S. A.","family":"Mohamed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,2]]},"reference":[{"key":"967_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113679","volume":"165","author":"WS El-Kassas","year":"2021","unstructured":"El-Kassas WS et al (2021) Automatic text summarization: a comprehensive survey. Expert Syst Appl 165:113679","journal-title":"Expert Syst Appl"},{"key":"967_CR2","doi-asserted-by":"crossref","unstructured":"Vilca, G.C.V. and M.A.S. Cabezudo. A study of abstractive summarization using semantic representations and discourse level information. in International Conference on Text, Speech, and Dialogue. 2017. Springer.","DOI":"10.1007\/978-3-319-64206-2_54"},{"key":"967_CR3","doi-asserted-by":"crossref","unstructured":"Andhale, N. and L. Bewoor. An overview of text summarization techniques. in 2016 International Conference on Computing Communication Control and automation (ICCUBEA). 2016. IEEE.","DOI":"10.1109\/ICCUBEA.2016.7860024"},{"key":"967_CR4","doi-asserted-by":"crossref","unstructured":"Hingu, D., D. Shah, and S.S. Udmale. Automatic text summarization of Wikipedia articles. in 2015 international conference on communication, information & computing technology (ICCICT). 2015. IEEE.","DOI":"10.1109\/ICCICT.2015.7045732"},{"key":"967_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112904","volume":"140","author":"JM Sanchez-Gomez","year":"2020","unstructured":"Sanchez-Gomez JM, Vega-Rodriguez MA, Perez CJ (2020) Experimental analysis of multiple criteria for extractive multi-document text summarization. Expert Syst Appl 140:112904","journal-title":"Expert Syst Appl"},{"issue":"6","key":"967_CR6","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/j.ipm.2003.10.006","volume":"40","author":"DR Radev","year":"2004","unstructured":"Radev DR et al (2004) Centroid-based summarization of multiple documents. Inf Process Manage 40(6):919\u2013938","journal-title":"Inf Process Manage"},{"issue":"1","key":"967_CR7","doi-asserted-by":"publisher","DOI":"10.1111\/exsy.12340","volume":"36","author":"RM Alguliyev","year":"2019","unstructured":"Alguliyev RM et al (2019) COSUM: text summarization based on clustering and optimization. Expert Syst 36(1):e12340","journal-title":"Expert Syst"},{"key":"967_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.eswa.2019.05.045","volume":"134","author":"D Patel","year":"2019","unstructured":"Patel D, Shah S, Chhinkaniwala H (2019) Fuzzy logic based multi document summarization with improved sentence scoring and redundancy removal technique. Expert Syst Appl 134:167\u2013177","journal-title":"Expert Syst Appl"},{"issue":"2","key":"967_CR9","first-page":"1489","volume":"56","author":"HH Saleh","year":"2015","unstructured":"Saleh HH, Kadhim NJ, Attea B (2015) A genetic based optimization model for extractive multi-document text summarization. Iraqi Journal of Science 56(2):1489\u20131498","journal-title":"Iraqi Journal of Science"},{"issue":"1","key":"967_CR10","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.csl.2008.04.002","volume":"23","author":"MA Fattah","year":"2009","unstructured":"Fattah MA, Ren F (2009) GA, MR, FFNN, PNN and GMM based models for automatic text summarization. Comput Speech Lang 23(1):126\u2013144","journal-title":"Comput Speech Lang"},{"issue":"4","key":"967_CR11","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1016\/j.ipm.2007.09.007","volume":"44","author":"DM Zajic","year":"2008","unstructured":"Zajic DM, Dorr BJ, Lin J (2008) Single-document and multi-document summarization techniques for email threads using sentence compression. Inf Process Manage 44(4):1600\u20131610","journal-title":"Inf Process Manage"},{"key":"967_CR12","doi-asserted-by":"crossref","unstructured":"Abo-Bakr H et al (2020) Weight optimization of axially functionally graded microbeams under buckling and vibration behaviors. Mechanics based design of structures and machines, p 1\u201322","DOI":"10.1080\/15397734.2020.1838298"},{"key":"967_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruct.2020.113370","volume":"258","author":"H Abo-bakr","year":"2021","unstructured":"Abo-bakr H  (2021) Multi-objective shape optimization for axially functionally graded microbeams. Compos Struct 258:113370","journal-title":"Compos Struct"},{"key":"967_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruct.2020.113193","volume":"258","author":"R Abo-Bakr","year":"2021","unstructured":"Abo-Bakr  R (2021) Optimal weight for buckling of FG beam under variable axial load using Pareto optimality. Compos Struct 258:113193","journal-title":"Compos Struct"},{"issue":"3","key":"967_CR15","doi-asserted-by":"publisher","first-page":"1841","DOI":"10.1007\/s10462-020-09893-8","volume":"54","author":"A Tzanetos","year":"2021","unstructured":"Tzanetos A, Dounias G (2021) Nature inspired optimization algorithms or simply variations of metaheuristics? Artif Intell Rev 54(3):1841\u20131862","journal-title":"Artif Intell Rev"},{"key":"967_CR16","doi-asserted-by":"crossref","unstructured":"Li J-Y et al (2022) A multipopulation multiobjective ant colony system considering travel and prevention costs for vehicle routing in COVID-19-like epidemics. IEEE Transactions on Intelligent Transportation Systems","DOI":"10.1109\/TITS.2022.3180760"},{"key":"967_CR17","unstructured":"Li J-Y et al (2021) Surrogate-assisted hybrid-model estimation of distribution algorithm for mixed-variable hyperparameters optimization in convolutional neural networks. IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"4","key":"967_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.swevo.2011.06.006","volume":"1","author":"RM Alguliev","year":"2011","unstructured":"Alguliev RM, Aliguliyev RM, Mehdiyev CA (2011) Sentence selection for generic document summarization using an adaptive differential evolution algorithm. Swarm Evol Comput 1(4):213\u2013222","journal-title":"Swarm Evol Comput"},{"key":"967_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.asoc.2015.04.050","volume":"34","author":"RM Alguliyev","year":"2015","unstructured":"Alguliyev RM, Aliguliyev RM, Isazade NR (2015) An unsupervised approach to generating generic summaries of documents. Appl Soft Comput 34:236\u2013250","journal-title":"Appl Soft Comput"},{"key":"967_CR20","doi-asserted-by":"crossref","unstructured":"Benjumea SS, Le\u00f3n E (2015) Genetic clustering algorithm for extractive text summarization. In: 2015 IEEE symposium series on computational intelligence. IEEE","DOI":"10.1109\/SSCI.2015.139"},{"key":"967_CR21","doi-asserted-by":"crossref","unstructured":"Mendoza M et al (2014) A new memetic algorithm for multi-document summarization based on CHC algorithm and greedy search. In: Mexican international conference on artificial intelligence. Springer","DOI":"10.1007\/978-3-319-13647-9_14"},{"key":"967_CR22","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.knosys.2016.01.030","volume":"99","author":"J-P Qiang","year":"2016","unstructured":"Qiang J-P et al (2016) Multi-document summarization using closed patterns. Knowl-Based Syst 99:28\u201338","journal-title":"Knowl-Based Syst"},{"key":"967_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.eswa.2018.11.022","volume":"120","author":"P Verma","year":"2019","unstructured":"Verma P, Om H (2019) MCRMR: Maximum coverage and relevancy with minimal redundancy based multi-document summarization. Expert Syst Appl 120:43\u201356","journal-title":"Expert Syst Appl"},{"key":"967_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106231","volume":"91","author":"JM Sanchez-Gomez","year":"2020","unstructured":"Sanchez-Gomez JM, Vega-Rodr\u00edguez MA, Perez CJ (2020) A decomposition-based multi-objective optimization approach for extractive multi-document text summarization. Appl Soft Comput 91:106231","journal-title":"Appl Soft Comput"},{"key":"967_CR25","unstructured":"Kadhim NJ, Saleh HH (2018) Improving extractive multi-document text summarization through multi-objective optimization. Iraqi J Sci 2135\u20132149"},{"key":"967_CR26","doi-asserted-by":"crossref","unstructured":"Debnath, D., R. Das, and P. Pakray, Extractive single document summarization using multi-objective modified cat swarm optimization approach: ESDS-MCSO. Neural Computing and Applications, 2021: p. 1\u201316.","DOI":"10.1007\/s00521-021-06337-4"},{"key":"967_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107915","volume":"113","author":"JM Sanchez-Gomez","year":"2021","unstructured":"Sanchez-Gomez JM, Vega-Rodr\u00edguez MA, P\u00e9rez CJ (2021) Sentiment-oriented query-focused text summarization addressed with a multi-objective optimization approach. Appl Soft Comput 113:107915","journal-title":"Appl Soft Comput"},{"key":"967_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116769","volume":"198","author":"JM Sanchez-Gomez","year":"2022","unstructured":"Sanchez-Gomez JM, Vega-Rodr\u00edguez MA, P\u00e9rez CJ (2022) A multi-objective memetic algorithm for query-oriented text summarization: Medicine texts as a case study. Expert Syst Appl 198:116769","journal-title":"Expert Syst Appl"},{"key":"967_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100872","volume":"63","author":"J Ji","year":"2021","unstructured":"Ji J et al (2021) Evolutionary multi-task allocation for mobile crowdsensing with limited resource. Swarm Evol Comput 63:100872","journal-title":"Swarm Evol Comput"},{"key":"967_CR30","unstructured":"Ji J-J et al (2021) Q-learning-based hyperheuristic evolutionary algorithm for dynamic task allocation of crowdsensing. IEEE Trans Cybern"},{"issue":"2","key":"967_CR31","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1109\/TEVC.2019.2918140","volume":"24","author":"Y Tian","year":"2019","unstructured":"Tian Y et al (2019) An evolutionary algorithm for large-scale sparse multiobjective optimization problems. IEEE Trans Evol Comput 24(2):380\u2013393","journal-title":"IEEE Trans Evol Comput"},{"key":"967_CR32","doi-asserted-by":"crossref","unstructured":"Chen G et al (2022) A domain adaptation learning strategy for dynamic multiobjective optimization. Inf Sci","DOI":"10.1016\/j.ins.2022.05.050"},{"issue":"4","key":"967_CR33","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/TEVC.2019.2951217","volume":"24","author":"Y-N Guo","year":"2019","unstructured":"Guo Y-N et al (2019) Novel interactive preference-based multiobjective evolutionary optimization for bolt supporting networks. IEEE Trans Evol Comput 24(4):750\u2013764","journal-title":"IEEE Trans Evol Comput"},{"key":"967_CR34","unstructured":"Lin C-Y (2004) Rouge: aA package for automatic evaluation of summaries. In: Text summarization branches out"},{"issue":"3","key":"967_CR35","doi-asserted-by":"publisher","first-page":"258","DOI":"10.4304\/jetwi.2.3.258-268","volume":"2","author":"V Gupta","year":"2010","unstructured":"Gupta V, Lehal GS (2010) A survey of text summarization extractive techniques. Journal of emerging technologies in web intelligence 2(3):258\u2013268","journal-title":"Journal of emerging technologies in web intelligence"},{"key":"967_CR36","doi-asserted-by":"crossref","unstructured":"Willett P (2006) The Porter stemming algorithm: then and now. Program","DOI":"10.1108\/00330330610681295"},{"issue":"5","key":"967_CR37","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/0306-4573(88)90021-0","volume":"24","author":"G Salton","year":"1988","unstructured":"Salton G, Buckley C (1988) Term-weighting approaches in automatic text retrieval. Inf Process Manage 24(5):513\u2013523","journal-title":"Inf Process Manage"},{"key":"967_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2017.11.029","volume":"159","author":"JM Sanchez-Gomez","year":"2018","unstructured":"Sanchez-Gomez JM, Vega-Rodr\u00edguez MA, P\u00e9rez CJ (2018) Extractive multi-document text summarization using a multi-objective artificial bee colony optimization approach. Knowl-Based Syst 159:1\u20138","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"967_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2791291","volume":"42","author":"Y Mei","year":"2016","unstructured":"Mei Y et al (2016) A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization. ACM Transactions on Mathematical Software (TOMS) 42(2):1\u201324","journal-title":"ACM Transactions on Mathematical Software (TOMS)"},{"issue":"6","key":"967_CR40","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/TEVC.2017.2694221","volume":"21","author":"MN Omidvar","year":"2017","unstructured":"Omidvar MN et al (2017) DG2: A faster and more accurate differential grouping for large-scale black-box optimization. IEEE Trans Evol Comput 21(6):929\u2013942","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"967_CR41","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1109\/TEVC.2017.2778089","volume":"22","author":"Y Sun","year":"2017","unstructured":"Sun Y, Kirley M, Halgamuge SK (2017) A recursive decomposition method for large scale continuous optimization. IEEE Trans Evol Comput 22(5):647\u2013661","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"967_CR42","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1162\/106365600750078808","volume":"8","author":"M Pelikan","year":"2000","unstructured":"Pelikan M, Goldberg DE, Cantu-Paz E (2000) Linkage problem, distribution estimation, and Bayesian networks. Evol Comput 8(3):311\u2013340","journal-title":"Evol Comput"},{"issue":"2","key":"967_CR43","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"967_CR44","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s40747-017-0057-5","volume":"3","author":"Y Tian","year":"2017","unstructured":"Tian Y et al (2017) Effectiveness and efficiency of non-dominated sorting for evolutionary multi-and many-objective optimization. Complex & Intelligent Systems 3(4):247\u2013263","journal-title":"Complex & Intelligent Systems"},{"key":"967_CR45","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.knosys.2019.03.002","volume":"174","author":"JM Sanchez-Gomez","year":"2019","unstructured":"Sanchez-Gomez JM, Vega-Rodr\u00edguez MA, Perez CJ (2019) Comparison of automatic methods for reducing the Pareto front to a single solution applied to multi-document text summarization. Knowl-Based Syst 174:123\u2013136","journal-title":"Knowl-Based Syst"},{"key":"967_CR46","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm. TIK-report 103"},{"key":"967_CR47","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.engappai.2014.10.020","volume":"38","author":"S Sudeng","year":"2015","unstructured":"Sudeng S, Wattanapongsakorn N (2015) Post Pareto-optimal pruning algorithm for multiple objective optimization using specific extended angle dominance. Eng Appl Artif Intell 38:221\u2013236","journal-title":"Eng Appl Artif Intell"},{"key":"967_CR48","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.compchemeng.2014.12.012","volume":"74","author":"E Antipova","year":"2015","unstructured":"Antipova E et al (2015) On the use of filters to facilitate the post-optimal analysis of the Pareto solutions in multi-objective optimization. Comput Chem Eng 74:48\u201358","journal-title":"Comput Chem Eng"},{"issue":"14","key":"967_CR49","first-page":"8298","volume":"11","author":"A Al Malki","year":"2016","unstructured":"Al Malki A et al (2016) Identifying the most significant solutions from Pareto front using hybrid genetic k-means approach. Int J Appl Eng Res 11(14):8298\u20138311","journal-title":"Int J Appl Eng Res"},{"key":"967_CR50","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.procs.2011.08.037","volume":"6","author":"O Aguirre","year":"2011","unstructured":"Aguirre O, Taboada H (2011) A clustering method based on dynamic self-organizing trees for post-pareto optimality analysis. Procedia Computer Science 6:195\u2013200","journal-title":"Procedia Computer Science"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-00967-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-00967-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-00967-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T13:35:16Z","timestamp":1690464916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-00967-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,2]]},"references-count":50,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["967"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-00967-y","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,2]]},"assertion":[{"value":"26 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The paper does not deal with any ethical problems.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"We declare that all authors have informed consent.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}