{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T17:31:14Z","timestamp":1761845474522},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T00:00:00Z","timestamp":1643932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T00:00:00Z","timestamp":1643932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00521-022-06944-9","type":"journal-article","created":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T19:02:50Z","timestamp":1644001370000},"page":"9175-9190","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A special 0-1 Knapsack problem for a small vegetable retailing system under fuzziness: a swarm optimization based approach"],"prefix":"10.1007","volume":"34","author":[{"given":"Samiran","family":"Acharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiranjit","family":"Changdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Utpal","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,4]]},"reference":[{"key":"6944_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cie.2019.04.025","volume":"132","author":"M Abdel-Basset","year":"2019","unstructured":"Abdel-Basset M, El-Shahat D, Faris H, Mirjalili S (2019) A binary multi-verse optimizer for 0\u20131 multi-dimensional knapsack problems with application in interactive multimedia systems. Comput Indus Eng 132:187\u2013206","journal-title":"Comput Indus Eng"},{"issue":"5","key":"6944_CR2","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1504\/EJIE.2020.109906","volume":"14","author":"Y Adouani","year":"2020","unstructured":"Adouani Y, Jarboui B, Masmoudi M (2020) Efficient matheuristic for the generalised multiple knapsack problem with setup. Euro J Indus Eng 14(5):715\u2013741","journal-title":"Euro J Indus Eng"},{"key":"6944_CR3","first-page":"11042","volume":"218","author":"JC Bansal","year":"2012","unstructured":"Bansal JC, Deep K (2012) A modified binary particle swarm optimization for knapsack problems. Appl Math Comput 218:11042\u201311061","journal-title":"Appl Math Comput"},{"key":"6944_CR4","first-page":"243","volume":"223","author":"C Changdar","year":"2013","unstructured":"Changdar C, Mahapatra GS, Pal RK (2013) An ant colony optimization approach for binary knapsack problem under fuzziness. Appl Math Comput 223:243\u2013253","journal-title":"Appl Math Comput"},{"key":"6944_CR5","first-page":"1321","volume":"20","author":"C Changdar","year":"2020","unstructured":"Changdar C, Pal RK, Mahapatra GS, Khan A (2020) A genetic algorithm based approach to solve multi-resource multi-objective knapsack problem for vegetable wholesalers in fuzzy environment. Op Res 20:1321\u20131352","journal-title":"Op Res"},{"issue":"3","key":"6944_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1080\/09720529.2004.10698008","volume":"7","author":"TC Chu","year":"2004","unstructured":"Chu TC, Huang KS, Chang TM (2004) COA defuzzification method for evaluating $$\\text{ C}_{\\mathbf{p}}$$ under fuzzy environments. J Discrete Math Sci Cryptogr 7(3):271\u2013280","journal-title":"J Discrete Math Sci Cryptogr"},{"key":"6944_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jpdc.2018.02.031","volume":"120","author":"BA Dantas","year":"2018","unstructured":"Dantas BA, C\u00e1ceres EN (2018) An experimental evaluation of a parallel simulated annealing approach for the 0\u20131 multidimensional knapsack problem. J Parallel Distrib Comput 120:211\u2013221","journal-title":"J Parallel Distrib Comput"},{"issue":"1","key":"6944_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolution Comput 1(1):53\u201366","journal-title":"IEEE Trans Evolution Comput"},{"key":"6944_CR9","volume-title":"Fundamentals of computational swarm intelligence","author":"AP Engelbrecht","year":"2006","unstructured":"Engelbrecht AP (2006) Fundamentals of computational swarm intelligence. Wiley, Hoboken"},{"key":"6944_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.resconrec.2012.08.001","volume":"68","author":"M Eriksson","year":"2012","unstructured":"Eriksson M, Strid I, Hansson PA (2012) Food losses in six Swedish retail stores: wastage of fruit and vegetables in relation to quantities delivered. Resour, Conserv Recycl 68:14\u201320","journal-title":"Resour, Conserv Recycl"},{"key":"6944_CR11","doi-asserted-by":"publisher","first-page":"1619","DOI":"10.1007\/s00521-015-2135-1","volume":"28","author":"Y Feng","year":"2017","unstructured":"Feng Y, Wang G, Deb S, Lu M, Zhao X (2017) Solving 0\u20131 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput Appl 28:1619\u20131634","journal-title":"Neural Comput Appl"},{"key":"6944_CR12","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.compeleceng.2017.12.014","volume":"67","author":"Y Feng","year":"2018","unstructured":"Feng Y, Wang G, Dong J, Wang L (2018) Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0\u20131 knapsack problem. Comput Electr Eng 67:454\u2013468","journal-title":"Comput Electr Eng"},{"issue":"7","key":"6944_CR13","first-page":"246","volume":"8","author":"A Garg","year":"2018","unstructured":"Garg A, Jaskiron K (2018) Organised retailing verses traditional retailing of vegetables. Int J Manage, IT Eng 8(7):246\u2013265","journal-title":"Int J Manage, IT Eng"},{"issue":"4","key":"6944_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1504\/IJBIC.2012.048063","volume":"4","author":"A Gherboudj","year":"2012","unstructured":"Gherboudj A, Layeb A, Chikhi S (2012) Solving 0\u20131 knapsack problems by a discrete binary version of cuckoo search algorithm. Int J Bio-Inspired Comput 4(4):229\u2013236","journal-title":"Int J Bio-Inspired Comput"},{"issue":"2","key":"6944_CR15","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1504\/IJOR.2015.071495","volume":"24","author":"R Hickman","year":"2015","unstructured":"Hickman R, Easton T (2015) Merging valid inequalities over the multiple knapsack polyhedron. Int J Op Res 24(2):214\u2013227","journal-title":"Int J Op Res"},{"issue":"2","key":"6944_CR16","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1504\/IJCSYSE.2015.077065","volume":"2","author":"Y Laalaoui","year":"2015","unstructured":"Laalaoui Y, Mhalla H (2015) Efficient heuristic for very large 0\/1 multiple knapsack problems. Int J Comput Syst Eng 2(2):112\u2013120","journal-title":"Int J Comput Syst Eng"},{"key":"6944_CR17","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ins.2018.01.026","volume":"436\u2013437","author":"X Lai","year":"2018","unstructured":"Lai X, Hao JK, Glover F, Lu Z (2018) A two-phase tabu-evolutionary algorithm for the 0\u20131 multidimensional knapsack problem. Inform Sci 436\u2013437:282\u2013301","journal-title":"Inform Sci"},{"issue":"3","key":"6944_CR18","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1504\/IJMOR.2012.046684","volume":"4","author":"ME Lalami","year":"2012","unstructured":"Lalami ME, Elkihel M, Baz DE, Boyer V (2012) A procedure-based heuristic for 0\u20131 multiple knapsack problems. Int J Math Op Res 4(3):214\u2013224","journal-title":"Int J Math Op Res"},{"issue":"1\u20132","key":"6944_CR19","first-page":"109","volume":"12","author":"J Li","year":"2019","unstructured":"Li J, Li W (2019) A new quantum evolutionary algorithm using dynamic rotation angle catastrophe for knapsack problem. Int J Intell Inform Database Syst 12(1\u20132):109\u2013120","journal-title":"Int J Intell Inform Database Syst"},{"key":"6944_CR20","doi-asserted-by":"crossref","unstructured":"Negi S, Anand N (2016) An overview of Fruits and Vegetables\u2019 Retail Supply Chain Models in India. Handbook of Research on Strategic Supply Chain Management in the Retail Industry (pp. 170-187)","DOI":"10.4018\/978-1-4666-9894-9.ch010"},{"issue":"6","key":"6944_CR21","first-page":"2597","volume":"8","author":"SS Ravi","year":"2020","unstructured":"Ravi SS, Ram Prasad MV (2020) Challenges and innovations in fruits and vegetable operations in Indian organized retail industry. Int J Recent Technol Eng 8(6):2597\u20132603","journal-title":"Int J Recent Technol Eng"},{"key":"6944_CR22","unstructured":"Seifert RW, Kirci M (2006) Digitalization: a fresh idea for the fruit and veg supply chain :Finding a digital solution to the food waste problem. Technical notes"},{"issue":"1","key":"6944_CR23","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ejor.2019.09.016","volume":"282","author":"T Setzer","year":"2019","unstructured":"Setzer T, Blanc SM (2019) Empirical orthogonal constraint generation for Multidimensional 0\/1 Knapsack Problems. Euro J Op Res 282(1):58\u201370","journal-title":"Euro J Op Res"},{"key":"6944_CR24","unstructured":"Vishnu K, Kumar P (2019) Structure and Strategy of Supermarkets of Fruits and Vegetables Retailing in Karnataka: Gains for Whom?The Institute for Social and Economic Change, Bangalore. Working paper 438"},{"issue":"5","key":"6944_CR25","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1080\/03081070902753556","volume":"38","author":"YM Wang","year":"2009","unstructured":"Wang YM, Luo Y (2009) Generalised fuzzy weighted mean and its applications. Int J General Syst 38(5):533\u2013546","journal-title":"Int J General Syst"},{"issue":"1","key":"6944_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1504\/IJBIC.2018.093334","volume":"12","author":"H Wu","year":"2018","unstructured":"Wu H, Zhou Y, Luo Q (2018) Hybrid symbiotic organisms search algorithm for solving 0\u20131 knapsack problem. Int J Bio-Inspired Comput 12(1):23\u201353","journal-title":"Int J Bio-Inspired Comput"},{"issue":"1","key":"6944_CR27","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0165-0114(78)90029-5","volume":"1","author":"LA Zadeh","year":"1978","unstructured":"Zadeh LA (1978) Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst 1(1):3\u201328","journal-title":"Fuzzy Sets Syst"},{"key":"6944_CR28","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2015.10.043","volume":"38","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Chen X, Zhou G (2016) An improved monkey algorithm for a 0\u20131 knapsack problem. Appl Soft Comput 38:817\u2013830","journal-title":"Appl Soft Comput"},{"key":"6944_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apm.2019.03.039","volume":"73","author":"S Zhou","year":"2019","unstructured":"Zhou S, Li X, Zhang K, Ni Du (2019) Two-dimensional knapsack-block packing problem. Appl Math Model 73:1\u201318","journal-title":"Appl Math Model"},{"issue":"5","key":"6944_CR30","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1504\/IJCSM.2018.095497","volume":"9","author":"G Zhou","year":"2018","unstructured":"Zhou G, Zhao R, Zhou YQ (2018) Solving large-scale 0\u20131 knapsack problem by the social-spider optimisation algorithm. Int J Comput Sci Math 9(5):433\u2013441","journal-title":"Int J Comput Sci Math"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-06944-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-06944-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-06944-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T05:45:41Z","timestamp":1652507141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-06944-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,4]]},"references-count":30,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["6944"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-06944-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,4]]},"assertion":[{"value":"21 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2022","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 have no potential conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interests"}}]}}