{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:31:40Z","timestamp":1781109100190,"version":"3.54.1"},"reference-count":22,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1,1]]},"abstract":"<p>Nature-Inspired Algorithms (NIAs) are one of the most efficient methods to solve the optimization problems. A recently proposed NIA is the anti-predatory NIA, which is based on the anti-predatory behavior of frogs. This algorithm uses five different types of self-defense mechanisms in order to improve its anti-predatory strength. This paper demonstrates the computation steps of anti-predatory for solving the Rastrigin function and attempts to solve 20 unconstrained minimization problems using anti-predatory NIA. The performance of anti-predatory NIA is compared with the six competing meta-heuristic algorithms. A comparative study reveals that the anti-predatory NIA is a more promising than the other algorithms. To quantify the performance comparison between the algorithms, Friedman rank test and Holm-Sidak test are used as statistical analysis methods. Anti-predatory NIA ranks first in both cases of \u201cMean Result\u201d and \u201cStandard Deviation.\u201d Result measures the robustness and correctness of the anti-predatory NIA. This signifies the worth of anti-predatory NIA in the domain of mathematical optimization.<\/p>","DOI":"10.4018\/ijsir.2020010101","type":"journal-article","created":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T11:43:39Z","timestamp":1571744619000},"page":"1-23","source":"Crossref","is-referenced-by-count":8,"title":["Anti-Predatory NIA for Unconstrained Mathematical Optimization Problems"],"prefix":"10.4018","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6018-3716","authenticated-orcid":true,"given":"Rohit Kumar","family":"Sachan","sequence":"first","affiliation":[{"name":"Motilal Nehru National Institute of Technology Allahabad, Allahabad, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dharmender Singh","family":"Kushwaha","sequence":"additional","affiliation":[{"name":"Motilal Nehru National Institute of Technology Allahabad, Allahabad, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJSIR.2020010101-0","doi-asserted-by":"publisher","DOI":"10.1109\/ICRTIT.2013.6844260"},{"key":"IJSIR.2020010101-1","first-page":"661","author":"A.Arora","year":"2014","journal-title":"State based test case generation using VCL-GA. In 2014 international conference on issues and challenges in intelligent computing techniques (icict)"},{"key":"IJSIR.2020010101-2","doi-asserted-by":"publisher","DOI":"10.1080\/00221309.1945.10544481"},{"key":"IJSIR.2020010101-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"IJSIR.2020010101-4","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)"},{"key":"IJSIR.2020010101-5","unstructured":"Fister, I., Jr., Yang, X. S., Fister, I., Brest, J., & Fister, D. (2013). A brief review of nature-inspired algorithms for optimization. arXiv preprint arXiv:1307.4186"},{"key":"IJSIR.2020010101-6","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-012-0067-2"},{"key":"IJSIR.2020010101-7","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"IJSIR.2020010101-8","first-page":"65","article-title":"A simple sequentially rejective multiple test procedure.","author":"S.Holm","year":"1979","journal-title":"Scandinavian Journal of Statistics"},{"key":"IJSIR.2020010101-9","doi-asserted-by":"publisher","DOI":"10.1504\/IJMMNO.2013.055204"},{"key":"IJSIR.2020010101-10","unstructured":"Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization (Vol. 200). Technical report-tr06. Erciyes University, Engineering Faculty, Computer Engineering Department."},{"key":"IJSIR.2020010101-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.03.090"},{"key":"IJSIR.2020010101-12","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks.","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"IJSIR.2020010101-13","first-page":"19","article-title":"Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems.","volume":"7","author":"R.Rao","year":"2016","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"IJSIR.2020010101-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2010.12.015"},{"key":"IJSIR.2020010101-15","article-title":"Solving the Uncapacitated Single Allocation p-Hub Location Problem with Fixed Cost using Anti-Predatory NIA.","author":"R. K.Sachan","year":"2018","journal-title":"International Conference on Next Generation Computing Technologies"},{"key":"IJSIR.2020010101-16","unstructured":"Sachan, R. K., & Kushwaha, D. S. (2018a). New NIA based approach for optimizing basic COCOMO model. In Computing for Sustainable Global Development (INDIACom), 2018 5th International Conference on (pp. 1242-1247). IEEE."},{"key":"IJSIR.2020010101-17","doi-asserted-by":"publisher","DOI":"10.4018\/IJAMC.2019010105"},{"key":"IJSIR.2020010101-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.06.107"},{"key":"IJSIR.2020010101-19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008202821328"},{"key":"IJSIR.2020010101-20","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"IJSIR.2020010101-21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29694-9_16"}],"container-title":["International Journal of Swarm Intelligence Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=240627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T21:55:13Z","timestamp":1651874113000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJSIR.2020010101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijsir.2020010101","relation":{},"ISSN":["1947-9263","1947-9271"],"issn-type":[{"value":"1947-9263","type":"print"},{"value":"1947-9271","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}