In this paper, several new set quality metrics are introduced that can be used to evaluate the “goodness” of an observed Pareto solution set. These metrics, which are formulated in closed-form and geometrically illustrated, include hyperarea difference, Pareto spread, accuracy of an observed Pareto frontier, number of distinct choices and cluster. The metrics should enable a designer to either monitor the quality of an observed Pareto solution set as obtained by a multiobjective optimization method, or compare the quality of observed Pareto solution sets as reported by different multiobjective optimization methods. A vibrating platform example is used to demonstrate the calculation of these metrics for an observed Pareto solution set.

No abstract

A massively parallel Genetic Algorithm (GA) has been applied to RNA sequence folding on three different computer architectures. The GA, an evolution-like algorithm that is applied to a large population of RNA structures based on a pool of helical stems derived from an RNA sequence, evolves this population in parallel. The algorithm was originally designed and developed for a 16384 processor SIMD (Single Instruction Multiple Data) MasPar MP-2. More recently it has been adapted to a 64 processor MIMD (Multiple Instruction Multiple Data) SGI ORIGIN 2000, and a 512 processor MIMD CRAY T3E. The MIMD version of the algorithm raises issues concerning RNA structure data-layout and processor communication. In addition, the effects of population variation on the predicted results are discussed. Also presented are the scaling properties of the algorithm from the perspective of the number of physical processors utilized and the number of virtual processors (RNA structures) operated upon.

No abstract

No abstract