Numerous multi-objective evolutionary algorithms have recently been proposed for the leader selection or archive maintenance process via using reference sets. Despite the potential of this strategy has been demonstrated in the existing literatures, a significant drawback is that this methodology requires additional parameters or predefined reference points, which leads to increasing the complexity in real-world applications and reducing the versatility in addressing various optimization challenges. Novel to this study, a new convergence contribution (CC) evaluator without extra parameters and predefined reference points is presented for convergence evaluation, where the inspiration is drawn from the concept of an ideal point on a Pareto front and the divide-and-conquer technique. Specifically, the local ideal points are introduced in this paper by dynamically fabricating from the approximate Pareto front. Furthermore, the CC evaluator and parallel cell distance (PCD) are cooperatively integrated into a multi-objective particle swarm optimization (MOPSO/CP) to enhance both the global best solution selection and archive maintenance strategies. Comparative experiments on 21 benchmark test functions exhibited that the performances in terms of inverted generational distance and hypervolume of the proposed MOPSO/CP was the best among those of the chosen competitive algorithms. The significant role of the cooperative mechanism and the CC evaluator is further verified by ablation studies. The superiority of the designed algorithm against its competitors is unequivocally highlighted by the experimental results.