This paper introduces a method for solving multi-objective optimization problems in uncertain environment. When the uncertainty factors of the optimization problem can be included into the mathematical model, through bounded intervals, [I]RMOA (Interval Robust Multi-objective Algorithm) can find an enclosure of the robust Pareto frontier. In this approach, the robust Pareto solutions are the on...

This work presents a new evolutionary approach to searching for a global solution (in the Pareto sense) to multiobjective optimisation problem. Novelty of the method proposed consists in the application of an evolutionary multi-agent system (EMAS) instead of classical evolutionary algorithms. Decentralisation of the evolution process in EMAS allows for intensive exploration of the search space,...

This work introduces a new evolutionary approach to search for a global solution to multiobjective optimisation problem in the Pareto sense. Novelty of the proposed method consists in application of an evolutionary multi-agent system (EMAS) instead of classical evolutionary algorithms. Decentralisation of the evolution process in EMAS allows for intensive exploration of the search space and eff...

According to the axiomatic foundations of social choice theory, not all decisions benefit everyone. Often, that do have any implied for decision maker are made in (best) interests others. When a is concerning welfare others, some individuals - including maker, may be on receiving end. For, it impossible make by taking into account individual preferences satisfy and This because great variety ch...

Pareto frontiers of bicriteria continuous convex problems can be efficiently computed and optimal theoretical performance bounds have been established. In the case mixed-integer problems, approximation frontier becomes, however, significantly harder. this paper, we propose a new algorithm for approximating programs with constraints. Such are composed patches solutions shared assignments discret...