A single-point local search method is presented as a simplification of the multiobjective tabu search. Some improvements are made to reach the Pareto front within small number of function evaluations. The performance of the proposed method is first verified by a small mathematical problem. It is shown that accurate Pareto optimal solutions with good diversity are obtained by using the proposed ...

Network reconfiguration is an alternative to reduce power losses and optimize the operation of power distribution systems. In this paper, an encoding scheme for evolutionary algorithms is proposed in order to search efficiently for the Pareto-optimal solutions during the reconfiguration of power distribution systems considering multiobjective optimization. The encoding scheme is based on the ed...

Design is a multi-objective decision-making process considering manufacturing, cost, aesthetics, usability among many other product attributes. The set of optimal solutions, the Pareto set, indicates the tradeoffs between objectives. Decision-makers generally select their own optima from the Pareto set based on personal preferences or other judgements. However, uncertainties from manufacturing ...

Evolutionary algorithms (EAs) have been well acknowledged as a promising paradigm for solving optimisation problems with multiple conflicting objectives in the sense that they are able to locate a set of diverse approximations of Pareto optimal solutions in a single run. EAs drive the search for approximated solutions through maintaining a diverse population of solutions and by recombining prom...

One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. For this aim, a multi-objective facility location allocation model is proposed. In this case, an integrated BDA and epsilon constraint method are proposed and it is shown that how P...

In design situations where a single solution must be selected, it is often desirable to present the designer with a smart Pareto set of solutions—a minimal set of nondominated solutions that sufficiently represents the tradeoff characteristics of the design space. These sets are generally created by finding many well-distributed solutions and then either filtering out the excess ones or searchi...

We address the problem of multi-objective constraint optimization problems (MO-COPs). Solving an MO-COP traditionally consists in computing the set of all Pareto solutions (i.e. the Pareto front). But this Pareto front is exponentially large in the general case. So this causes two main problems. First is the time complexity concerns. Second is a lack of decisiveness. In this paper, we present t...

When solving multiobjective optimization problems, there is typically a decision maker (DM) who is responsible for determining the most preferred Pareto optimal solution based on his preferences. To gain confidence that the decisions to be made are the right ones for the DM, it is important to understand the trade-offs related to different Pareto optimal solutions. We first propose a trade-off ...

The optimization of multiple conflictive objectives at the same time is a hard problem. In most cases, a uniform distribution of solutions on the Pareto front is the main objective. We propose a novel evolutionary multi-objective algorithm that is based on the selection with regard to equidistant lines in the objective space. The so-called rakes can be computed efficiently in high dimensional o...

This paper presents an approach to incorporate Pareto dominance into the differential evolution (DE) algorithm in order to solve optimization problems with more than one objective by using the DE algorithm. Unlike the existing proposals to extend the DE to solve multiobjective optimization problems, our algorithm uses an external archive to store nondominated solutions. In order to generate tri...