In this investigation a new optimization algorithm named as interactive search algorithm (ISA) is presented. This method is developed through modifying and hybridizing the affirmative features of recently developed integrated particle swarm optimization (iPSO) algorithm with the pairwise knowledge sharing mechanism of the teaching and learning based optimization (TLBO) method. Proposed ISA provides two different navigation schemes as Tracking and Interacting. Each agent based on its tendency factor can pick one of these two schemes for searching the domain. Additionally, ISA utilizes an improved fly-back technique to handle problem constraints. The proposed method is tested on a set of mathematical and structural optimization benchmark problems with discrete and continuous variables. Numerical results indicate that the new algorithm is competitive with other well-stablished metaheuristic algorithms.