In multi-objective particle swarm optimization (MOPSO), a proper selection of local guides significantly influences detection of non-dominated solutions in the objective/solution space and, hence, the convergence characteristics towards the Pareto-optimal set. This paper presents an algorithm based on simple heuristics for selection of local guides in MOPSO, named as HSG-MOPSO (Heuristics-based...

In this paper, an interactive version of the ParEGO algorithm is introduced for identifying most preferred solutions for computationally expensive multiobjective optimization problems. It enables a decision maker to guide the search with her preferences and change them in case new insight is gained about the feasibility of the preferences. At each interaction, the decision maker is shown a subs...

A novel multi-objective evolutionary algorithm (MOEA) is developed based on Imperialist Competitive Algorithm (ICA), a newly introduced evolutionary algorithm (EA). Fast non-dominated sorting and the Sigma method are employed for ranking the solutions. The algorithm is tested on six well-known test functions each of them incorporate a particular feature that may cause difficulty to MOEAs. The n...

let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

This paper proposes various methods for constructing a compact fuzzy classification system consisting of a small number of linguistic classification rules. First we formulate a rule selection problem of linguistic classification rules with two objectives: to maximize the number of correctly classified training patterns and to minimize the number of selected rules. Next we propose three methods ...

Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

Method: A global search Particle Swarm Optimization (PSO) model is then established based on cluster analysis and grey theory. The three main operational mechanisms are: (1) an external repository to retain the optimal non-dominated solution set; (2) combined cluster analysis and grey theory to ensure a better distribution of the non-dominated solution search process; and (3) a virtual circle c...

This paper proposes a multi-objective model for the economic-statistical design of the variable sample size and sampling interval multivariate exponentially weighted moving average control chart by using double warning lines. The Markov chain approach is used to obtain the statistical properties. We extend the Lorenzen and Vance cost function considering multiple assignable causes and multivari...