| description abstract | Multi-objective optimization (MOO) problems are encountered in many applications, of which bi-objective problems are frequently met. Despite the computational efforts, the quality of the Pareto front is also a considerable issue. An evenly distributed Pareto front is desirable in certain cases when a continuous representation of the Pareto front is needed. In this paper, a new approach called circle intersection (CI) is proposed. First, the anchor points are computed. Then in the normalized objective space, a circle with a proper radius of r centering at one of the anchor points or the latest obtained Pareto point is drawn. Interestingly, the intersection of the circle and the feasible boundary can be determined whether it is a Pareto point or not. For a convex or concave feasible boundary, the intersection is exactly the Pareto point, while for other cases, the intersection can provide useful information for searching the true Pareto point even if it is not a Pareto point. A novel MOO formulation is proposed for CI correspondingly. Sixteen examples are used to demonstrate the applicability of the proposed method and results are compared to those of normalized normal constraint (NNC), multi-objective grasshopper optimization algorithm (MOGOA), and non-dominated sorting genetic algorithm (NSGA-II). Computational results show that the proposed CI method is able to obtain a well-distributed Pareto front with a better quality or with less computational cost. | |
