سیویلیکا را در شبکه های اجتماعی دنبال نمایید.

A Computational Algorithm Based on Normalization for Constructing the Pareto Front of Multiobjective Optimization Problems

Publish Year: 1398
Type: Conference paper
Language: English
View: 517

متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دانلود نمایند.

Export:

Link to this Paper:

Document National Code:

ICISE05_095

Index date: 28 September 2019

A Computational Algorithm Based on Normalization for Constructing the Pareto Front of Multiobjective Optimization Problems abstract

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.

A Computational Algorithm Based on Normalization for Constructing the Pareto Front of Multiobjective Optimization Problems Keywords:

A Computational Algorithm Based on Normalization for Constructing the Pareto Front of Multiobjective Optimization Problems authors

Behzad Pirouz

Department of Mathematics Islamic Azad University Karaj, Iran

Javaher Ramezani Paschapari

Department of Management Islamic Azad University Rasht, Iran