{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:32:09Z","timestamp":1742967129115,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534249"},{"type":"electronic","value":"9789811534256"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3425-6_11","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"124-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Bacterial Forging Optimization Based on Artificial Fish Swarm Algorithm and Gaussian Disturbance"],"prefix":"10.1007","author":[{"given":"Ruozhen","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Zhiqin","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jiaqi","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Shukun","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Lijing","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"issue":"6","key":"11_CR1","first-page":"626","volume":"17","author":"R Azizi","year":"2014","unstructured":"Azizi, R.: Empirical study of artificial fish swarm algorithm. Comput. Sci. 17(6), 626\u2013641 (2014)","journal-title":"Comput. Sci."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.neucom.2013.04.054","volume":"137","author":"H Chen","year":"2014","unstructured":"Chen, H., Niu, B., Ma, L., Su, W., Zhu, Y.: Bacterial colony foraging optimization. Neurocomputing 137, 268\u2013284 (2014)","journal-title":"Neurocomputing"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Daas, M.S., Chikhi, S., Batouche, M.: Bacterial foraging optimization with double role of reproduction and step adaptation. In: Proceedings of the International Conference on Intelligent Information Processing, Security and Advanced Communication, p. 71. ACM (2015)","DOI":"10.1145\/2816839.2816868"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1109\/TEVC.2009.2021982","volume":"13","author":"S Dasgupta","year":"2009","unstructured":"Dasgupta, S., Das, S., Abraham, A., Biswas, A.: Adaptive computational chemotaxis in bacterial foraging optimization: an analysis. IEEE Trans. Evol. Comput. 13(4), 919\u2013941 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Feng, X.H., He, Y.Y., Yu, J.: Economic load dispatch using bacterial foraging optimization algorithm based on evolution strategies. In: Advanced Materials Research, vol. 860, pp. 2040\u20132045. Trans Tech Publ. (2014)","DOI":"10.4028\/www.scientific.net\/AMR.860-863.2040"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Gupta, N., Saxena, J., Bhatia, K.S.: Optimized metamaterial-loaded fractal antenna using modified hybrid BF-PSO algorithm. Neural Comput. Appl., 1\u201317 (2019). \nhttps:\/\/doi.org\/10.1007\/s00521-019-04202-z","DOI":"10.1007\/s00521-019-04202-z"},{"issue":"26","key":"11_CR7","first-page":"101","volume":"29","author":"PG Kou","year":"2009","unstructured":"Kou, P.G., Zhou, J.Z., Yao-Yao, H.E., Xiang, X.Q., Chao-Shun, L.I.: Optimal PID governor tuning of hydraulic turbine generators with bacterial foraging particle swarm optimization algorithm. Proc. CSEE 29(26), 101\u2013106 (2009)","journal-title":"Proc. CSEE"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Mishra, S.: Bacteria foraging based solution to optimize both real power loss and voltage stability limit. In: Power Engineering Society General Meeting (2007)","DOI":"10.1109\/PES.2007.385641"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCS.2002.1004010","volume":"22","author":"KM Passino","year":"2002","unstructured":"Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. Mag. 22(3), 52\u201367 (2002)","journal-title":"IEEE Control Syst. Mag."},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1016\/j.neucom.2014.03.082","volume":"151","author":"L Tan","year":"2015","unstructured":"Tan, L., Lin, F., Hong, W.: Adaptive comprehensive learning bacterial foraging optimization and its application on vehicle routing problem with time windows. Neurocomputing 151(3), 1208\u20131215 (2015)","journal-title":"Neurocomputing"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"3459","DOI":"10.1007\/s10586-017-1144-5","volume":"20","author":"F Teng","year":"2017","unstructured":"Teng, F., Zhang, L.: Application of BFO-AFSA to location of distribution centre. Cluster Comput. 20(3), 3459\u20133474 (2017). \nhttps:\/\/doi.org\/10.1007\/s10586-017-1144-5","journal-title":"Cluster Comput."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.cogsys.2018.07.022","volume":"52","author":"L Wang","year":"2018","unstructured":"Wang, L., Zhao, W., Tian, Y., Pan, G.: A bare bones bacterial foraging optimization algorithm. Cogn. Syst. Res. 52, 301\u2013311 (2018)","journal-title":"Cogn. Syst. Res."},{"key":"11_CR13","first-page":"32","volume":"22","author":"LI Xiaolei","year":"2002","unstructured":"Xiaolei, L.I., Shao, Z., Qian, J.: An optimizing method based on autonomous animats: fish-swarm algorithm. Syst. Eng.-Theory Pract. 22, 32\u201338 (2002)","journal-title":"Syst. Eng.-Theory Pract."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Yazdani, D., Golyari, S., Meybodi, M.R.: A new hybrid algorithm for optimization based on artificial fish swarm algorithm and cellular learning automata. In: International Symposium on Telecommunications (2010)","DOI":"10.1109\/ISTEL.2010.5734156"}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3425-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:30:21Z","timestamp":1585791021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3425-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534249","9789811534256"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3425-6_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","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":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"197","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":"121","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":"61% - 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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}