Flavoring search algorithm with applications to engineering optimization problems and robot path planning

In this paper, a human-based meta-heuristic algorithm, the Flavoring Search Algorithm, is proposed and mathematically modeled with the aim of providing an alternative optimization method for solving practical engineering problems. Flavoring Search Algorithm is inspired by the human behavior of flavoring in everyday life, including basic flavoring, formal flavoring, and auxiliary flavoring. By introducing a unique taste factor, it not only succeeded in making the FSA correspond to the real flavoring process but also balanced the exploration and exploitation of the algorithm. With the help of the taste factors, Flavoring Search Algorithm performs basic flavoring (initial flavoring and random flavoring) in the exploration phase and formal flavoring and auxiliary flavoring in the exploitation phase. In addition, theoretical analysis and experiments have led to the conclusion that the taste factor can be used as an effective and practical new threshold conversion mechanism for meta-heuristic algorithms. This study also establishes a Markov model to rigorously analyze the Flavoring Search Algorithm as a globally convergent algorithm from a mathematical point of view. Through experimental and analytical comparisons with other excellent optimizers on 30 test functions, as well as on 3 real-world engineering design problems and 1 path planning problem. The results show that the Flavoring Search Algorithm generally outperforms the tested competitors in solving benchmark functions and engineering problems, validating the utility of the proposed optimizer in solving challenging real-world problems.