{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:13:00Z","timestamp":1743045180907,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319959320"},{"type":"electronic","value":"9783319959337"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-95933-7_87","type":"book-chapter","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T06:48:38Z","timestamp":1530773318000},"page":"792-801","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Steepest Descent Bat Algorithm for Solving Systems of Non-linear Equations"],"prefix":"10.1007","author":[{"given":"Gengyu","family":"Ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxian","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aijia","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,6]]},"reference":[{"key":"87_CR1","volume-title":"Nature-Inspired Meta Heuristic Algorithms","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: Nature-Inspired Meta Heuristic Algorithms. Luniver Press, Bristol (2010)"},{"issue":"1","key":"87_CR2","first-page":"272","volume":"31","author":"HH Xiao","year":"2014","unstructured":"Xiao, H.H., Duan, Y.M.: Research and application of improved bat algorithm based on DE algorithm. Comput. Simul. 31(1), 272\u2013301 (2014)","journal-title":"Comput. Simul."},{"issue":"5","key":"87_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1504\/IJBIC.2011.042259","volume":"3","author":"XS Yang","year":"2011","unstructured":"Yang, X.S.: Bat algorithm for multi-objective optimization. Int. J. Bio-Inspir. Comput. 3(5), 267\u2013274 (2011)","journal-title":"Int. J. Bio-Inspir. Comput."},{"issue":"5","key":"87_CR4","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1108\/02644401211235834","volume":"29","author":"XS Yang","year":"2012","unstructured":"Yang, X.S., Hossein, G.A.: Bat algorithm: a novel approach for global engineering optimization. Eng. Comput. 29(5), 464\u2013483 (2012)","journal-title":"Eng. Comput."},{"issue":"2","key":"87_CR5","first-page":"263","volume":"84","author":"G Komarasarmy","year":"2012","unstructured":"Komarasarmy, G., Wahi, A.: An optimized k-means clustering technique using bat algorithm. Eur. J. Sci. Res. 84(2), 263\u2013273 (2012)","journal-title":"Eur. J. Sci. Res."},{"issue":"1","key":"87_CR6","first-page":"119","volume":"16","author":"XH Sheng","year":"2013","unstructured":"Sheng, X.H., Ye, C.M.: Application of bat algorithm to permutation flow-shop scheduling problem. Ind. Eng. J. 16(1), 119\u2013124 (2013)","journal-title":"Ind. Eng. J."},{"issue":"5","key":"87_CR7","first-page":"1323","volume":"30","author":"GQ Huang","year":"2013","unstructured":"Huang, G.Q., Zhao, W.J., Lu, Q.Q.: Bat algorithm with global convergence for solving large-scale optimization problem. Appl. Res. Comput. 30(5), 1323\u20131328 (2013)","journal-title":"Appl. Res. Comput."},{"key":"87_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-39482-9_25","volume-title":"Intelligent Computing Theories and Technology","author":"X Wang","year":"2013","unstructured":"Wang, X., Wang, W., Wang, Y.: An adaptive bat algorithm. In: Huang, D.-S., Jo, K.-H., Zhou, Y.-Q., Han, K. (eds.) ICIC 2013. LNCS (LNAI), vol. 7996, pp. 216\u2013223. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39482-9_25"},{"key":"87_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-319-12286-1_5","volume":"329","author":"TS Pan","year":"2015","unstructured":"Pan, T.S., Dao, T.K., Chu, S.C.: Hybrid particle swarm optimization with bat algorithm. Genet. Evol. Comput. 329, 37\u201347 (2015)","journal-title":"Genet. Evol. Comput."},{"key":"87_CR10","first-page":"15","volume":"2014","author":"QF Luo","year":"2014","unstructured":"Luo, Q.F., Zhou, Y.Q., Xie, J., Ma, M.Z., Li, L.L.: Discrete bat algorithm for optimal problem of permutation flow shop scheduling. Sci. World J. 2014, 15 (2014)","journal-title":"Sci. World J."},{"key":"87_CR11","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.asoc.2015.05.042","volume":"35","author":"NC Yang","year":"2015","unstructured":"Yang, N.C., Le, M.D.: Optimal design of passive power filters based on multi-objective bat algorithm and pare to front. Appl. Soft Comput. 35, 257\u2013266 (2015)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"87_CR12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.asej.2015.08.006","volume":"8","author":"T Yuvaraj","year":"2017","unstructured":"Yuvaraj, T., Ravi, K., Devabalaji, K.: DSTATCOM allocation in distribution networks considering load variations using bat algorithm. Ain Shams Eng. J. 8(3), 391\u2013403 (2017)","journal-title":"Ain Shams Eng. J."},{"issue":"7","key":"87_CR13","doi-asserted-by":"publisher","first-page":"6585","DOI":"10.3390\/en8076585","volume":"8","author":"W Sun","year":"2015","unstructured":"Sun, W., Liu, M., Liang, Y.: Wind speed forecasting based on FEEMD and LSSVM optimized by the bat algorithm. Energies 8(7), 6585\u20136607 (2015)","journal-title":"Energies"},{"issue":"2","key":"87_CR14","first-page":"130","volume":"35","author":"XW Zhang","year":"2005","unstructured":"Zhang, X.W., Xing, Z.D., Dong, J.M.: A hybrid genetic algorithm to seeking the optimum solution of a class of unconstrained optimization. J. Northwest Univ. (Nat. Sci. Edit.) 35(2), 130\u2013132 (2005)","journal-title":"J. Northwest Univ. (Nat. Sci. Edit.)"},{"issue":"4","key":"87_CR15","doi-asserted-by":"publisher","first-page":"866","DOI":"10.2307\/1427681","volume":"23","author":"H Haario","year":"1991","unstructured":"Haario, H., Saksman, E.: Simulated annealing process in general state space. Adv. Appl. Probab. 23(4), 866\u2013893 (1991)","journal-title":"Adv. Appl. Probab."},{"issue":"6","key":"87_CR16","first-page":"807","volume":"18","author":"XP Zhao","year":"1992","unstructured":"Zhao, X.P.: Convergence on the steeped decent method using difference quotient. J. East China Inst. Chem. Technol. 18(6), 807\u2013812 (1992)","journal-title":"J. East China Inst. Chem. Technol."},{"issue":"3","key":"87_CR17","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/72.286921","volume":"5","author":"AG Parlos","year":"1994","unstructured":"Parlos, A.G., Fernandez, B., Atiya, A.F., Muthusami, J., Tsai, W.K.: An accelerated learning algorithm for multilayer perception networks. IEEE Trans. Neural Netw. 5(3), 493\u2013497 (1994)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"4","key":"87_CR18","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1109\/83.913592","volume":"10","author":"N Nguyen","year":"2001","unstructured":"Nguyen, N., Milanfar, P., Golub, G.: A computationally efficient super resolution image reconstruction algorithm. IEEE Trans. Image Process. 10(4), 573\u2013583 (2001)","journal-title":"IEEE Trans. Image Process."},{"issue":"6","key":"87_CR19","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1109\/83.503914","volume":"5","author":"Y Li","year":"1996","unstructured":"Li, Y., Santosa, F.: A computational algorithm for minimizing total variation in image restoration. IEEE Trans. Image Process. 5(6), 987\u2013995 (1996)","journal-title":"IEEE Trans. Image Process."},{"issue":"5","key":"87_CR20","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1093\/ietfec\/e89-a.5.1160","volume":"E89A","author":"K Murota","year":"2006","unstructured":"Murota, K., Tanaka, K.: A steepest descent algorithm for M-convex functions on jump systems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E89A(5), 1160\u20131165 (2006)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"87_CR21","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender, G.: Learning to rank using gradient descent. In: Proceeding of the 22nd International Conference on Machine Learning, pp. 89\u201396 (2005)","DOI":"10.1145\/1102351.1102363"},{"key":"87_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","volume-title":"Nature Inspired Cooperative Strategies for Optimization","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: A new meta-heuristic bat-inspired algorithm. In: Gonz\u00e1lez, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature Inspired Cooperative Strategies for Optimization, vol. 284, pp. 65\u201374. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95933-7_87","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:04:37Z","timestamp":1709827477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-95933-7_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319959320","9783319959337"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95933-7_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2018","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":"icic2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2018\/index.htm","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":"LOD","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"632","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":"275","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":"72","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":"44% - 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.46","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":"0","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)"}}]}}