To solve a constrained optimization problem with ABC algorithm, in my opinion, you can use Penalty approach for constraint violations. In this technique, a considerably higher value is added in objective function when constraint is violated. This method is much simpler and easy to implement. However, selection of penalty parameter is crucial and usually accomplished by trial and error..
You can use penalty method with all the soft computing techniques. This does not depend upon specific technique.if you know artificial bee colony. You can take the help about penalty function from nsga2 code which is available onnet