In this research report, the author proposes two new evolutionary approaches to Multiobjective Optimization Problems (MOPs)— Dynamic Particle Swarm Optimization (DPSMO) and Dynamic Particle Swarm Evolutionary Algorithm (DPSEA). In DPSMO, instead of using genetic operators (e.g., crossover and mutation), the information sharing technique in Particle Swarm Optimization is applied to inform the en...

In decision-theoretic planning problems, such as (partially observable) Markov decision problems [Wiering and Van Otterlo, 2012] or coordination graphs [Guestrin et al., 2002], agents typically aim to optimize a scalar value function. However, in many real-world problems agents are faced with multiple possibly conflicting objectives, e.g., maximizing the economic benefits of timber harvesting w...

We propose a new algorithm of computation using particle swarm in order to solve multi-objective problems more quickly and e ectively. This approach, called accelerated multi-objective particle swarm, is partially based on our previous work [4] and incorporates a vector function as objective function and it uses matrix computation to develop the Pareto front. Unlike all these studies which use ...

A novel approach is presented in this article for obtaining inverse mapping of thermodynamically Pareto-optimized ideal turbojet engines using group method of data handling (GMDH)-type neural networks and evolutionary algorithms (EAs). EAs are used in two different aspects. Firstly, multi-objective EAs (non–dominated sorting genetic algorithm-II) with a new diversity preserving mechanism are us...

It has been increasingly reported that the multiobjective optimization evolutionary algorithm based on decomposition (MOEA/D) is promising for handling multiobjective optimization problems (MOPs). MOEA/D employs scalarizing functions to convert an MOP into a number of single-objective subproblems. Among them, penalty boundary intersection (PBI) is one of the most popular decomposition approache...

Multi-Cluster Very Long Instruction Word (VLIW) architectures are currently designed by using platform-based synthesis techniques. In these approaches, a wide range of platform parameters are tuned to find the best trade-offs in terms of the selected figures of merit (such as energy, delay and area). This optimization phase is called Design Space Exploration (DSE) and it generally consists of a...

Pareto optimization combines independent objectives by computing the Pareto front of its search space, defined as the set of all candidates for which no other candidate scores better under both objectives. This gives, in a precise sense, better information than an artificial amalgamation of different scores into a single objective, but is more costly to compute. We define a general Pareto produ...

In this paper we propose the multi-objective contextual bandit problem with similarity information. This problem extends the classical contextual bandit problem with similarity information by introducing multiple and possibly conflicting objectives. Since the best arm in each objective can be different given the context, learning the best arm based on a single objective can jeopardize the rewar...

Optimal Experiment Design for parameter estimation in water networks has been traditionally formulated to maximize either hydraulic model accuracy or spatial coverage. Because a unique sensor configuration that optimizes both objectives may not exist, these approaches inevitably result sub-optimal configurations with respect one of the objectives. This paper presents new bi-objective optimizati...

Evolutionary multiobjective optimization has become a very popular topic in the last few years. Since the 1980s, various evolutionary approaches that are capable of searching for multiple solutions simultaneously in a single run have been developed to solve multiobjective optimization problems (MOPs). However, to find a uniformly distributed, near-complete, and near-optimal Pareto front in a sm...