List of Articles -محدودیت

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Modified ε-constraint method for bi-objective optimization: Reduce computational complexity and increase efficiency
  Armin Ghane Kanafi
  One of the effective method for solving the multi-objective optimization problems is the ε-constraint method which, unlike the weighted sum method is able to find non-dominated points in non-convex parts of the non-dominated frontier. The main disadvantages of t More

  One of the effective method for solving the multi-objective optimization problems is the ε-constraint method which, unlike the weighted sum method is able to find non-dominated points in non-convex parts of the non-dominated frontier. The main disadvantages of this method are finding similar non-dominated points for choosing different parameters and thus increasing the computational complexity of the algorithm and reducing its overall performance, which is not cost-effective in terms of time and cost. In this paper, a modified is made to ε-constraint method, which, due to the intelligence of the algorithm, the unnecessary areas that lead to the production of the same non-dominated points are eliminated from the beginning. Therefore, additional computational efforts are eliminated to produce the same non-dominated points. Discussions and details of the proposed method, with its algorithm, are presented and in the numerical examples section, the efficiency of the proposed method is compared with the ε-constraint method. Manuscript profile