One of the SRA3's features is the ability to make adaptive parental selection. Its selection is based on the proportion of non-dominated solutions in the CA and DA archives. Specifically, first, the proportions \(p_c\)  and \(p_d\)  of non-dominated solutions in CA and DA archives are calculated separately, and if \(p_c\)  is greater than \(p_d\) , an individual is randomly selected from CA as parent 1, otherwise an individual is randomly selected from DA. Then, CA and DA are combined into a set S, and then the proportions \(\rho _c\)  and \(\rho _d\)  of the non-dominated solutions of CA and DA in S are evaluated separately. The proportion of \(\rho _c\)  in the sum of \(\rho _c\)  and \(\rho _d\)  determines whether parent 2 chooses from CA or DA, and the larger the proportion of \(\rho _c\) , the higher the probability of selecting an individual from CA as parent 2. After parental selection, simulated binary crossover (SBX) [1]} and polynomial mutation [2]} are used to generate offspring. The pseudo-code for adaptive parent selection and offspring generation are shown in Algorithm 2.
