This study presents a hunting search based optimum design algorithm for engineering optimization problems. Hunting search algorithm is an optimum design method inspired by group hunting of animals such as wolves, lions, and dolphins. Each of these hunters employs hunting in a different way. However, they are common in that all of them search for a prey in a group. Hunters encircle the prey and the ring of siege is tightened gradually until it is caught. Hunting search algorithm is employed for the automation of optimum design process, during which the design variables are selected for the minimum objective function value controlled by the design restrictions. Three different examples, namely welded beam, cellular beam and moment resisting steel frame are selected as numerical design problems and solved for the optimum solution. Each example differs in the following ways: Unlike welded beam design problem having continuous design variables, steel frame and cellular beam design problems include discrete design variables. Moreover, while the cellular beam is designed under the provisions of BS 5960, LRFD-AISC (Load and Resistant Factor Design-American Institute of Steel Construction) is considered for the formulation of moment resisting steel frame. Levy Flights is adapted to the simple hunting search algorithm for better search. For comparison, same design examples are also solved by using some other well-known search methods in the literature. Results reveal that hunting search shows good performance in finding optimum solutions for each design problem.