{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:44:23Z","timestamp":1742964263466,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819771806"},{"type":"electronic","value":"9789819771813"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7181-3_1","type":"book-chapter","created":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T08:37:21Z","timestamp":1724315841000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Set-Based Particle Swarm Optimization for\u00a0the\u00a0Multi-objective Multi-dimensional Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Mari","family":"Spangenberg","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0242-3539","authenticated-orcid":false,"given":"Andries","family":"Engelbrecht","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"issue":"11","key":"1_CR1","doi-asserted-by":"publisher","first-page":"3458","DOI":"10.1016\/j.cor.2006.02.008","volume":"34","author":"M Alves","year":"2007","unstructured":"Alves, M., Almeida, M.: MOTGA: a multi-objective Tchebycheff based genetic algorithm for the multidimensional knapsack problem. Comput. Oper. Res. 34(11), 3458\u20133470 (2007)","journal-title":"Comput. Oper. Res."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems - an overview of recent advances. Part I: Single knapsack problems. Comput. Oper. Res. 143, 105692 (2022)","DOI":"10.1016\/j.cor.2021.105692"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Cacchiani, V., Iori, M., Locatelli, A., Martello, S.: Knapsack problems - an overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems. Comput. Oper. Res. 143, 105693 (2022)","DOI":"10.1016\/j.cor.2021.105693"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"CZyzak, P., Jaszkiewicz, A.: Pareto simulated annealing\u2014a metaheuristic technique for multiple objective combinatorial optimization. J. Multi-Criteria Decis. Anal. 7, 34\u201347 (1998)","DOI":"10.1002\/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Erwin, K., Engelbrecht, A.: Set-based particle swarm optimization for portfolio optimization. In: Dorigo, M., et al. (ed.) Proceedings of the 12th International Swarm Intelligence Conference (ANTS). LNCS, vol. 12421, pp. 333\u2013339. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60376-2_28","DOI":"10.1007\/978-3-030-60376-2_28"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"62","DOI":"10.3390\/a16020062","volume":"16","author":"K Erwin","year":"2023","unstructured":"Erwin, K., Engelbrecht, A.: Multi-guide set-based particle swarm optimization for multi-objective portfolio optimization. Algorithms 16(2), 62 (2023)","journal-title":"Algorithms"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz, A.: Genetic local search for multi-objective combinatorial optimization. Eur. J. Oper. Res. 137(1), 50\u201371 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/B:ANOR.0000039516.50069.5b","volume":"131","author":"A Jaszkiewicz","year":"2004","unstructured":"Jaszkiewicz, A.: A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the pareto memetic algorithm. Ann. Oper. Res. 131, 135\u2013158 (2004)","journal-title":"Ann. Oper. Res."},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Multidimensional Knapsack Problems, pp. 235\u2013283. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_9","DOI":"10.1007\/978-3-540-24777-7_9"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN 1995-International Conference on Neural Networks, vol.\u00a04, pp. 1942\u20131948. IEEE (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: A discrete binary version of the particle swarm algorithm. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, vol.\u00a05, pp. 4104\u20134108. IEEE (1997)","DOI":"10.1109\/ICSMC.1997.637339"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11721-012-0073-4","volume":"6","author":"J Langeveld","year":"2012","unstructured":"Langeveld, J., Engelbrecht, A.: Set-based particle swarm optimization applied to the multidimensional knapsack problem. Swarm Intell. 6(4), 297\u2013342 (2012)","journal-title":"Swarm Intell."},{"key":"1_CR13","first-page":"3","volume":"42","author":"T Lust","year":"2008","unstructured":"Lust, T., Teghem, J.: MEMOTS: a memetic algorithm integrating Tabu search for combinatorial multiobjective optimization. Oper. Res. 42, 3\u201333 (2008)","journal-title":"Oper. Res."},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1111\/j.1475-3995.2011.00840.x","volume":"19","author":"T Lust","year":"2012","unstructured":"Lust, T., Teghem, J.: The multiobjective multidimensional knapsack problem: a survey and a new approach. Int. Trans. Oper. Res. 19(4), 495\u2013520 (2012)","journal-title":"Int. Trans. Oper. Res."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Pampara, G., Franken, N., Engelbrecht, A.: Combining particle swarm optimisation with angle modulation to solve binary problems. In: 2005 IEEE Congress on Evolutionary Computation, vol.\u00a01, pp. 89\u201396. IEEE (2005)","DOI":"10.1109\/CEC.2005.1554671"},{"issue":"3\u20134","key":"1_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s11721-019-00171-0","volume":"13","author":"C Scheepers","year":"2019","unstructured":"Scheepers, C., Engelbrecht, A.: Multi-guide particle swarm optimization for multi-objective optimization. Swarm Intell. 13(3\u20134), 245\u2013276 (2019)","journal-title":"Swarm Intell."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Song, Z., Luo, W., Liu, X., She, Z., Zhang, Q.: On multiobjective knapsack problems with multiple decision makers. In: Proceedings of the IEEE Symposium Series on Computational Intelligence, pp. 156\u2013163 (2022)","DOI":"10.1109\/SSCI51031.2022.10022188"},{"key":"1_CR18","unstructured":"Spangenberg, M.: Set-based particle swarm optimization for the multi-objective multi-dimensional knapsack problem. Master\u2019s thesis, Stellenbosch University (2022)"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1057\/palgrave.jors.2600569","volume":"49","author":"E Ulungu","year":"1998","unstructured":"Ulungu, E., Teghem, J., Ost, C.: Efficiency of interactive multi-objective simulated annealing through a case study. J. Oper. Res. Soc. 49, 1044\u20131050 (1998)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"1_CR20","first-page":"186","volume":"3","author":"D Vianna","year":"2014","unstructured":"Vianna, D., Montane, F., Meza, E., Martins, C.: A memory-based GRASP heuristic for the multiobjective multidimensional knapsack problem. Int. J. Latest Res. Sci. Technol. 3(4), 186\u2013194 (2014)","journal-title":"Int. J. Latest Res. Sci. Technol."},{"key":"1_CR21","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm. In: Proceedings of the Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems (2001)"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Ziztler","year":"1999","unstructured":"Ziztler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3, 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"van Zyl, J., Engelbrecht, A.: Set-based particle swarm optimisation: a review. Swarm Evol. Comput. 78 (2023)","DOI":"10.1109\/CEC55065.2022.9870360"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7181-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T08:39:32Z","timestamp":1724315972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7181-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819771806","9789819771813"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7181-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"21 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xining","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iasei.org\/icsi2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}