ABSTRACT
Hunting search algorithm (HuS) is one of the recent additions to the meta-heuristic search techniques of combinatorial optimization problems. This approach is based on the group hunting of animals such as lions, wolves and dolphins. The common part in the way of hunting of these animals is that they all hunt in a group. They encircle the prey and gradually tighten the ring of siege until they catch the prey. Each member of the group corrects its position based on its own position and the position of other members during this action. If a prey escapes from the ring, hunters reorganize the group to siege the prey again. The hunting search algorithm is based on the way as wolves hunt. The procedure involves a number of hunters which represents the hunting group are initialized randomly in the search space of an objective function. Each hunter represents a candidate solution of the optimum design problem. In this chapter we present: a brief introduction of the simple hunting search algorithm and it’s improvements, and numerical example with optimization of welded beam design problem.
