THE ALGORITHM OF FINDING PARETO-OPTIMAL SOLUTIONS FOR NEXT RELEASE PROBLEM

  • Євгеній Володимирович Берлізов Odessa National Polytechnic University
  • Віра Вікторівна Любченко Odessa National Polytechnic University

Abstract

We consider three versions of the algorithm of Pareto-front building for their application to the next release
problem based on the model of bi-objective optimization. It is shown that the algorithm of combinations enumeration
with filtering is the best algorithm accordingly of criteria of computation time and memory consumption.

Author Biographies

Євгеній Володимирович Берлізов, Odessa National Polytechnic University
Student
Віра Вікторівна Любченко, Odessa National Polytechnic University
doctor of technical sciences, professor
Published
2019-03-10
How to Cite
Берлізов, Є., & Любченко, В. (2019). THE ALGORITHM OF FINDING PARETO-OPTIMAL SOLUTIONS FOR NEXT RELEASE PROBLEM. Electrotechnic and Computer Systems, (19(95), 165-168. Retrieved from https://eltecs.op.edu.ua/index.php/journal/article/view/1888
Section
Information systems and technologies