Initialize parameters: Number of bees n and Maximum Iteration; While Maximum Iteration is not met do Initialize the car pool of every bee b Gb /0; Initialize the current solution Scur /0; Initialize the current set of users not yet pooled Ucur U; Repeat Select randomly a new user u; NCu the car capacity of user u; For every bee b dof Insert u into Gb and eliminate it from Ucur;g j 1; While ( j < NCu)dof (a) The forward pass For every bee b dof Evaluate all unserved users in Ucur; Choose an unserved user i who satisfies constraints using the roulette wheel selection based on probability Pi j(16); Insert user i into Gb and eliminate it from Ucur;g (b)The backward pass For every bee b dof Every bee decides randomly whether to continue its own exploration and becomes recruiter, or to become uncommitted; If (b is uncommitted) then Randomly chooses a recruiter to follow;g j j+1;g Find the best pool Gbestu from all pools Gb; Scur Scur S Gbestu; Until all users are clustered; Update the best solution; End Output the best solution; any one can please implement this pSudo code with Java or python ?