Finding the overall Pareto optimal front while addressing the effect of an increasing number of objectives has become an essential and challenging issue for multiobjective optimization in real-world applications. Preference information provided by a decision maker can guide the search for preferred regions of the Pareto front and accelerate the convergence of the population. In this paper, a new variant of the Pareto dominance relation, called preference angle and reference information-based dominance, is proposed to create a stricter partial order among nondominated solutions. In the proposed method, the Euclidean distance and angle information between candidate solutions and reference points are calculated to evaluate the degree of convergence and population diversity, respectively. In addition, an adaptive threshold is designed to adjust the judgment condition of ar-dominance using an iterative process in a prespecified interval. The proposed algorithm increases the convergence speed of the population and reduces the number of solutions in the nonpreferred region. Comparative evaluation experiments are presented with respect to two performance metrics for a variety of benchmark test problems and real-world aluminum electrolytic production cases. The results demonstrate that the proposed approach is effective for highly complex, multiobjective optimization problems when compared with five state-of-the-art evolutionary algorithms.