A new random group search algorithm for solving the multi-objective programming problems
Jinxia Wu · Journal of Liaoning Normal University · 2007
A new random group search algorithm is proposed for solving the multi-objective programming problems with box constraints.In this algorithm,N sample points are randomly selected in the feasible region,each sample points is regarded as the charged particle,according to the different objective function to define its charge.Based on the principle of electromagnetism,we calculate total force for each sample point under different objective function.Then,all of the point total forces are linearly weighted as the point search direction to seek new sample points.Finally,the algorithm is applied to two examples,and compare to GA and SA.The numerical results show that the algorithm is feasible and effective.