Abstract
In this paper a new search strategy for multi-objective optimization (MOO) with constraints is proposed based on a hybrid search mode (HSM). The search processes for feasible solutions and optimal solutions are executed in a mixed way for the existing methods. With regard to HSM, a hybrid search mode is proposed, which consists of two processes: Feasibility search mode (FSM) and optimal search mode (OSM). The executions of these two search modes are independent relatively and also adjusted according to the population distribution. In the early stage, FSM plays the leading role for exploring the feasible space since most of the individuals are infeasible. With the increase of the feasible individuals, OSM is the primary operation for the search of optimal individuals. The proposed method is simple to implement and need few extra parameter tuning. The handing method of constraints is tested on several multi-objective optimization problems with constraints. The remarkable results demonstrate its effectiveness and good performance.
Reference16 articles.
1. A fast and elitist multiobjective genetic algorithm: NSGA-II
2. A Monte Carlo Enhanced PSO Algorithm for Optimal QoM in Multi-Channel Wireless Networks
3. Kennedy J and Eberhart R, “Particle swarm optimization,” In Proceedings os IEEE International Conference on Neural Networks, 1995, pp. 1942–1948.
4. Harada K, Sakuma J, Ono I, and Kobayashi S, “Constraint-handling method for multi-objective function optimization: Pareto descent repair operator,” In Proc. Int. Conf. Evol. Multi-Criterion Opt., Matshushima, Japan, 2007, pp. 156–170.
5. Young N, “Blended ranking to cross infeasible regions in constrained multi-objective problems,” in Proc. Int. Conf. Comput. Intell. Modeling, Control and Automation, and Int. Conf. Intell.Agents, Web Technologies and Internet Commerce, Sydney, Australia. 2005. pp. 191–196.