{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:19:12Z","timestamp":1743146352798,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031562075"},{"type":"electronic","value":"9783031562082"}],"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-3-031-56208-2_24","type":"book-chapter","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T17:01:50Z","timestamp":1716483710000},"page":"246-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ant Algorithm with\u00a0Local Search Procedure for\u00a0Multiple Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Stefka","family":"Fidanova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krassimir","family":"Atanassov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,24]]},"reference":[{"key":"24_CR1","unstructured":"Arsik, I., et al.: Effective and equitable appointment scheduling in rehabilitation centers. In: INFORMS Annual Meeting 2017 (2017)"},{"key":"24_CR2","unstructured":"Birattari, M., Stutzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11\u201318 (2002)"},{"key":"24_CR3","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm Intelligence: From Natural to Artificial Systems","author":"E Bonabeau","year":"1999","unstructured":"Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)"},{"key":"24_CR4","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Gambardella, L.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1, 53\u201366 (1996)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-319-73441-5_37","volume-title":"Large-Scale Scientific Computing","author":"G Evtimov","year":"2018","unstructured":"Evtimov, G., Fidanova, S.: Heuristic algorithm for 2D cutting stock\u00a0problem. In: Lirkov, I., Margenov, S. (eds.) LSSC 2017. LNCS, vol. 10665, pp. 350\u2013357. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73441-5_37"},{"key":"24_CR7","unstructured":"Fidanova, S., Lirkov, I.: 3D protein structure prediction. In: Analele Universitatii de Vest Timisoara, vol. XLVII, pp. 33\u201346 (2009)"},{"key":"24_CR8","first-page":"147","volume":"14","author":"S Fidanova","year":"2010","unstructured":"Fidanova, S.: An improvement of the grid-based hydrophobic-hydrophilic model. Int. J. Bioautomation 14, 147\u2013156 (2010)","journal-title":"Int. J. Bioautomation"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-45724-0_31","volume-title":"Ant Algorithms","author":"S Fidanova","year":"2002","unstructured":"Fidanova, S.: ACO algorithm with additional reinforcement. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, pp. 292\u2013293. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45724-0_31"},{"key":"24_CR10","unstructured":"Fidanova, S., Atanassov, K., Marinov, P.: Generalized Nets and Ant Colony Optimization. Bulg. Academy of Sciences Pub. House (2011)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-18466-6_29","volume-title":"Numerical Methods and Applications","author":"S Fidanova","year":"2011","unstructured":"Fidanova, S., Atanassov, K., Marinov, P.: Start strategies of ACO applied on subset problems. In: Dimov, I., Dimova, S., Kolkovska, N. (eds.) NMA 2010. LNCS, vol. 6046, pp. 248\u2013255. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18466-6_29"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-29843-1_25","volume-title":"Large-Scale Scientific Computing","author":"S Fidanova","year":"2012","unstructured":"Fidanova, S., Atanassov, K., Marinov, P.: Intuitionistic fuzzy estimation of the ant colony optimization starting points. In: Lirkov, I., Margenov, S., Wa\u015bniewski, J. (eds.) LSSC 2011. LNCS, vol. 7116, pp. 222\u2013229. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29843-1_25"},{"key":"24_CR13","doi-asserted-by":"publisher","unstructured":"Fidanova S. Hybrid ant colony optimization algorithm for multiple knapsack problem. In: 5th IEEE International Conference on Recent Advances and Innovations in Engineering (ICRAIE). IEEE (2021). https:\/\/doi.org\/10.1109\/ICRAIE51050.2020.9358351,1-5","DOI":"10.1109\/ICRAIE51050.2020.9358351,"},{"issue":"3","key":"24_CR14","first-page":"493","volume":"5","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: motivation analysis and first results. Complex Syst. 5(3), 493\u2013530 (1989)","journal-title":"Complex Syst."},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-72950-1_77","volume-title":"Foundations of Fuzzy Logic and Soft Computing","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: Melin, P., Castillo, O., Aguilar, L.T., Kacprzyk, J., Pedrycz, W. (eds.) IFSA 2007. LNCS (LNAI), vol. 4529, pp. 789\u2013798. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72950-1_77"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-24777-7_10","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Multiple knapsack problems. In: Kellerer, H., Pferschy, U., Pisinger, D. (eds.) Knapsack Problems, pp. 285\u2013316. Springer, Berlin (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_10"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. IV, pp. 1942\u20131948 (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"220","key":"24_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"13","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science (New York, N.Y.) 13(220), 671\u2013680 (1983)","journal-title":"Science (New York, N.Y.)"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1111\/j.1540-5915.1974.tb00593.x","volume":"5","author":"G Kochenberger","year":"1974","unstructured":"Kochenberger, G., McCarl, G., Wymann, F.: An heuristic for general integer programming. Decis. Sci. 5, 34\u201344 (1974)","journal-title":"Decis. Sci."},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Krause, J., Cordeiro, J., Parpinelli, R.S., Lopes, H.S.: A survey of swarm algorithms applied to discrete optimization problems. In: Swarm Intelligence and Bio-Inspired Computation, pp. 169\u2013191. Elsevier (2013)","DOI":"10.1016\/B978-0-12-405163-8.00007-7"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Graves, S.C., et al. (eds.) Handbooks in OR and MS, vol. 4, pp. 445\u2013522. Elsevier Science Publishers (1993)","DOI":"10.1016\/S0927-0507(05)80189-6"},{"issue":"3","key":"24_CR22","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1587\/transinf.E97.D.455","volume":"97","author":"Q Liu","year":"2014","unstructured":"Liu, Q., Odaka, T., Kuroiwa, J., Shirai, H., Ogura, H.: A new artificial fish swarm algorithm for the multiple knapsack problem. IEICE Trans. Inf. Syst. 97(3), 455\u2013468 (2014)","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"1","key":"24_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"FD Murgolo","year":"1987","unstructured":"Murgolo, F.D.: An efficient approximation scheme for variable-sized bin packing. SIAM J. Comput. 16(1), 149\u2013161 (1987)","journal-title":"SIAM J. Comput."},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Leguizamon, G., Michalevich, Z.: A new version of ant system for subset problems. In: International Conference on Evolutionary Computations, vol. 2, pp. 1459\u20131464 (1999)","DOI":"10.1109\/CEC.1999.782655"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"issue":"1","key":"24_CR26","first-page":"137","volume":"44","author":"MR Mosavi","year":"2019","unstructured":"Mosavi, M.R., Khishe, M., Parvizi, G.R., Naseri, M.J., Ayat, M.: Training multi-layer perceptron utilizing adaptive best-mass gravitational search algorithm to classify sonar dataset. Arch. Acoust. 44(1), 137\u2013151 (2019)","journal-title":"Arch. Acoust."},{"issue":"4","key":"24_CR27","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy simulated annealing and tabue search algorithms for the vehicle routing problem. Ann. Oper. Res. 41(4), 421\u2013451 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"7","key":"24_CR28","first-page":"58","volume":"17","author":"S Ravakhah","year":"2017","unstructured":"Ravakhah, S., Khishe, M., Aghababaee, M., Hashemzadeh, E.: Sonar false alarm rate suppression using classification methods based on interior search algorithm. Int. J. Comput. Sci. Netw. Secur. 17(7), 58\u201365 (2017)","journal-title":"Int. J. Comput. Sci. Netw. Secur."},{"key":"24_CR29","first-page":"56","volume":"20","author":"AA Schaffer","year":"1991","unstructured":"Schaffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. Soc. Industr. Appl. Math. J. Comput. 20, 56\u201387 (1991)","journal-title":"Soc. Industr. Appl. Math. J. Comput."},{"key":"24_CR30","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T Stutzle","year":"2000","unstructured":"Stutzle, T., Hoos, H.: Max min ant system. Futur. Gener. Comput. Syst. 16, 889\u2013914 (2000)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"24_CR31","doi-asserted-by":"crossref","unstructured":"Vikhar, P.A.: Evolutionary algorithms: a critical review and its future prospects. In: Proceedings of the 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC), Jalgaon, pp. 261\u2013265 (2016)","DOI":"10.1109\/ICGTSPICC.2016.7955308"},{"issue":"2","key":"24_CR32","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.ejor.2010.05.007","volume":"207","author":"AJ Woodcock","year":"2010","unstructured":"Woodcock, A.J., Wilson, J.M.: A hybrid tabue search\/branch and bound approach to solving the generalized assignment problem. Eur. J. Oper. Res. 207(2), 566\u2013578 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR33","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature Inspired Cooperative Strategies for Optimization (NICSO 2010)","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: Gonz\u00e1lez, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010). SCI, vol. 284, pp. 65\u201374. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6"},{"key":"24_CR34","unstructured":"Yang, X.S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press (2008)"}],"container-title":["Lecture Notes in Computer Science","Large-Scale Scientific Computations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56208-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T21:54:18Z","timestamp":1732053258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56208-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031562075","9783031562082"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56208-2_24","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":"24 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LSSC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Large-Scale Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sozopol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bulgaria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lssc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parallel.bas.bg\/Conferences\/SciCom23\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}