{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T09:24:43Z","timestamp":1784193883938,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":26,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811532894","type":"print"},{"value":"9789811532900","type":"electronic"}],"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-3290-0_19","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T04:17:18Z","timestamp":1588306638000},"page":"241-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":54,"title":["A Novel U-Shaped Transfer Function for\u00a0Binary Particle Swarm Optimisation"],"prefix":"10.1007","author":[{"given":"Seyedehzahra","family":"Mirjalili","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongyu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Seyedali","family":"Mirjalili","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephan","family":"Chalup","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nasimul","family":"Noman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"19_CR1","unstructured":"L. Mason, J. Baxter, P.L. Bartlett, M.R. Frean, Boosting algorithms as gradient descent, in Advances in Neural Information Processing Systems (2000), pp. 512\u2013518"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"D. Karaboga, B. Gorkemli, C. Ozturk, N. Karaboga, A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42(1), 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"key":"19_CR3","unstructured":"C. Wang, D. Mu, F. Zhao, J.W. Sutherland, A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup\u2013delivery and time windows. Comput. Ind. Eng. 83, 111\u2013122 (2015)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2016.08.001","volume":"655","author":"S Salcedo-Sanz","year":"2016","unstructured":"S. Salcedo-Sanz, Modern meta-heuristics based on nonlinear physics processes: a review of models and design procedures. Phys. Rep. 655, 1\u201370 (2016)","journal-title":"Phys. Rep."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussa\u00efD","year":"2013","unstructured":"I. Boussa\u00efD, J. Lepagnot, P. Siarry, A survey on optimization metaheuristics. Inf. Sci. 237, 82\u2013117 (2013)","journal-title":"Inf. Sci."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"J.H. Holland, Genetic algorithms. Sci. Am. 267(1), 66\u201373 (1992)","DOI":"10.1038\/scientificamerican0792-66"},{"key":"19_CR7","unstructured":"K. Fleetwood, An introduction to differential evolution, in Proceedings of Mathematics and Statistics of Complex Systems (MASCOS) One Day Symposium, 26th November, Brisbane, Australia (2004)"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"R. Storn, Kenneth Price, Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Global Optim."},{"key":"19_CR9","unstructured":"J. Knowles, D. Corne, The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation, in Proceedings of the 1999 Congress on Evolutionary Computation, 1999. CEC 99, vol. 1 (IEEE, 1999), pp. 98\u2013105"},{"key":"19_CR10","unstructured":"J.R. Koza, Genetic Programming II, Automatic Discovery of Reusable Subprograms (MIT Press, Cambridge, MA, 1992)"},{"issue":"6","key":"19_CR11","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"Dan Simon","year":"2008","unstructured":"Dan Simon, Biogeography-based optimization. IEEE Trans. Evol. Comput. 12(6), 702\u2013713 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"19_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"M. Dorigo, M. Birattari, Thomas Stutzle, Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"J. Kennedy, Particle swarm optimization, in Encyclopedia of Machine Learning (Springer, Boston, MA, 2011), pp. 760\u2013766","DOI":"10.1007\/978-0-387-30164-8_630"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"D. Karaboga, Bahriye Basturk, A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459\u2013471 (2007)","journal-title":"J. Global Optim."},{"issue":"1","key":"19_CR15","first-page":"8","volume":"2","author":"Y Shi","year":"2004","unstructured":"Y. Shi, Particle swarm optimization. IEEE Connect. 2(1), 8\u201313 (2004)","journal-title":"IEEE Connect."},{"key":"19_CR16","unstructured":"R.C. Eberhart, Y. Shi, Comparing inertia weights and constriction factors in particle swarm optimization, in Proceedings of the 2000 Congress on Evolutionary Computation, 2000, vol.\u00a01 (IEEE, 2000), pp. 84\u201388"},{"key":"19_CR17","unstructured":"I.C. Trelea, The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf. Process. Lett. 85(6), 317\u2013325 (2003)"},{"key":"19_CR18","unstructured":"M.A. Khanesar, M. Teshnehlab, M.A. Shoorehdeli, A novel binary particle swarm optimization, in Mediterranean Conference on Control & Automation, 2007. MED\u201907 (IEEE, 2007), pp. 1\u20136"},{"key":"19_CR19","unstructured":"J. Kennedy, R.C. Eberhart, A discrete binary version of the particle swarm algorithm, in 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation, vol.\u00a05 (IEEE, 1997), pp. 4104\u20134108"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"S. Mirjalili, Andrew Lewis, S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm Evol. Comput. 9, 1\u201314 (2013)","journal-title":"Swarm Evol. Comput."},{"key":"19_CR21","unstructured":"E. Rashedi, H. Nezamabadi-Pour, Saeid Saryazdi, BGSA: binary gravitational search algorithm. Nat. Comput. 9(3), 727\u2013745 (2010)"},{"key":"19_CR22","unstructured":"Y. Shi, R.C. Eberhart, Empirical study of particle swarm optimization, in Proceedings of the 1999 Congress on Evolutionary Computation, 1999. CEC 99, vol.\u00a03 (IEEE, 1999), pp. 1945\u20131950"},{"key":"19_CR23","unstructured":"M. Molga, C. Smutnicki, Test Functions for Optimization Needs (2005), p. 101"},{"issue":"2","key":"19_CR24","first-page":"150","volume":"4","author":"M Jamil","year":"2013","unstructured":"M. Jamil, X.-S. Yang, A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Model. Numer. Optim. 4(2), 150\u2013194 (2013)","journal-title":"Int. J. Math. Model. Numer. Optim."},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/s00521-014-1743-5","volume":"26","author":"S Saremi","year":"2015","unstructured":"S. Saremi, S. Mirjalili, A. Lewis, How important is a transfer function in discrete heuristic algorithms. Neural Comput. Appl. 26(3), 625\u2013640 (2015)","journal-title":"Neural Comput. Appl."},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"J.C. Bansal, K. Deep, A modified binary particle swarm optimization for Knapsack problems. Appl. Math. Comput. 218(22), 11042\u201311061 (2012)","DOI":"10.1016\/j.amc.2012.05.001"}],"container-title":["Advances in Intelligent Systems and Computing","Soft Computing for Problem Solving 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3290-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T01:14:52Z","timestamp":1722820492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3290-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811532894","9789811532900"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3290-0_19","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}