Abstract
In recent decades, the significance of multi-objective problems has grown substantially. One of the most popular methods for solving these problems involves the construction of Pareto sets. Pareto sets are exponentially sized relative to the input size of the problem, and so the need to reduce, or at least order, them arises. This work proposes the order of Pareto solutions by Borda count, an approach that makes use of ranking methods to establish preferences among the optimal solutions. To evaluate the proposed approach, a comparative study is conducted, evaluating its performance in comparison to other widely used and well-established methods within this domain. Finally, a case study with real-world data is used to show how the methodology works.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
