Most methods for finding interesting gene expression profiles from gene microarray data are based on a single discriminant, e.g. the classical paired t-test. Here a different approach is introduced based on gene ranking according to Pareto depth in multiple discriminants. The novelty of our approach, which is an extension of our previous work on Pareto front analysis (PFA), is that a gene’s rel...

Contemporary evolutionary multiobjective optimisation techniques are becoming increasingly focussed on the notions of archiving, explicit diversity maintenance and population-based Pareto ranking to achieve good approximations of the Pareto front. While it is certainly true that these techniques have been effective, they come at a significant complexity cost that ultimately limits their applica...

We address the problem of optimizing a spacecraft trajectory by using three different multi-objective evolutionary algorithms: i) Non-dominated sorting genetic algorithm, ii) Pareto-based ranking genetic algorithm, and iii) Strength Pareto genetic algorithm. The trajectory of interest is an orbit transfer around a central body when the spacecraft uses a lowthrust propulsion system. We use a Lya...

The massive scale and variability of microarray gene data creates new and challenging problems of signal extraction, gene clustering, and data mining, especially for temporal gene profiles. Many data mining methods for finding interesting gene expression patterns are based on thresholding single discriminants, e.g. the ratio of between-class to within-class variation or correlation to a templat...

This paper discusses the implementation of local search in evolutionary multiobjective optimization (EMO) algorithms for the design of a simple but powerful memetic EMO algorithm. First we propose a basic framework of our memetic EMO algorithm, which is a hybrid algorithm of the NSGA-II and local search. In the generation update procedure of our memetic EMO algorithm, the next population is con...

Post-Pareto Optimality Analysis to Efficiently Identify Promising Solutions for Multi-Objective Problems Heidi A. Taboada and David W. Coit Department of Industrial and Systems Engineering, Rutgers University, 96 Frelinghuysen Rd. Piscataway, NJ 08854, USA ABSTRACT: Techniques have been developed and demonstrated to efficiently identify particularly promising solutions from among a Pareto-optim...

The purpose of this note– inspired by and using a number of properties from Barbara and Jackson [2] – is to characterize the Pareto dominance relation. The set-up and interpretation is completely analogous to [2]. In particular, situations are considered where different actions are to be compared on the basis of their consequences, which are described by vectors of real numbers. Ranking actions...

A genetic algorithm for multiobjective optimization is presented which tries to evolve an evenly distributed set of solutions belonging to the Pareto set by: (i) ranking the population according to nondomination properties; (ii) defining a filter to retain Pareto set solutions and (iii) using adequate operators: exclusion, addition and single-objective operator which improves the individuals fr...

A tabu search algorithm is proposed for finding the Pareto solutions of multiobjective optimal design problems. In this paper, the contact theorem is used to evaluate the Pareto solutions. The ranking selecting approach and the fitness sharing function are also introduced to identify new current points to begin every iteration cycle. Detailed numerical results are reported in this paper to demo...