This paper proposes a multiobjective harmony search (MOHS) algorithm for optimal power flow (OPF) problem. OPF problem is formulated as a nonlinear constrained multiobjective optimization problem where different objectives and different constraints have been considered. Fast elitist non dominated sorting and crowding distance have been used to find and manage the Pareto optimal front. Finally, ...

In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a...

This paper develops the team-building models under uncertainty of agents abilities described by Pareto distribution, and is organized as follows. At first, some properties of Pareto distribution required for further presentation are briefly discussed in Section 2. Then the solution of the team incentive problem is given in Section 3. Section 4 presents the team-building problem statement. Secti...

Multi-issue negotiation has been studied widely. Our work focuses on the important special case of negotiation with multiple interdependent issues, in which agent utility functions are nonlinear. In this paper, we propose a Distributed Mediator Protocol (DMP) for securely finding Pareto optimal agreements . We also propose a measure for selecting final agreements from the set of Pareto-optimal ...

Assembly line balancing is significant for efficient and cost effective production of the products and is therefore gaining popularity in recent years. However, several uncertain events in assembly lines might causes variation in the task time and due to these variations there always remains a possibility that completion time of tasks might exceed the predefined cycle time. To hedge against thi...

It is widely recognized that a Share Economy (SE) Pareto-dominates a FixedWage Economy (FWE) if unions care about employment. This begs the question, why profit sharing is less than ubiquitous. In this paper, we offer a solution to this conundrum by looking at particular transition arrangements from a FWE to a SE. We analytically show that despite the Pareto-dominance of a SE, the changeover fr...

In optimization problems with at least two conflicting objectives, a set of solutions rather than a unique one exists because of the trade-offs between these objectives. A Pareto optimal solution set is achieved when a solution cannot be improved upon without degrading at least one of its objective criteria. This study investigated the application of multi-objective evolutionary algorithm (MOEA...

We present a decision-making procedure, for a problem where no solution is known a priori. The decision-making procedure is a human powered genetic algorithm that uses human beings to produce variations and evaluate the partial solution proposed. Following [1] we then select the pareto front of the proposed partial solutions, eliminating the dominated ones. We then feed the results back to the ...

We consider general two-sided matching markets, so-called matching with contracts markets as introduced by Hatfield and Milgrom (2005), and analyze (Maskin) monotonic and Nash implementable solutions. We show that for matching with contracts markets the stable correspondence is monotonic and implementable (Theorems 1 and 3). Furthermore, any solution that is Pareto efficient, individually ratio...

We study environments where a production process is jointly shared by a finite group of agents. The social decision involves the determination of input contribution and output distribution. We define a competitive solution when there is decreasing-returns-to-scale which leads to a Pareto optimal outcome. Since there is a finite number of agents, the competitive solution is prone to manipulation...