{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T15:43:20Z","timestamp":1771688600482,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030267629","type":"print"},{"value":"9783030267636","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-26763-6_70","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"729-738","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Enhanced Whale Optimization Algorithm with Simplex Method"],"prefix":"10.1007","author":[{"given":"Yanbiao","family":"Niu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhonghua","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongquan","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"issue":"13","key":"70_CR1","doi-asserted-by":"publisher","first-page":"4221","DOI":"10.1007\/s00500-017-2744-y","volume":"22","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset, M., El-Shahat, D., El-Henawy, I., et al.: A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making. Soft. Comput. 22(13), 4221\u20134239 (2018)","journal-title":"Soft. Comput."},{"key":"70_CR2","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.asoc.2017.04.048","volume":"57","author":"AA Heidari","year":"2017","unstructured":"Heidari, A.A., Abbaspour, R.A., Jordehi, A.R.: Gaussian bare-bones water cycle algorithm for optimal reactive power dispatch in electrical power systems. Appl. Soft Comput. 57, 657\u2013671 (2017)","journal-title":"Appl. Soft Comput."},{"key":"70_CR3","first-page":"67","volume":"48","author":"F Hossam","year":"2018","unstructured":"Hossam, F., Al-Zoubi, A.M., Asghar, H.A., et al.: An intelligent system for spam detection and identification of the most relevant features based on evolutionary random weight networks. Inf. Fusion 48, 67\u201383 (2018). S1566253518303968","journal-title":"Inf. Fusion"},{"issue":"2","key":"70_CR4","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.eswa.2014.08.018","volume":"42","author":"L Wang","year":"2015","unstructured":"Wang, L., Zeng, Y., Chen, T.: Back propagation neural network with adaptive differential evolution algorithm for time series forecasting. Expert Syst. Appl. 42(2), 855\u2013863 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"70_CR5","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1007\/s00521-014-1808-5","volume":"26","author":"AR Jordehi","year":"2015","unstructured":"Jordehi, A.R.: A review on constraint handling strategies in particle swarm optimisation. Neural Comput. Appl. 26(6), 1265\u20131275 (2015)","journal-title":"Neural Comput. Appl."},{"key":"70_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.knosys.2018.05.009","volume":"154","author":"H Faris","year":"2018","unstructured":"Faris, H., Mafarja, M.M., Heidari, A.A., et al.: An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl.-Based Syst. 154, 43\u201367 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"70_CR7","doi-asserted-by":"publisher","unstructured":"Asghar, H.A., Hossam, F., Ibrahim, A., et al.: An efficient hybrid multilayer perceptron neural network with grasshopper optimization. Soft Comput. (2018). https:\/\/doi.org\/10.1007\/s00500-018-3424-2","DOI":"10.1007\/s00500-018-3424-2"},{"key":"70_CR8","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."},{"key":"70_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51\u201367 (2016)","journal-title":"Adv. Eng. Softw."},{"key":"70_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.asoc.2014.03.004","volume":"21","author":"E Davoodi","year":"2014","unstructured":"Davoodi, E., Hagh, M.T., Zadeh, S.G.: A hybrid improved quantum-behaved particle swarm optimization-simplex method (IQPSOS) to solve power system load flow problems. Appl. Soft Comput. 21, 171\u2013179 (2014)","journal-title":"Appl. Soft Comput."},{"key":"70_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","volume":"89","author":"S Mirjalili","year":"2015","unstructured":"Mirjalili, S.: Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl.-Based Syst. 89, 228\u2013249 (2015)","journal-title":"Knowl.-Based Syst."},{"key":"70_CR12","doi-asserted-by":"crossref","unstructured":"Mirjalili, S., Hashim, S.Z.M.: A new hybrid PSOGSA algorithm for function optimization. In: International Conference on Computer and Information Application, pp. 374\u2013377 (2010)","DOI":"10.1109\/ICCIA.2010.6141614"},{"key":"70_CR13","first-page":"65","volume":"284","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: A new metaheuristic bat-inspired algorithm. Comput. Knowl. Technol 284, 65\u201374 (2010)","journal-title":"Comput. Knowl. Technol"},{"issue":"3","key":"70_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3), 459\u2013471 (2007)","journal-title":"J Glob Optim"},{"key":"70_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00366-011-0241-y","volume":"29","author":"AH Gandomi","year":"2013","unstructured":"Gandomi, A.H., Yang, X.-S., Alavi, A.H.: Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng. Comput. 29, 17\u201335 (2013)","journal-title":"Eng. Comput."},{"issue":"8","key":"70_CR16","doi-asserted-by":"publisher","first-page":"3197","DOI":"10.1007\/s11771-014-2291-y","volume":"21","author":"W Long","year":"2014","unstructured":"Long, W., et al.: A hybrid cuckoo search algorithm with feasibility-based rule for con-strained structural optimization. J. Central South Univ. 21(8), 3197\u20133204 (2014)","journal-title":"J. Central South Univ."},{"issue":"4","key":"70_CR17","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/TEVC.2003.814902","volume":"7","author":"T Ray","year":"2003","unstructured":"Ray, T., Liew, K.M.: Society and civilization: an optimization algorithm based on the simulation of social behavior. IEEE Trans. Evol. Comput. 7(4), 386\u2013396 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"70_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2017.01.006","volume":"60","author":"SHS Moosavi","year":"2017","unstructured":"Moosavi, S.H.S., Bardsiri, V.K.V.: Satin bowerbird optimizer: a new optimization algorithm to optimize ANFIS for software development effort estimation. Eng. Appl. Artif. Intell. 60, 1\u201315 (2017)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"70_CR19","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S.: SCA: a sine cosine algorithm for solving optimization problems. Knowl. Based. Syst. 96, 120\u2013133 (2016)","journal-title":"Knowl. Based. Syst."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26763-6_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T13:20:49Z","timestamp":1617283249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26763-6_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030267629","9783030267636"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26763-6_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","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":"Nanchang","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":"3 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","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":"icic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2019\/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":"ICIC Website","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"609","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":"217","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":"36% - 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.43","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}