How to conduct automated business negotiation over the Internet is an important issue for agent research. In most bilateral negotiation models, two negotiation agents negotiate by sending proposals and counterproposals back and forth. Proposals and counterproposals usually use a set of negotiation primitives to define the contents. These primitives deal with complete proposals or the whole nego...

In this study, the multi-objective optimization of an indirect forced-circulation solar water heating (SWH) system was performed to obtain the optimal configuration that minimized the life cycle cost (LCC) and maximized the life cycle net energy saving (LCES). An elitist non-dominated sorting genetic algorithm (NSGA-II) was employed to obtain the Pareto optimal solutions of the multi-objective ...

To reduce adverse impact potential and improve diversity outcomes from personnel selection, one promising technique is De Corte, Lievens, and Sackett's (2007) Pareto-optimal weighting strategy. De Corte et al.'s strategy has been demonstrated on (a) a composite of cognitive and noncognitive (e.g., personality) tests (De Corte, Lievens, & Sackett, 2008) and (b) a composite of specific cognitive ...

Obtaining a fullest possible representation of solutions to a multiobjective optimization problem has been a major concern in Multi-Objective Genetic Algorithms (MOGAs). This is because a MOGA, due to its very nature, can only produce a discrete representation of Pareto solutions to a multiobjective optimization problem that usually tend to group into clusters. This paper presents a new MOGA, o...

Since the beginning of Nineties, research and application of multi-objective evolutionary algorithms (MOEAs) have found increasing attention. This is mainly due to the ability of evolutionary algorithms to find multiple Pareto-optimal solutions in one single simulation run. In this paper, we present an overview of the multi-objective evolutionary algorithms and then discuss a particular algorit...

When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropriate search directions for genetic search. In our MOGA, a weight value for each objective in a scalar fitness function was randomly specified. Based on the fitness function with the randomly specified weight values, a ...

The proposed methodology is based on efficient clustering technique for facilitating the decision-maker in the analysis of the solutions of multi-objective problems .Choosing a solution for system implementation from the Pareto-optimal set can be a difficult task, generally because Pareto-optimal sets can be extremely large or even contain an infinite number of solutions. The proposed technique...

A wind turbine transformer (WTT) is designed using a 3D wound core while the transformer’s total owning cost (TOC) and its inrush current performance realized as the two objective functions in a multi-objective optimization process. Multi-objective genetic algorithm is utilized to derive Pareto optimal solutions. The effects of inrush current improvement on other operating and design parameters...

Multi-objective evolutionary algorithms frequently use an archive of non-dominated solutions to approximate the Pareto front. We show that the truncation of this archive to a limited number of solutions can lead to oscillating and shrinking estimates of the Pareto front. New data structures to permit efficient query and update of the full archive are proposed, and the superior quality of fronta...

This paper proposes a novel approach to generate a uniform distribution of the optimal solutions along the Pareto frontier. We make use of a standard mathematical technique for optimization namely line search and adapt it so that it will be able to generate a set of solutions uniform distributed along the Pareto front. To validate the method, numerical bi-criteria examples are considered. The m...