Abstract
In this paper, variational iteration method and Adomian decomposition are implemented to construct solitary solutions for variants of K(n, n) equation. In these schemes the solution takes the form of a convergent series with easily computable components. The chosen initial solution or trial function plays a major role in changing the physical structure of the solution. Comparison between the two methods is made and many models are approached. The obtained results reveal that the two methods are very effective and convenient for constructing solitary solutions.