چکیده مقاله
In this paper, we have presented a computational algorithm based on normalization for constructing the Pareto front PF in multi objective optimization problems MOP Some modifications of the epsilon constraint method were suggested by Ehrgott et al , by including slack and surplus variables in the formulation of this method In this paper, we replaced the unknown value of epsilon by a controllable step length such that the feasible set of the problem will be non empty The proposed algorithm is applied to some illustrative examples to demonstrate its computational efficiency
کلیدواژهها
Pareto front multi-objective optimization problem scalarization techniques computationally efficient algorithm. multi objective computationally efficient algorithm
نویسندگان
Behzad Pirouz
Department of Mathematics Islamic Azad University Karaj, Iran
Javaher Ramezani Paschapari
Department of Management Islamic Azad University Rasht, Iran
شیوه ارجاع
Pirouz, Behzad and Ramezani Paschapari, Javaher,1398,A Computational Algorithm Based on Normalization for Constructing the Pareto Front of Multiobjective Optimization Problems,5th International Conference on Industrial and Systems Engineering,Mashhad
ارائهشده در
مجموعه مقالات پنجمین کنفرانس بین المللی مهندسی صنایع و سیستمها (ICISE ۲۰۱۹)13 شهریور 1398 · مشهد