{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:10:34Z","timestamp":1777705834176,"version":"3.51.4"},"reference-count":60,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2023,6,1]]},"abstract":"<jats:p>Slime mould algorithm (SMA) is a novel meta-heuristic algorithm with fast convergence speed and high convergence accuracy. However, it still has some drawbacks to be improved. The exploration and exploitation of SMA is difficult to balance, and it easy to fall into local optimum in the late iteration. Aiming at the problems existing in SMA, a multistrategy slime mould algorithm named GCSMA is proposed for global optimization in this paper. First, the Logistic-Tent double chaotic map approach is introduced to improve the quality of the initial population. Second, a dynamic probability threshold based on Gompertz curve is designed to balance exploration and exploitation. Finally, the Cauchy mutation operator based on elite individuals is employed to enhance the global search ability, and avoid it falling into the local optimum. 12 benchmark function experiments show that GCSMA has superior performance in continuous optimization. Compared with the original SMA and other novel algorithms, the proposed GCSMA has better convergence accuracy and faster convergence speed. Then, a special encoding and decoding method is used to apply GCSMA to discrete flexible job-shop scheduling problem (FJSP). The simulation experiment is verified that GCSMA can be effectively applied to FJSP, and the optimization results are satisfactory.<\/jats:p>","DOI":"10.3233\/jifs-223827","type":"journal-article","created":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T11:39:34Z","timestamp":1680867574000},"page":"10397-10415","source":"Crossref","is-referenced-by-count":1,"title":["Improved slime mould algorithm based on Gompertz dynamic probability and Cauchy mutation with application in FJSP"],"prefix":"10.1177","volume":"44","author":[{"given":"Dan","family":"Li","sequence":"first","affiliation":[{"name":"Department of Statistics, Wuhan University of Technology, Wuhan, China"}]},{"given":"Fei","family":"Gao","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Center for Mathematical Sciences, Wuhan University of Technology, Wuhan, China"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-223827_ref1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.jnca.2015.09.013","article-title":"Optimal placement of relaynodes in wireless sensor network using artificial bee colonyalgorithm","volume":"64","author":"Hashim","year":"2016","journal-title":"Journal of Network and Computer Applications"},{"issue":"1","key":"10.3233\/JIFS-223827_ref2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/TSC.2015.2439695","article-title":"Accelerated PSO swarm search feature selection for data stream mining big data","volume":"9","author":"Fong","year":"2015","journal-title":"IEEE Transactions on Services Computing"},{"issue":"1","key":"10.3233\/JIFS-223827_ref3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1504\/IJOR.2021.115417","article-title":"Self-adaptive bee colony optimisation algorithm for the flexible job-shop scheduling problem","volume":"41","author":"Alzaqebah","year":"2021","journal-title":"International Journal of Operational Research"},{"key":"10.3233\/JIFS-223827_ref4","doi-asserted-by":"crossref","first-page":"107815","DOI":"10.1016\/j.knosys.2021.107815","article-title":"Dynamic opposite learning enhanced dragonfly algorithm for solving large-scale flexible job shop scheduling problem","volume":"238","author":"Yang","year":"2022","journal-title":"Knowledge-Based Systems"},{"issue":"10","key":"10.3233\/JIFS-223827_ref5","doi-asserted-by":"crossref","first-page":"3121","DOI":"10.1080\/00207543.2018.1543964","article-title":"Extracting priority rulesfor dynamic multi-objective flexible job shop scheduling problems using gene expression programming","volume":"57","author":"Ozturk","year":"2019","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.3233\/JIFS-223827_ref6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"10.3233\/JIFS-223827_ref7","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","article-title":"An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem","volume":"29","author":"Nouiri","year":"2018","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"11","key":"10.3233\/JIFS-223827_ref8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.3390\/a12110243","article-title":"An improved genetic algorithm with adaptive variable neighborhood search for FJSP","volume":"12","author":"Gu","year":"2019","journal-title":"Algorithms"},{"issue":"10","key":"10.3233\/JIFS-223827_ref9","first-page":"185","article-title":"Metaheuristic algorithms: A comprehensive review","volume":"57","author":"Mohamed","year":"2018","journal-title":"Computational Intelligencefor Multimedia Big Data on the Cloud with Engineering Applications"},{"key":"10.3233\/JIFS-223827_ref10","doi-asserted-by":"crossref","first-page":"1365","DOI":"10.1016\/j.jclepro.2019.06.151","article-title":"Energy-efficient scheduling formulti-objective flexible job shops with variable processing speedsby grey wolf optimization","volume":"234","author":"Luo","year":"2019","journal-title":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-223827_ref12","doi-asserted-by":"crossref","first-page":"86915","DOI":"10.1109\/ACCESS.2020.2992478","article-title":"Improved jaya algorithm for flexible job shop rescheduling problem","volume":"8","author":"Gao","year":"2020","journal-title":"IEEE Access"},{"issue":"8","key":"10.3233\/JIFS-223827_ref13","doi-asserted-by":"crossref","first-page":"618","DOI":"10.3390\/machines10080618","article-title":"A novel hybrid whale optimization algorithm for flexible job-shop scheduling problem","volume":"10","author":"Yang","year":"2022","journal-title":"Machines"},{"issue":"1","key":"10.3233\/JIFS-223827_ref14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","article-title":"No free lunch theorems foroptimization","volume":"1","author":"Wolpert","year":"1997","journal-title":"IEEE transactions on evolutionary computation"},{"issue":"4","key":"10.3233\/JIFS-223827_ref15","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10462-016-9486-6","article-title":"Plant intelligence based metaheuristic optimization algorithms","volume":"47","author":"Akyol","year":"2017","journal-title":"Artificial Intelligence Review"},{"issue":"6","key":"10.3233\/JIFS-223827_ref16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.33383\/2019-029","article-title":"Comparative assessment of light-based intelligent search and optimization algorithms","volume":"28","author":"Alatas","year":"2020","journal-title":"Light & Engineering"},{"issue":"3","key":"10.3233\/JIFS-223827_ref17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.5755\/j01.itc.48.3.20627","article-title":"A physics based novel approach for travelling tournament problem: optics inspired optimization","volume":"48","author":"Alatas","year":"2019","journal-title":"Information Technology and Control"},{"issue":"3","key":"10.3233\/JIFS-223827_ref18","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","article-title":"GSA: a gravitationalsearch algorithms","volume":"179","author":"Rashedi","year":"2009","journal-title":"Information Sciences"},{"key":"10.3233\/JIFS-223827_ref19","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.future.2019.07.015","article-title":"Henry gas solubility optimization: A novel physics-based algorithm","volume":"4","author":"Hashim","year":"2019","journal-title":"Future Generation Computer Systems"},{"issue":"4","key":"10.3233\/JIFS-223827_ref21","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution\u2013a simple andefficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"Journal of Global Optimization"},{"key":"10.3233\/JIFS-223827_ref22","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","volume":"4","author":"Kennedy","year":"1995","journal-title":"Proceedings of ICNN\u201995-international conference on neural networks"},{"issue":"4","key":"10.3233\/JIFS-223827_ref24","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","article-title":"Ant colony optimization","volume":"1","author":"Dorigo","year":"2006","journal-title":"IEEE Computational Intelligence Magazine"},{"issue":"3","key":"10.3233\/JIFS-223827_ref25","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","article-title":"Grey wolf optimizer","volume":"69","author":"Mirjalili","year":"2014","journal-title":"Advances in Engineering Software"},{"key":"10.3233\/JIFS-223827_ref26","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","article-title":"The whale optimization algorithm","volume":"95","author":"Mirjalili","year":"2016","journal-title":"Advances in Engineering Software"},{"key":"10.3233\/JIFS-223827_ref27","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","article-title":"Harris hawks optimization:Algorithm and applications","volume":"97","author":"Heidari","year":"2019","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"10.3233\/JIFS-223827_ref28","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1080\/21642583.2019.1708830","article-title":"A novel swarm intelligence optimization approach: sparrow search algorithm","volume":"8","author":"Xue","year":"2020","journal-title":"Systems Science & Control Engineering"},{"key":"10.3233\/JIFS-223827_ref29","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.future.2020.03.055","article-title":"Slime mould algorithm: A new method forstochastic optimization","volume":"111","author":"Li","year":"2020","journal-title":"Future Generation Computer Systems"},{"issue":"2020","key":"10.3233\/JIFS-223827_ref30","first-page":"100849","article-title":"A new strategy based on slime mould algorithm to extract the optimal model parameters of solar pv panel","volume":"42","author":"Mostafa","journal-title":"Sustainable Energy Technologies and Assessments"},{"key":"10.3233\/JIFS-223827_ref31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/w12102692","article-title":"Hybridised Artificial Neural Network Model with Slime Mould Algorithm: A Novel Methodology for Prediction of Urban Stochastic Water Demand","volume":"12","author":"Zubaidi","year":"2020","journal-title":"Water"},{"issue":"4","key":"10.3233\/JIFS-223827_ref32","doi-asserted-by":"crossref","first-page":"107372","DOI":"10.1016\/j.asoc.2021.107372","article-title":"Implementing modified swarm intelligence algorithm based on slime moulds for path planning and obstacle avoidance problem in mobile robots","volume":"107","author":"Agarwal","year":"2021","journal-title":"Applied Soft Computing"},{"key":"10.3233\/JIFS-223827_ref33","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.isatra.2021.04.011","article-title":"Chaos-opposition-enhanced slime mould algorithm for minimizing thecost of energy for the wind turbines on high-altitude sites","volume":"121","author":"Rizk-Allah","year":"2022","journal-title":"ISA Transactions"},{"key":"10.3233\/JIFS-223827_ref36","doi-asserted-by":"crossref","first-page":"115870","DOI":"10.1016\/j.eswa.2021.115870","article-title":"An efficient slime mould algorithm for solving multi-objective optimization problems","volume":"187","author":"Houssein","year":"2022","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-223827_ref37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13369-021-06513-7","article-title":"EOSMA: an equilibrium optimizer slime mould algorithm for engineering design problems","volume":"47","author":"Yin","year":"2022","journal-title":"Arabian Journal for Science and Engineering"},{"key":"10.3233\/JIFS-223827_ref38","doi-asserted-by":"crossref","first-page":"107761","DOI":"10.1016\/j.knosys.2021.107761","article-title":"Dispersed for aging slime mould algorithm: continuous and binary variants for global optimization and wrapper-based feature selection","volume":"237","author":"Hu","year":"2022","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/JIFS-223827_ref40","doi-asserted-by":"crossref","first-page":"108487","DOI":"10.1016\/j.cie.2022.108487","article-title":"Mathematical model and simulated annealing algorithm for setup operator constrained flexible job shop scheduling problem","volume":"171","author":"Defersha","year":"2022","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"10.3233\/JIFS-223827_ref41","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.ejor.2006.04.007","article-title":"An effective architecture for learning and evolving flexible job-shop schedules","volume":"179","author":"Ho","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"21","key":"10.3233\/JIFS-223827_ref42","doi-asserted-by":"crossref","first-page":"106208","DOI":"10.1016\/j.asoc.2020.106208","article-title":"Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning","volume":"91","author":"Luo","year":"2020","journal-title":"Applied Soft Computing"},{"issue":"4","key":"10.3233\/JIFS-223827_ref43","doi-asserted-by":"crossref","first-page":"4573","DOI":"10.3233\/JIFS-191370","article-title":"Improved African buffalo optimization algorithm for the green flexible job shop scheduling problem considering energy consumption","volume":"38","author":"Jiang","year":"2020","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"10.3233\/JIFS-223827_ref44","doi-asserted-by":"crossref","first-page":"104427","DOI":"10.1016\/j.compbiomed.2021.104427","article-title":"Multilevel threshold image segmentation with diffusion association slime mould algorithm and Renyi\u2019s entropy for chronic obstructive pulmonary disease","volume":"134","author":"Zhao","year":"2021","journal-title":"Computers in Biology and Medicine"},{"issue":"2021","key":"10.3233\/JIFS-223827_ref45","first-page":"2407","article-title":"Improved Slime Mould Algorithm based on Firefly Algorithm for feature selection: A casestudy on QSAR model","volume":"38","author":"Ewees","journal-title":"Engineering with Computers"},{"key":"10.3233\/JIFS-223827_ref46","first-page":"4673665","article-title":"Modified Harris Hawks Optimization Algorithm with Exploration Factor and Random Walk Strategy","volume":"2022","author":"Song","year":"2022","journal-title":"Computational Intelligence and Neuroscience"},{"issue":"16","key":"10.3233\/JIFS-223827_ref47","doi-asserted-by":"crossref","first-page":"17405","DOI":"10.1007\/s11042-016-3907-z","article-title":"A novel chaos optimization algorithm","volume":"76","author":"Zhang","year":"2017","journal-title":"Multimedia Tools and Applications"},{"issue":"2022","key":"10.3233\/JIFS-223827_ref48","first-page":"113","article-title":"Improved salp swarm algorithm combinedwith chaos","volume":"202","author":"Tawhid","journal-title":"Mathematics and Computers in Simulation"},{"issue":"2","key":"10.3233\/JIFS-223827_ref49","doi-asserted-by":"crossref","first-page":"1373","DOI":"10.1007\/s10462-019-09704-9","article-title":"Bird swarm algorithms with chaoticmapping","volume":"53","author":"Varol","year":"2020","journal-title":"Artificial Intelligence Review"},{"issue":"12","key":"10.3233\/JIFS-223827_ref50","doi-asserted-by":"crossref","first-page":"5123","DOI":"10.1007\/s13369-016-2200-9","article-title":"Chaotic league championship algorithms","volume":"41","author":"Bingol","year":"2016","journal-title":"Arabian Journal for Science and Engineering"},{"issue":"2018","key":"10.3233\/JIFS-223827_ref51","first-page":"49","article-title":"MPSO: Modified particle swarm optimization andits applications","volume":"41","author":"Tian","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.3233\/JIFS-223827_ref52","doi-asserted-by":"crossref","first-page":"106924","DOI":"10.1016\/j.knosys.2021.106924","article-title":"A stochastic configuration network based onchaotic sparrow search algorithm","volume":"220","author":"Zhang","year":"2021","journal-title":"Knowledge-Based Systems"},{"issue":"4","key":"10.3233\/JIFS-223827_ref53","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s11334-021-00385-8","article-title":"Shared memory implementation andperformance analysis of LSB steganography based on chaotic tent map","volume":"17","author":"Gambhir","year":"2021","journal-title":"Innovations in Systems and Software Engineering"},{"issue":"4","key":"10.3233\/JIFS-223827_ref54","doi-asserted-by":"crossref","first-page":"012132","DOI":"10.1088\/1742-6596\/1141\/1\/012132","article-title":"Combined logistic and tent map","volume":"1141","author":"Lawnik","year":"2018","journal-title":"Journal of Physics Conference"},{"issue":"2021","key":"10.3233\/JIFS-223827_ref55","first-page":"30","article-title":"Prediction of dynamic deformation development ofsoil using Gompertz curve","volume":"36","author":"Chen","journal-title":"Vibroengineering Procedia"},{"issue":"4","key":"10.3233\/JIFS-223827_ref56","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.3390\/s21041224","article-title":"A Modified Sparrow Search Algorithmwith Application in 3d Route Planning for UAV","volume":"21","author":"Liu","year":"2021","journal-title":"Sensors"},{"key":"10.3233\/JIFS-223827_ref57","doi-asserted-by":"crossref","first-page":"114887","DOI":"10.1016\/j.eswa.2021.114887","article-title":"Symbiotic organisms search algorithmusing random walk and adaptive Cauchy mutation on the featureselection of sleep staging","volume":"176","author":"Miao","year":"2021","journal-title":"Expert Systems with Applications"},{"issue":"21","key":"10.3233\/JIFS-223827_ref58","first-page":"87","article-title":"Optimization and application of Cauchymutation camel algorithm","volume":"57","author":"Ren","year":"2021","journal-title":"Computer Engineering and Applications"},{"issue":"3","key":"10.3233\/JIFS-223827_ref59","doi-asserted-by":"crossref","first-page":"106628","DOI":"10.1016\/j.knosys.2020.106628","article-title":"An improved LSHADE-RSP algorithm with theCauchy perturbation: iLSHADE-RSP","volume":"215","author":"Choi","year":"2021","journal-title":"Knowledge-Based Systems"},{"issue":"3","key":"10.3233\/JIFS-223827_ref60","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.3233\/IFS-141388","article-title":"A novel mutation differential evolutionfor global optimization","volume":"28","author":"Yu","year":"2015","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"issue":"3","key":"10.3233\/JIFS-223827_ref61","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.neucom.2015.11.018","article-title":"Opposition-based krill herd algorithm with Cauchy mutation and position clamping","volume":"177","author":"Wang","year":"2016","journal-title":"Neurocomputing"},{"issue":"2","key":"10.3233\/JIFS-223827_ref62","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","article-title":"Evolutionary programming made faster","volume":"3","author":"Yao","year":"1999","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.3233\/JIFS-223827_ref63","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.knosys.2015.07.006","article-title":"Moth-flame optimization algorithm: A novelnature-inspired heuristic paradigm","volume":"89","author":"Mirjalili","year":"2015","journal-title":"Knowledge-Based Systems"},{"issue":"1","key":"10.3233\/JIFS-223827_ref64","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial onthe use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Joaqu\u0131n","year":"2011","journal-title":"Swarm & Evolutionary Computation"},{"issue":"3","key":"10.3233\/JIFS-223827_ref65","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop bytabu search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Annals of Operations research"},{"issue":"6","key":"10.3233\/JIFS-223827_ref66","doi-asserted-by":"crossref","first-page":"2926","DOI":"10.1016\/j.jksuci.2020.09.004","article-title":"Hybrid brain storm optimization algorithm and late acceptance hill climbing to solvethe flexible job-shop scheduling problem","volume":"34","author":"Alzaqebah","year":"2020","journal-title":"Journal of King Saud University-Computer and Information Sciences"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-223827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:45:22Z","timestamp":1777455922000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-223827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,1]]},"references-count":60,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/jifs-223827","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,1]]}}}