{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T12:42:48Z","timestamp":1768653768427,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s40314-025-03279-8","type":"journal-article","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T03:55:15Z","timestamp":1750305315000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An evolutionary algorithm for solving a unique discounted 0-1 knapsack problem in a random type-2 fuzzy environment"],"prefix":"10.1007","volume":"44","author":[{"given":"Subir","family":"Saha","sequence":"first","affiliation":[]},{"given":"Chiranjit","family":"Changdar","sequence":"additional","affiliation":[]},{"given":"Pravash Kumar","family":"Giri","sequence":"additional","affiliation":[]},{"given":"Rajat Kumar","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Utpal","family":"Nandi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,19]]},"reference":[{"key":"3279_CR1","doi-asserted-by":"crossref","unstructured":"Abdel-Basset M et al (2023) A novel binary kepler optimization algorithm for 0\u20131 knapsack problems: Methods and applications. Alex Eng J 82:358\u2013376","DOI":"10.1016\/j.aej.2023.09.072"},{"key":"3279_CR2","doi-asserted-by":"publisher","first-page":"11042","DOI":"10.1016\/j.amc.2012.05.001","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A Modified Binary Particle Swarm Optimization for Knapsack Problems. Applied Mathematics and Computation 218:11042\u201311061","journal-title":"Applied Mathematics and Computation"},{"key":"3279_CR3","doi-asserted-by":"publisher","first-page":"12415","DOI":"10.1016\/j.eswa.2011.04.022","volume":"38","author":"E Bas","year":"2011","unstructured":"Bas E (2011) A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0\u20131 bidimensional knapsack model. Expert Systems with Applications 38:12415\u201312422","journal-title":"Expert Systems with Applications"},{"key":"3279_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.fss.2021.03.009","volume":"446","author":"G Beliakov","year":"2022","unstructured":"Beliakov G, Divakov D (2022) Aggregation with dependencies: Capacities and fuzzy integrals. Fuzzy Sets and Systems 446:222\u2013232","journal-title":"Fuzzy Sets and Systems"},{"key":"3279_CR5","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.ins.2020.03.050","volume":"527","author":"S Bera","year":"2020","unstructured":"Bera S, Giri PK, Jana DK, Basu K, Maiti M (2020) Fixed charge 4D-TP for a breakable item under hybrid random type-2 uncertain environments. Information Sciences 527:128\u2013158","journal-title":"Information Sciences"},{"key":"3279_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105692","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani V, Iori M, Locatelli A, Martello S (2022) Knapsack problems - an overview of recent advances part. i: Single knapsack problems. Computers & Operations Research 143:105692. https:\/\/doi.org\/10.1016\/j.cor.2021.105692","journal-title":"Computers & Operations Research"},{"key":"3279_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105693","volume":"143","author":"V Cacchiani","year":"2022","unstructured":"Cacchiani V, Iori M, Locatelli A, Martello S (2022) Knapsack problems - an overview of recent advances part. ii: Multiple, multidimensional, and quadratic knapsack problems. Computers & Operations Research 143:105693. https:\/\/doi.org\/10.1016\/j.cor.2021.105693","journal-title":"Computers & Operations Research"},{"key":"3279_CR8","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1016\/j.jhydrol.2017.12.067","volume":"557","author":"Y Cai","year":"2018","unstructured":"Cai Y, Rong Q, Yang Z, Yue W, Tan Q (2018) An export coefficient based inexact fuzzy bi-level multi-objective programming model for the management of agricultural nonpoint source pollution under uncertainty. Journal of Hydrology 557:713\u2013725","journal-title":"Journal of Hydrology"},{"key":"3279_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.amc.2013.07.077","volume":"223","author":"C Changdar","year":"2013","unstructured":"Changdar C, Mahapatra G, Pal R (2013) An Ant colony optimization approach for binary knapsack problem under fuzziness. Applied Mathematics and Computation 223:243\u2013253","journal-title":"Applied Mathematics and Computation"},{"key":"3279_CR10","doi-asserted-by":"publisher","first-page":"2276","DOI":"10.1016\/j.eswa.2014.09.006","volume":"42","author":"C Changdar","year":"2015","unstructured":"Changdar C, Mahapatra G, Pal RK (2015) An improved genetic algorithm based approach to solve constrained knapsack problem in fuzzy environment. Expert Systems with Applications 42:2276\u20132286","journal-title":"Expert Systems with Applications"},{"key":"3279_CR11","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0266537","volume":"17","author":"BT Dang","year":"2022","unstructured":"Dang BT, Truong TK (2022) Binary salp swarm algorithm for discounted 0\u20131 knapsack problem. PLoS One 17:e0266537","journal-title":"PLoS One"},{"key":"3279_CR12","volume-title":"in Operation-based greedy algorithm for discounted knapsack problem Lecture notes in computer science, 646\u2013660","author":"BT Dang","year":"2022","unstructured":"Dang BT, Nguyen BH, Andreae P (2022) in Operation-based greedy algorithm for discounted knapsack problem Lecture notes in computer science, 646\u2013660. Springer International Publishing, Cham"},{"key":"3279_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cor.2016.11.015","volume":"80","author":"F Della Croce","year":"2017","unstructured":"Della Croce F, Salassa F, Scatamacchia R (2017) An exact approach for the 0\u20131 knapsack problem with setups. Computers & Operations Research 80:61\u201367","journal-title":"Computers & Operations Research"},{"key":"3279_CR14","doi-asserted-by":"crossref","unstructured":"Dong J, Wang Z, Mo J (2021) A phase angle-modulated bat algorithm with application to antenna topology optimization. Appl Sci (Basel) 11:2243","DOI":"10.3390\/app11052243"},{"key":"3279_CR15","doi-asserted-by":"publisher","first-page":"10708","DOI":"10.1109\/ACCESS.2018.2809445","volume":"6","author":"Y-H Feng","year":"2018","unstructured":"Feng Y-H, Wang G-G (2018) Binary Moth Search Algorithm for Discounted 0\u20131 Knapsack Problem. IEEE Access 6:10708\u201310719","journal-title":"IEEE Access"},{"key":"3279_CR16","doi-asserted-by":"crossref","unstructured":"Feng Y, Wang G-G, Li W, Li N (2018) Multi-strategy monarch butterfly optimization algorithm for discounted 0\u20131 knapsack problem. Neural Comput. Appl 30:3019\u20133036","DOI":"10.1007\/s00521-017-2903-1"},{"key":"3279_CR17","doi-asserted-by":"publisher","unstructured":"Fujimoto M, Yamada T (2006) An exact algorithm for the knapsack sharing problem with common items. Eur J Oper Res 171(2):693\u2013707. https:\/\/doi.org\/10.1016\/j.ejor.2004.09.036","DOI":"10.1016\/j.ejor.2004.09.036"},{"key":"3279_CR18","volume-title":"Genetic algorithms in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Pub. Co, Reading, Mass"},{"key":"3279_CR19","doi-asserted-by":"publisher","unstructured":"Gorski J, Paquete L, Pedrosa F (2012) Greedy algorithms for a class of knapsack problems with binary weights. Comput Oper Res 39(3):498\u2013511. https:\/\/doi.org\/10.1016\/j.cor.2011.02.010","DOI":"10.1016\/j.cor.2011.02.010"},{"key":"3279_CR20","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.amc.2007.05.068","volume":"196","author":"C Hamza\u00e7ebi","year":"2008","unstructured":"Hamza\u00e7ebi C (2008) Improving genetic algorithms\u2019 performance by local search for continuous function optimization. Applied Mathematics and Computation 196:309\u2013317. https:\/\/doi.org\/10.1016\/j.amc.2007.05.068","journal-title":"Applied Mathematics and Computation"},{"key":"3279_CR21","doi-asserted-by":"crossref","unstructured":"Harifi S (2022) A binary ancient-inspired giza pyramids construction metaheuristic algorithm for solving 0\u20131 knapsack problem. Soft Comput 26:12761\u201312778","DOI":"10.1007\/s00500-022-07285-4"},{"key":"3279_CR22","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.ins.2016.07.037","volume":"369","author":"Y-C He","year":"2016","unstructured":"He Y-C, Wang X-Z, He Y-L, Zhao S-L, Li W-B (2016) Exact and approximate algorithms for discounted 0\u20131 knapsack problem. Information Sciences 369:634\u2013647","journal-title":"Information Sciences"},{"key":"3279_CR23","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.ins.2013.08.005","volume":"255","author":"P Kundu","year":"2014","unstructured":"Kundu P, Kar S, Maiti M (2014) Fixed charge transportation problem with type-2 fuzzy variables. Information Sciences 255:170\u2013186. https:\/\/doi.org\/10.1016\/j.ins.2013.08.005","journal-title":"Information Sciences"},{"key":"3279_CR24","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.asoc.2015.11.045","volume":"41","author":"J Lv","year":"2016","unstructured":"Lv J, Wang X, Huang M, Cheng H, Li F (2016) Solving 0\u20131 knapsack problem by greedy degree and expectation efficiency. Applied Soft Computing 41:94\u2013103","journal-title":"Applied Soft Computing"},{"key":"3279_CR25","volume-title":"Genetic algorithms+ data structures= evolution programs","author":"Z Michalewicz","year":"2013","unstructured":"Michalewicz Z (2013) Genetic algorithms+ data structures= evolution programs. Springer Science & Business Media, Berlin"},{"issue":"8","key":"3279_CR26","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s40314-024-02938-6","volume":"43","author":"FA Morales","year":"2024","unstructured":"Morales FA, Mart\u00ednez JA (2024) Expectation analysis for bounding solutions of the 0\u20131 knapsack problem. Computational and Applied Mathematics 43(8):442. https:\/\/doi.org\/10.1007\/s40314-024-02938-6","journal-title":"Computational and Applied Mathematics"},{"key":"3279_CR27","doi-asserted-by":"publisher","first-page":"108","DOI":"10.38016\/jista.1200225","volume":"6","author":"G Orucova B\u00fcy\u00fck\u00f6z","year":"2023","unstructured":"Orucova B\u00fcy\u00fck\u00f6z G, Hakli H (2023) Binary honey badger algorithm for 0\u20131 knapsack problem. Jista 6:108\u2013118","journal-title":"Jista"},{"issue":"4","key":"3279_CR28","doi-asserted-by":"publisher","first-page":"411","DOI":"10.5267\/j.dsl.2019.5.004","volume":"8","author":"PBR Peddi","year":"2019","unstructured":"Peddi PBR (2019) Defuzzification method for ranking fuzzy numbers based on centroids and maximizing and minimizing set. Decision Science Letters 8(4):411\u2013428. https:\/\/doi.org\/10.5267\/j.dsl.2019.5.004","journal-title":"Decision Science Letters"},{"key":"3279_CR29","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s40314-024-02629-2","volume":"43","author":"X Peng","year":"2024","unstructured":"Peng X, Pan X (2024) Interval type-2 fuzzy systems on the basis of vague partitions and their approximation properties. Computational and Applied Mathematics 43:119. https:\/\/doi.org\/10.1007\/s40314-024-02629-2","journal-title":"Computational and Applied Mathematics"},{"key":"3279_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s40747-017-0050-z","volume":"4","author":"RM Rizk-Allah","year":"2017","unstructured":"Rizk-Allah RM, Hassanien AE (2017) New binary bat algorithm for solving 0\u20131 knapsack problem. Complex & Intelligent Systems 4:31\u201353. https:\/\/doi.org\/10.1007\/s40747-017-0050-z","journal-title":"Complex & Intelligent Systems"},{"key":"3279_CR31","doi-asserted-by":"publisher","first-page":"6921","DOI":"10.1016\/j.amc.2011.12.068","volume":"218","author":"A Rong","year":"2012","unstructured":"Rong A, Figueira JR, Klamroth K (2012) Dynamic programming based algorithms for the discounted 0\u20131 knapsack problem. Applied Mathematics and Computation 218:6921\u20136933","journal-title":"Applied Mathematics and Computation"},{"key":"3279_CR32","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.ejor.2015.10.014","volume":"250","author":"RP Rooderkerk","year":"2016","unstructured":"Rooderkerk RP, van Heerde HJ (2016) Robust optimization of the 0\u20131 knapsack problem: Balancing risk and return in assortment optimization. European Journal of Operational Research 250:842\u2013854","journal-title":"European Journal of Operational Research"},{"key":"3279_CR33","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.3390\/sym14061208","volume":"14","author":"A Sulaiman","year":"2022","unstructured":"Sulaiman A, Sadiq M, Mehmood Y, Akram M, Ali GA (2022) Fitness-based acceleration coefficients binary particle swarm optimization (FACBPSO) to solve the discounted knapsack problem. Symmetry (Basel) 14:1208","journal-title":"Symmetry (Basel)"},{"key":"3279_CR34","doi-asserted-by":"crossref","unstructured":"Truong TK (2021) A new moth-flame optimization algorithm for discounted 0\u20131 knapsack problem. Math. Probl Eng 2021:1\u201315","DOI":"10.1155\/2021\/5092480"},{"key":"3279_CR35","doi-asserted-by":"publisher","first-page":"5661","DOI":"10.1080\/00207543.2020.1789235","volume":"59","author":"S Wang","year":"2021","unstructured":"Wang S, Cui W, Chu F, Yu J (2021) The interval min-max regret knapsack packing-delivery problem. International Journal of Production Research 59:5661\u20135677","journal-title":"International Journal of Production Research"},{"key":"3279_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-023-09075-x","volume-title":"An adaptive grey wolf optimization with differential evolution operator for solving the discount 0\u20131 knapsack problem","author":"Z Wang","year":"2023","unstructured":"Wang Z, Fang X, Gao F, Xie L, Meng X (2023) An adaptive grey wolf optimization with differential evolution operator for solving the discount 0\u20131 knapsack problem. Neural Comput, Appl"},{"key":"3279_CR37","doi-asserted-by":"crossref","unstructured":"Wang R, Zhang Z, Ng WWY, Wu W (2021) An improved group theory-based optimization algorithm for discounted 0\u20131 knapsack problem. Adv Comput Intell 1:11","DOI":"10.1007\/s43674-021-00010-y"},{"key":"3279_CR38","doi-asserted-by":"crossref","unstructured":"Wilbaut C, Todosijevi\u0107 R, Hanafi S, Fr\u00e9ville A (2022) Variable neighborhood search for the discounted 0\u20131 knapsack problem. Appl. Soft Comput 131:109821","DOI":"10.1016\/j.asoc.2022.109821"},{"key":"3279_CR39","doi-asserted-by":"crossref","unstructured":"Wilbaut C, Todosijevic R, Hanafi S, Fr\u00e9ville A (2023) Heuristic and exact reduction procedures to solve the discounted 0\u20131 knapsack problem. Eur J Oper Res 304:901\u2013911","DOI":"10.1016\/j.ejor.2022.04.036"},{"key":"3279_CR40","doi-asserted-by":"crossref","unstructured":"Wu C, Zhao J, Feng Y, Lee M (2020) solving discounted 0\u20131 knapsack problems by a discrete hybrid teaching-learning-based optimization algorithm. Appl Intell 50:1872\u20131888","DOI":"10.1007\/s10489-020-01652-0"},{"key":"3279_CR41","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1016\/j.engappai.2008.01.003","volume":"21","author":"L-N Xing","year":"2008","unstructured":"Xing L-N et al (2008) A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem. Engineering Applications of Artificial Intelligence 21:1370\u20131380","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"3279_CR42","doi-asserted-by":"publisher","first-page":"2797","DOI":"10.1007\/s00521-023-09200-w","volume":"36","author":"G Yildizdan","year":"2023","unstructured":"Yildizdan G, Bas E (2023) A new binary coati optimization algorithm for binary optimization problems. Neural Computing and Applications 36:2797\u20132834. https:\/\/doi.org\/10.1007\/s00521-023-09200-w","journal-title":"Neural Computing and Applications"},{"key":"3279_CR43","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1504\/IJBIC.2017.087924","volume":"10","author":"H Zhu","year":"2017","unstructured":"Zhu H, He Y, Wang X, Tsang EC (2017) Discrete differential evolutions for the discounted 0\u20131 knapsack problem. International Journal of Bio-Inspired Computation 10:219","journal-title":"International Journal of Bio-Inspired Computation"},{"key":"3279_CR44","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1016\/j.asoc.2010.07.019","volume":"11","author":"D Zou","year":"2011","unstructured":"Zou D, Gao L, Li S, Wu J (2011) Solving 0\u20131 knapsack problem by a novel global harmony search algorithm. Applied Soft Computing 11:1556\u20131564","journal-title":"Applied Soft Computing"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03279-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03279-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03279-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T20:44:38Z","timestamp":1757191478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03279-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,19]]},"references-count":44,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["3279"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03279-8","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,19]]},"assertion":[{"value":"14 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"There are no competing or conflicting interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The research provided in this work adheres to ethical and professional standards.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Custom code is available.","order":7,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"327"}}