{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:46:37Z","timestamp":1759333597182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031366215"},{"type":"electronic","value":"9783031366222"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-36622-2_4","type":"book-chapter","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T12:02:36Z","timestamp":1688731356000},"page":"43-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-Modal Honey Bee Foraging Optimizer for\u00a0Weapon Target Assignment Problem"],"prefix":"10.1007","author":[{"given":"Beena S.","family":"Lawrence","sequence":"first","affiliation":[]},{"given":"Chandra S. S.","family":"Vinod","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Anand, H., Saritha, R., Vinod Chandra, S.: Many objective optimization algorithm based on mixed species particle flocking. J. Ambient Intell. Hum. Comput., 1\u201317 (2022)","DOI":"10.1007\/s12652-022-03782-4"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1287\/opre.33.4.726","volume":"33","author":"SA Burr","year":"1985","unstructured":"Burr, S.A., Falk, J.E., Karr, A.F.: Integer prim-read solutions to a class of target defense problems. Oper. Res. 33(4), 726\u2013745 (1985)","journal-title":"Oper. Res."},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S1004-4132(06)60097-2","volume":"17","author":"H Cai","year":"2006","unstructured":"Cai, H., Liu, J., Chen, Y., Wang, H.: Survey of the research on dynamic weapon-target assignment problem. J. Syst. Eng. Electr. 17(3), 559\u2013565 (2006)","journal-title":"J. Syst. Eng. Electr."},{"key":"4_CR4","unstructured":"Flood, M.: Target-assignment model. In: Proceedings of the Princeton University Conference on Linear Programming, Princeton (NJ) (1957)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.cor.2018.10.015","volume":"105","author":"A Kline","year":"2019","unstructured":"Kline, A., Ahner, D., Hill, R.: The weapon-target assignment problem. Comput. Oper. Res. 105, 226\u2013236 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S1568-4946(02)00027-3","volume":"2","author":"ZJ Lee","year":"2002","unstructured":"Lee, Z.J., Lee, C.Y., Su, S.F.: An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem. Appl. Soft Comput. 2(1), 39\u201347 (2002)","journal-title":"Appl. Soft Comput."},{"key":"4_CR7","unstructured":"Lloyd, S.P., Witsenhausen, H.S.: Weapons allocation is np-complete. In: 1986 Summer Computer Simulation Conference, pp. 1054\u20131058 (1986)"},{"issue":"7","key":"4_CR8","doi-asserted-by":"publisher","first-page":"4426","DOI":"10.1109\/TSMC.2021.3096997","volume":"52","author":"W Luo","year":"2021","unstructured":"Luo, W., L\u00fc, J., Liu, K., Chen, L.: Learning-based policy optimization for adversarial missile-target assignment. IEEE Trans. Syst. Man Cybern.: Syst. 52(7), 4426\u20134437 (2021)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.6.3.346","volume":"6","author":"AS Manne","year":"1958","unstructured":"Manne, A.S.: A target-assignment problem. Oper. Res. 6(3), 346\u2013351 (1958)","journal-title":"Oper. Res."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Murphey, R.A.: An approximate algorithm for a weapon target assignment stochastic program. Approximation Complex. Numer. Optim.: Continuous Discrete Prob. 406\u2013421 (2000)","DOI":"10.1007\/978-1-4757-3145-3_24"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MIS.2018.111144149","volume":"34","author":"R Saritha","year":"2018","unstructured":"Saritha, R., Chandra, S.V.: Multimodal foraging by honey bees toward optimizing profits at multiple colonies. IEEE Intell. Syst. 34(1), 14\u201322 (2018)","journal-title":"IEEE Intell. Syst."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Saritha, R., Vinod Chandra, S.: Multi dimensional honey bee foraging algorithm based on optimal energy consumption. J. Inst. Eng. (India): Ser. B 98, 527\u2013531 (2017)","DOI":"10.1007\/s40031-017-0294-4"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Shang, G., Zaiyue, Z., Xiaoru, Z., Cungen, C.: Immune genetic algorithm for weapon-target assignment problem. In: Workshop on Intelligent Information Technology Application (IITA 2007), pp. 145\u2013148. IEEE (2007)","DOI":"10.1109\/IITA.2007.24"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Sonuc, E., Baha, S., Bayir, S.: A parallel simulated annealing algorithm for weapon-target assignment problem. Int. J. Adv. Comput. Sci. Appl. 8(4) (2017)","DOI":"10.14569\/IJACSA.2017.080412"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"SS, V.C.: Smell detection agent based optimization algorithm. J. Inst. Eng. (India): Ser. B 97, 431\u2013436 (2016)","DOI":"10.1007\/s40031-014-0182-0"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00607-021-00955-5","volume":"104","author":"VC Ss","year":"2022","unstructured":"Ss, V.C., Hs, A.: Nature inspired meta heuristic algorithms for optimization problems. Computing 104(2), 251\u2013269 (2022)","journal-title":"Computing"},{"issue":"5","key":"4_CR17","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/S1004-4132(08)60179-6","volume":"19","author":"W Yanxia","year":"2008","unstructured":"Yanxia, W., Longjun, Q., Zhi, G., Lifeng, M.: Weapon target assignment problem satisfying expected damage probabilities based on ant colony algorithm. J. Syst. Eng. Electr. 19(5), 939\u2013944 (2008)","journal-title":"J. Syst. Eng. Electr."}],"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-3-031-36622-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:15:19Z","timestamp":1710260119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36622-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031366215","9783031366222"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36622-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 July 2023","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":"Shenzhen","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 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":"swarm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}