{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:45:16Z","timestamp":1777704316073,"version":"3.51.4"},"reference-count":47,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T00:00:00Z","timestamp":1532563200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2018,10]]},"abstract":"<jats:p>Aggregating individual interval multiplicative comparison matrices (IMCMs) and then ranking all the alternatives are very important in group decision making. However, the traditional methods may make the final result become overall average and does not always satisfy the Pareto optimal axiom. What\u2019s more, the ranking of the alternatives may rely on parameter or the possibility degree. In order to make the aggregated interval multiplicative comparison matrix (IMCM) and the ranking more reliable, this paper develops a novel method to aggregate interval multiplicative comparison matrices (IMCMs) and then applies logarithmic least squares method (LLSM) to rank alternatives. Firstly, DMs\u2019 interval multiplicative comparison matrices (IMCMs) are converted into two-dimensional coordinates. Next, the minimum Euclidean distance model is constructed and plant growth simulation algorithm (PGSA) is applied to find the aggregated points. Then the logarithmic least squares method (LLSM) is employed to derive the weight vectors and the ranking of alternatives can be obtained. Finally, numerical examples are provided to show the advantage and efficiency of the proposed method.<\/jats:p>","DOI":"10.3233\/jifs-18455","type":"journal-article","created":{"date-parts":[[2018,7,27]],"date-time":"2018-07-27T19:32:54Z","timestamp":1532719974000},"page":"3675-3684","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":8,"title":["A novel method for aggregating interval multiplicative comparison matrices and its application in ranking alternatives"],"prefix":"10.1177","volume":"35","author":[{"given":"Jing","family":"Li","sequence":"first","affiliation":[{"name":"School of Economics and Management, Southeast University, Nanjing, China"}]},{"given":"Yulin","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Southeast University, Nanjing, China"}]}],"member":"179","published-online":{"date-parts":[[2018,7,26]]},"reference":[{"key":"e_1_3_1_2_2","volume-title":"The analytic hierarchy process","author":"Saaty T.L.","year":"1980","unstructured":"T.L.Saaty, The analytic hierarchy process, McGraw-Hill, New York, 1980."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2496(83)90028-7"},{"issue":"5","key":"e_1_3_1_4_2","first-page":"1289","article-title":"Data envelopment analysis for weight derivation and aggregation in the analytic hierarchy process","volume":"33","author":"Ramanathan R.","year":"2006","unstructured":"R.Ramanathan, Data envelopment analysis for weight derivation and aggregation in the analytic hierarchy process, Computers & Industrial Engineering 33(5) (2006), 1289\u20131307.","journal-title":"Computers & Industrial Engineering"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/17.104292"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0224-L"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.04.038"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.11.011"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(87)90275-X"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2012.08.007"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/21.87068"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.175"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.09.041"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.01.019"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.09.010"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.09.010"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2014.11.003"},{"key":"e_1_3_1_18_2","first-page":"206","volume":"106","author":"Dong Y.C.","year":"2016","unstructured":"Y.C.Dong, H.J.Zhang and E.Herrera-Viedma, Consensus reaching model in (he complex and dynamic MAGDM problem, Knowledge-based Systems 106 (2016), 206\u2013219.","journal-title":"Consensus reaching model in (he complex and dynamic MAGDM problem, Knowledge-based Systems"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2017.09.012"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.01.031"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.12.014"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2012.05.010"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.10.010"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.03.019"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.03.003"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-1156-x"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1080\/00207721.2015.1074761"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.01.047"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.04.068"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2016.08.021"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1057\/s41274-016-0171-6"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2016.2646749"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.07.024"},{"issue":"1","key":"e_1_3_1_34_2","first-page":"76","article-title":"A global optimization bionics algorithm for solving integer programming-plant growth simulation algorithm","volume":"25","author":"Li T.","year":"2005","unstructured":"T.Li, C.F.Wang, W.B.Wang and W.L.Su, A global optimization bionics algorithm for solving integer programming-plant growth simulation algorithm, System Engineering-Theory Practice 25(1) (2005), 76\u201385.","journal-title":"System Engineering-Theory Practice"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1108\/K-07-2013-0138"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.09.029"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.07.008"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0224-L"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2009.01.010"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2496(85)90002-1"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.2528\/PIERB09061709"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2010.11.021"},{"issue":"1","key":"e_1_3_1_43_2","first-page":"97","article-title":"Energy management of large distribution network with plant growth simulation algorithm and heuristic fuzzy","volume":"1","author":"Thiruvenkadam S.","year":"2009","unstructured":"S.Thiruvenkadam, A.Nirmalkumar and A.Sakthivel, Energy management of large distribution network with plant growth simulation algorithm and heuristic fuzzy, International Journal on Electronic & Electrical Engineering 1(1) (2009), 97\u2013108.","journal-title":"International Journal on Electronic & Electrical Engineering"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2016.09.010"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/0270-0255(87)90489-1"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-016-9534-2"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-018-9617-3"},{"key":"e_1_3_1_48_2","first-page":"1","article-title":"A survey of parameter reduction of soft sets and corresponding algorithms","volume":"4","author":"Zhan J.M.","year":"2017","unstructured":"J.M.Zhan and Alcantud, J.C.R., A survey of parameter reduction of soft sets and corresponding algorithms, Artificial Intelligence Review 4 (2017), 1\u201334. DOI 10.1007\/s10462-017-9592-0","journal-title":"Artificial Intelligence Review"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-18455","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-18455","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-18455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:40:55Z","timestamp":1777455655000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-18455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,26]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["10.3233\/JIFS-18455"],"URL":"https:\/\/doi.org\/10.3233\/jifs-18455","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,26]]}}}