Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Leveraging Large Language Model to Generate a Novel Metaheuristic Algorithm with CRISPE Framework (2403.16417v1)

Published 25 Mar 2024 in cs.NE

Abstract: In this paper, we borrow the LLM ChatGPT-3.5 to automatically and quickly design a new metaheuristic algorithm (MA) with only a small amount of input. The novel animal-inspired MA named zoological search optimization (ZSO) draws inspiration from the collective behaviors of animals for solving continuous optimization problems. Specifically, the basic ZSO algorithm involves two search operators: the prey-predator interaction operator and the social flocking operator to balance exploration and exploitation well. Besides, the standard prompt engineering framework CRISPE (i.e., Capacity and Role, Insight, Statement, Personality, and Experiment) is responsible for the specific prompt design. Furthermore, we designed four variants of the ZSO algorithm with slight human-interacted adjustment. In numerical experiments, we comprehensively investigate the performance of ZSO-derived algorithms on CEC2014 benchmark functions, CEC2022 benchmark functions, and six engineering optimization problems. 20 popular and state-of-the-art MAs are employed as competitors. The experimental results and statistical analysis confirm the efficiency and effectiveness of ZSO-derived algorithms. At the end of this paper, we explore the prospects for the development of the metaheuristics community under the LLM era.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (52)
  1. doi:10.1109/MC.2022.3192720.
  2. doi:10.1145/3531146.3533077.
  3. arXiv:2307.08272.
  4. arXiv:2302.13971.
  5. arXiv:2304.15010.
  6. arXiv:2102.12092.
  7. arXiv:2204.13807.
  8. OpenAI, Gpt-4 technical report (2023). arXiv:2303.08774.
  9. doi:10.1145/3490099.3511105.
  10. arXiv:2303.09014.
  11. arXiv:2303.02155.
  12. doi:10.1038/s41591-023-02448-8.
  13. doi:10.3390/biomimetics8060454.
  14. doi:10.1007/s13369-021-06208-z.
  15. doi:https://doi.org/10.1016/j.aej.2023.12.028.
  16. doi:https://doi.org/10.1111/exsy.12956.
  17. doi:10.1007/s10489-022-03397-4.
  18. doi:https://doi.org/10.1016/j.neucom.2023.02.010.
  19. doi:https://doi.org/10.1007/s40747-022-00957-6.
  20. doi:10.1109/4235.585893.
  21. doi:10.1007/s11721-021-00202-9.
  22. doi:10.1038/s42256-022-00516-1.
  23. doi:10.1126/science.adi1778.
  24. doi:10.1145/3583133.3596401.
  25. arXiv:2310.12541.
  26. arXiv:2311.15249.
  27. arXiv:2310.19046.
  28. doi:https://doi.org/10.1016/j.sysarc.2023.102871.
  29. T. Nguyen, A framework of optimization functions using numpy (opfunu) for optimization problems (2020). doi:10.5281/zenodo.3620960.
  30. doi:10.1007/s00521-022-07530-9.
  31. N. V. Thieu, Enoppy: A python library for engineering optimization problems (may 2023). doi:10.5281/zenodo.7953206.
  32. doi:https://doi.org/10.1155/2021/8548639.
  33. doi:10.1109/ICNN.1995.488968.
  34. doi:10.1023/A:1008202821328.
  35. doi:10.1162/106365603321828970.
  36. doi:https://doi.org/10.1016/j.advengsoft.2013.12.007.
  37. doi:https://doi.org/10.1016/j.knosys.2015.07.006.
  38. doi:10.5267/j.ijiec.2015.8.004.
  39. doi:https://doi.org/10.1016/j.knosys.2015.12.022.
  40. doi:https://doi.org/10.1016/j.advengsoft.2016.01.008.
  41. doi:https://doi.org/10.1016/j.future.2019.02.028.
  42. doi:https://doi.org/10.1016/j.cie.2021.107250.
  43. doi:10.1007/s10489-020-01893-z.
  44. doi:https://doi.org/10.1016/j.cma.2020.113609.
  45. doi:10.3390/biomimetics7040204.
  46. doi:https://doi.org/10.1016/j.eswa.2022.116924.
  47. doi:10.1007/s10489-022-03533-0.
  48. doi:10.1038/s41598-022-27344-y.
  49. doi:10.1007/s10489-022-03994-3.
  50. doi:10.1007/s00521-023-08261-1.
  51. doi:https://doi.org/10.1016/j.knosys.2022.110011.
  52. doi:https://doi.org/10.1016/S0045-7825(01)00323-1.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Rui Zhong (20 papers)
  2. Yuefeng Xu (3 papers)
  3. Chao Zhang (907 papers)
  4. Jun Yu (232 papers)
Citations (6)