School Bus Routing Problem (SBRP) is one of the most applicable problems in Operations Research. This problem aims in finding an effectual schedule for school bus systems. In this schedule, each bus picks students up from diverse stations and takes them to their destination school in such a way that wide variety of constraints such as maximum capacity of each bus, maximum staying time of each student i bus, and appropriate delivery times hold. In this research, it is tried to perform some developments in the model consisting some real constraints and then an effective algorithm is proposed to solve the model. To do this, the problem is solved via two phases. During the first phase, using intelligent water drop algorithm, initial solutions population is achieved and in second phase initial solutions are conducted to optimal or near optimal solutions. During this phase, in order to have an appropriate conduction to optimality, some algorithms in the field of main and local search are defined. When designing the main search algorithm, we have utilized combinatorial approaches such as Electromagnetism-Genetic algorithm. Also when designing local search algorithms we have benefited iterated swap procedure (ISP) and some philosophies such as theory of constraint (TOC). Finally, the proposed method is run on a case study, a sample problem, and some other testing samples. Computational results demonstrate that the proposed approach has higher capabilities in contrast with other existing methods .