I am looking for Java expert for implement new local search algorithm

In the previous code there was two kind of local search Local search N1 ( move ) Local search N2 ( swap ) I want to add a new local search algorithm which has some similar components with the previous one The pseudo code of that local search is as follows: S= random Solution; While S is not local optimum ( the is no more improving move or swaps ) in term of F(S) do { S' = neighbor( S) ; If ( S' is feasible and g( S') > g( S *) ) S*=S'; If ( F( S') > F( S) ) S= S'; } F(S) = g (S) - ( à * Sum of violations) g ( S ) = ObjFun ( the same objective function of previous code ) à = parameter The randomness in the first code can be either feasible or infeasible in other words it can accept that the weights of node to be under the lower limit or above the upper limit of clusters This technique called local search with penalty which can accept the violation in the constraints of weights but with a penalty on the ObjFun