Research Article

Using MOPSO for Optimizing Randomized Response Schemes in Privacy Computing

Algorithm 1

Discrete MOPSO for optimizing for RR matrices.
Input: Parameters of , , , ,
Output: Final optimal set repository.
Step  1. Initialization:
Do
Step  1.1. Initialization in particles of position POS, Velocity VEL, PBEST,
GBEST;
Step  1.2. Initialization in repository REP;
Step  1.3. Initialization in mutation archive ARC;
Step  1.4. Check constraints:
(1) Each column in POS is bounded by ;
(2) Sum of each column in POS is 1;
(3) Determinant of POS cannot be 0.
While constraints cannot be satisfied simultaneously, return to Step  1.1.
Step  2. Repeat:
Step  2.1. Updating VEL and POS for each particle according to velocity
updating mechanism and check constraints for new POS as Step  1.1;
Step  2.2. Calculate fitness under evaluation function for each particle and update
PBEST and GBEST;
Step  2.3. Update REP by Pareto dominance and hyper-volume respectively;
Step  2.4. Mutation is operated on ARC while . Two strategies of mutation
percentage is set to 1/3 and guided-random mechanism is a partial imitation of
GBEST in REP under boundary constraints;
Step  3. Termination:
If stopping criterion is achieved, halt and check the combination of REP and
ARC by Pareto dominance. Output the final optimal RR matricesfrom REP and ARC;
Otherwise, loop to Step  2.