in this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. two objective functions, real power loss and energy not supplied index (ens), were utilized. multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...

In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...

The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...

In this paper, a bi-objective pharmaceutical supply chain network under uncertainty demand and transportation costs is modeled and developed. To control the uncertainty parameters, the robust optimization method is considering. The main objective of this paper determines the number and location of potential facilities such as drug manufacture centers and drug distribution centers by considering...

Bi-objective optimization of the availability allocation problem in a series–parallel system with repairable components is aimed in this paper. The two objectives of the problem are the availability of the system and the total cost of the system. Regarding the previous studies in series–parallel systems, the main contribution of this study is to expand the redundancy allocation problems to syst...

Goals: understand why hypervolume-based search is that successful understand basic properties of hypervolume indicator Approach: rigorous running time analyses of a hypervolume-based MOEA for (i) approaching the Pareto front (ii) approximating large Pareto fronts (unary) hypervolume indicator (A) = hypervolume/area of dominated part of search space between front A and reference point Pareto-dom...

Evolutionary optimization algorithms have been used to solve multiple objective problems. However, most of these methods have focused on search a sufficient Pareto front, and no efforts are made to explore the diverse Pareto optimal solutions corresponding to a Pareto front. Note that in semi-obnoxious facility location problems, diversifying Pareto optimal solutions is important. The paper the...

Algorithmic fairness seeks to identify and correct sources of bias in machine learning algorithms. Confoundingly, ensuring often comes at the cost accuracy. We provide formal tools this work for reconciling fundamental tension algorithm fairness. Specifically, we put use concept Pareto optimality from multiobjective optimization seek fairness-accuracy front a neural network classifier. demonstr...