We provide a local convergence analysis for Newton-like methods for the solution of generalized equations in a Banach space setting. Using some ideas of ours introduced in [2] for nonlinear equations we show that under weaker hypotheses and computational cost than in [7] a larger convergence radius and finer error bounds on the distances involved can be obtained.