{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:21:45Z","timestamp":1772554905862,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"29","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11042-023-15518-3","type":"journal-article","created":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T06:02:06Z","timestamp":1682920926000},"page":"45411-45432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Zigzag mutation: a new mutation operator to improve the genetic algorithm"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6788-8222","authenticated-orcid":false,"given":"Sasan","family":"Harifi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Mohamaddoust","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,1]]},"reference":[{"issue":"3","key":"15518_CR1","first-page":"128","volume":"22","author":"EA Alkafaween","year":"2020","unstructured":"Alkafaween EA, Hassanat AB (2020) Improving TSP Solutions Using GA with a New Hybrid Mutation Based on Knowledge and Randomness. Commun-Sci lett Univ Zilina 22(3):128\u2013139","journal-title":"Commun-Sci lett Univ Zilina"},{"key":"15518_CR2","doi-asserted-by":"crossref","unstructured":"Ankenbrandt CA (1991) An extension to the theory of convergence and a proof of the time complexity of genetic algorithms. In: Foundations of genetic algorithms, pp. 53-68","DOI":"10.1016\/B978-0-08-050684-5.50007-0"},{"issue":"9","key":"15518_CR3","doi-asserted-by":"publisher","first-page":"13367","DOI":"10.1007\/s11042-020-10257-1","volume":"80","author":"UA Bhatti","year":"2021","unstructured":"Bhatti UA, Yuan L, Yu Z, Li J, Nawaz SA, Mehmood A, Zhang K (2021) New watermarking algorithm utilizing quaternion Fourier transform with advanced scrambling and secure encryption. Multimed Tools Appl 80(9):13367\u201313387","journal-title":"Multimed Tools Appl"},{"key":"15518_CR4","doi-asserted-by":"crossref","unstructured":"Das AK, Pratihar DK (2018) A direction-based exponential mutation operator for real-coded genetic algorithm. In: 2018 Fifth International Conference on Emerging Applications of Information Technology (EAIT), pp. 1-4","DOI":"10.1109\/EAIT.2018.8470407"},{"issue":"1","key":"15518_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10470-017-1090-4","volume":"94","author":"S Dash","year":"2018","unstructured":"Dash S, Joshi D, Sharma A, Trivedi G (2018) A hierarchy in mutation of genetic algorithm and its application to multi-objective analog\/RF circuit optimization. Analog Integ Circuit Sig Proc 94(1):27\u201347","journal-title":"Analog Integ Circuit Sig Proc"},{"issue":"1","key":"15518_CR6","first-page":"1","volume":"4","author":"K Deb","year":"2014","unstructured":"Deb K, Deb D (2014) Analysing mutation schemes for real-parameter genetic algorithms. Int J Artif Int Soft Comput 4(1):1\u201328","journal-title":"Int J Artif Int Soft Comput"},{"issue":"1","key":"15518_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.amc.2007.03.046","volume":"193","author":"K Deep","year":"2007","unstructured":"Deep K, Thakur M (2007) A new mutation operator for real coded genetic algorithms. Appl Math Comput 193(1):211\u2013230","journal-title":"Appl Math Comput"},{"issue":"8","key":"15518_CR8","doi-asserted-by":"publisher","first-page":"8561","DOI":"10.1007\/s12652-020-02589-5","volume":"12","author":"A Haghrah","year":"2021","unstructured":"Haghrah A, Nekoui MA, Nazari-Heris M, Mohammadi-ivatloo B (2021) An improved real-coded genetic algorithm with random walk based mutation for solving combined heat and power economic dispatch. J Ambient Int Human Comput 12(8):8561\u20138584","journal-title":"J Ambient Int Human Comput"},{"key":"15518_CR9","doi-asserted-by":"crossref","unstructured":"Harifi S (2022) A binary ancient-inspired Giza Pyramids Construction metaheuristic algorithm for solving 0-1 knapsack problem. Soft Comput, pp. 1\u201318","DOI":"10.1007\/s00500-022-07285-4"},{"issue":"4","key":"15518_CR10","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1007\/s12065-020-00451-3","volume":"14","author":"S Harifi","year":"2021","unstructured":"Harifi S, Mohammadzadeh J, Khalilian M, Ebrahimnejad S (2021) Giza Pyramids Construction: an ancient-inspired metaheuristic algorithm for optimization. Evol Int 14(4):1743\u20131761","journal-title":"Evol Int"},{"issue":"12","key":"15518_CR11","doi-asserted-by":"publisher","first-page":"390","DOI":"10.3390\/info10120390","volume":"10","author":"A Hassanat","year":"2019","unstructured":"Hassanat A, Almohammadi K, Alkafaween E, Abunawas E, Hammouri A, Prasath VB (2019) Choosing mutation and crossover ratios for genetic algorithms\u2014a review with a new dynamic approach. Information 10(12):390","journal-title":"Information"},{"key":"15518_CR12","doi-asserted-by":"crossref","unstructured":"Hinterding R (1995) Gaussian mutation and self-adaption for numeric genetic algorithms. In: Proceedings of 1995 IEEE International Conference on Evolutionary Computation, pp. 384","DOI":"10.1109\/ICEC.1995.489178"},{"key":"15518_CR13","doi-asserted-by":"crossref","unstructured":"Hodan D, Mrazek V, Vasicek Z (2020) Semantically-oriented mutation operator in cartesian genetic programming for evolutionary circuit design. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, pp. 940-948","DOI":"10.1145\/3377930.3390188"},{"issue":"5","key":"15518_CR14","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch S, Chauhan SS, Kumar V (2021) A review on genetic algorithm: past, present, and future. Multimed Tools Appl 80(5):8091\u20138126","journal-title":"Multimed Tools Appl"},{"key":"15518_CR15","unstructured":"Mauldin ML (1984) Maintaining Diversity in Genetic Search. In AAAI, pp, pp. 247-250"},{"key":"15518_CR16","volume-title":"Genetic algorithms+ data structures= evolution programs","author":"Z Michalewicz","year":"2013","unstructured":"Michalewicz Z (2013) Genetic algorithms+ data structures= evolution programs. Springer Science & Business Media"},{"issue":"1","key":"15518_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Schoenauer M (1996) Evolutionary algorithms for constrained parameter optimization problems. Evolut Comput 4(1):1\u201332","journal-title":"Evolut Comput"},{"key":"15518_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93025-1_4","volume-title":"Evolutionary Algorithms and Neural Networks. Studies in Computational Intelligence","author":"S Mirjalili","year":"2019","unstructured":"Mirjalili S (2019) Genetic Algorithm. In: Evolutionary Algorithms and Neural Networks. Studies in Computational Intelligence, vol 780. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-93025-1_4"},{"key":"15518_CR19","doi-asserted-by":"crossref","unstructured":"Neubauer A (1997) A theoretical analysis of the non-uniform mutation operator for the modified genetic algorithm. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC'97), pp. 93-96","DOI":"10.1109\/ICEC.1997.592275"},{"key":"15518_CR20","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-981-15-6025-5_15","volume":"4.0","author":"KM Qaiduzzaman","year":"2020","unstructured":"Qaiduzzaman KM, Khatun S, Afsa M, Sobhan S, Hossain ME, Shaharum SM, Rahman M (2020) A Mutation Triggering Method for Genetic Algorithm to Solve Traveling Salesman Problem. In Embracing Industry 4.0:159\u2013170","journal-title":"In Embracing Industry"},{"issue":"3","key":"15518_CR21","first-page":"4519","volume":"5","author":"N Soni","year":"2014","unstructured":"Soni N, Kumar T (2014) Study of various mutation operators in genetic algorithms. Int J Comput Sci Inform Technol 5(3):4519\u20134521","journal-title":"Int J Comput Sci Inform Technol"},{"issue":"4","key":"15518_CR22","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas M, Patnaik LM (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Syst, Man, Cyber 24(4):656\u2013667","journal-title":"IEEE Trans Syst, Man, Cyber"},{"issue":"1","key":"15518_CR23","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.asoc.2012.08.035","volume":"13","author":"PH Tang","year":"2013","unstructured":"Tang PH, Tseng MH (2013) Adaptive directed mutation for real-coded genetic algorithms. Appl Soft Comput 13(1):600\u2013614","journal-title":"Appl Soft Comput"},{"key":"15518_CR24","unstructured":"Tsutsui S, Fujimoto Y (1993) Forking Genetic Algorithm with Blocking and Shrinking Modes (fGA). In: ICGA, pp. 206\u2013215"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-15518-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-023-15518-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-15518-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T20:12:24Z","timestamp":1702325544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-023-15518-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,1]]},"references-count":24,"journal-issue":{"issue":"29","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["15518"],"URL":"https:\/\/doi.org\/10.1007\/s11042-023-15518-3","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,1]]},"assertion":[{"value":"18 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}