{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:09:01Z","timestamp":1777705741744,"version":"3.51.4"},"reference-count":33,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"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: Applications in Engineering and Technology"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:p>One of the challenges for software developers in incremental development methodologies is the issue of the next release problem. In this article, for the first time, this problem will be solved with three goals namely cost, satisfaction, and dissatisfaction. It also has several types of constraints. These three conflicting goals and different constraints make it extremely difficult to choose the optimal subset for product manufacturers. Wrong choices will lead to increased customer dissatisfaction and reduced product sales. To help make smart and error-free choices, we introduce two algorithms. These algorithms determine the merit of the requirements using the fuzzy inference system and then make the choices based on the type of threshold value constraint. We also introduce and implement the constraint of the impact of dissatisfaction on requirements. To conduct the experiments, the proposed algorithm has been compared with the algorithms FMACRO, IBPSO and Kmeans. In all experiments, the solutions resulted from the proposed algorithms had higher quality than the other three algorithms. These results show that choosing the proposed algorithms can provide more satisfaction to customers, reducing their dissatisfaction and lowering product prices. The most important advantages of the proposed algorithms are its scalability and linear order time complexity.<\/jats:p>","DOI":"10.1177\/18758967251344779","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T03:09:32Z","timestamp":1749784172000},"page":"1489-1512","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Selection of Software Requirements Using Fuzzy Inference System with Customer Dissatisfaction Constraint"],"prefix":"10.1177","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1785-2221","authenticated-orcid":false,"given":"Hamidreza","family":"Alrezaamiri","sequence":"first","affiliation":[{"name":"Technical Department, Rahbord Negar Amitis, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6003-6601","authenticated-orcid":false,"given":"Ali","family":"Ebrahimnejad","sequence":"additional","affiliation":[{"name":"Department of Mathematics, QaS.C., Islamic Azad University, Qaemshahr, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.111152"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/10798587.2014.960229"},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.3233\/IDT-170284"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3553-7"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2019.1704440"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00766-020-00328-y"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108155"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(01)00194-X"},{"issue":"2","key":"e_1_3_4_10_1","first-page":"101","article-title":"Solving the next release problem using a hybrid metaheuristic","volume":"14","author":"Balogun A. O.","year":"2016","unstructured":"Balogun A. O., Mabayoje M. A., Makinwa M. O., Bajeh A. O. (2016). Solving the next release problem using a hybrid metaheuristic. Annals. Computer Science, 14(2), 101\u2013116.","journal-title":"Annals. Computer Science"},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.11.093"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.03.012"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.04.002"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00766-020-00341-1"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-013-9287-3"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2021.08.058"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2019.06.097"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1049\/sfw2.12070"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.measurement.2016.06.050"},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104620"},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2003.07.002"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.18178\/ijmlc.2019.9.5.840"},{"key":"e_1_3_4_23_1","volume-title":"A hybrid ACO algorithm for the next release problemThe 2nd International Conference on Software Engineering and Data Mining","author":"Jiang H.","year":"2010","unstructured":"Jiang H., Zhang J., Xuan J., Ren Z., Hu Y. (2010). A hybrid ACO algorithm for the next release problem. The 2nd International Conference on Software Engineering and Data Mining (pp. 166-171). IEEE."},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114342"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.5539\/mas.v12n2p54"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113748"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2018.2810895"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1002\/smr.2305"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-201759"},{"key":"e_1_3_4_30_1","volume-title":"Software Engineering: a practitioner\u2019s approach","author":"Pressman R. S.","year":"2005","unstructured":"Pressman R. S. (2005). Software Engineering: a practitioner\u2019s approach. Pressman and Associates."},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2018.12.015"},{"issue":"3","key":"e_1_3_4_32_1","first-page":"1017","article-title":"Value based intelligent requirement prioritization (VIRP): Expert driven fuzzy logic based prioritization technique","volume":"7","author":"Ramzan M.","year":"2011","unstructured":"Ramzan M., Jaffar M. A., Shahid A. A. (2011). Value based intelligent requirement prioritization (VIRP): Expert driven fuzzy logic based prioritization technique. International Journal of Innovative Computing, Information and Control, 7(3), 1017\u20131038.","journal-title":"International Journal of Innovative Computing, Information and Control"},{"key":"e_1_3_4_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107564"},{"key":"e_1_3_4_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196831"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18758967251344779","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/18758967251344779","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18758967251344779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:45:01Z","timestamp":1777455901000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/18758967251344779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["10.1177\/18758967251344779"],"URL":"https:\/\/doi.org\/10.1177\/18758967251344779","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,13]]}}}