A Comparative Study on Different Versions of Multi-Objective Genetic Algorithm for Simultaneous Gene Selection and Sample Categorization

This paper proposed a multiobjective genetic algorithm approach for solving process planning and scheduling (PPS) problems in a distributed manufacturing system (DMS) environment. In this environment, factories processing various machines and tools at different geographical locations are often combined to produce various parts with different resource constraints. This paper proposed a fast multiobjective genetic algorithm with archive (fmoGA‐A) mechanism to deal with PPS problem with considering the minimization of the maximum total processing time and minimization of the maximum variation of workload of machine in DMS. The proposed algorithm has been compared with other approaches to testify and benchmark the optimization reliability on several PPS problems. These comparisons demonstrate the importance of PPS in DMS and indicate fmoGA‐A is better than adaptive weight approach genetic algorithm (awaGA) did on efficacy and efficient; the efficacy is not less than non‐dominated sorting genetic algorithm II (NSGA‐II) and strength Pareto evolutionary algorithm 2 (SPEA2) and the efficient is better than NSGA‐II and SPEA2. Copyright © 2010 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

SummaryInternet of Things (IoT) is a platform which connects the objects through the Internet. The IoT devices have limited processing capabilities. This makes the processing and analyzing huge amount of data as a challenging task in IoT environment. Due to this disadvantage of IoT devices, it cannot be used in many useful applications where they are mostly required. Hence, a technique which helps in overcoming this disadvantage is mostly desired. One of the desired technologies is the cloud computing. The cloud computing has rich set of resources, and it is efficient in processing and analyzing data irrespective of its type and quantity. The services of the cloud will be provided by a cloud service provider (CSP). Selecting an appropriate cloud service provider is a major issue in an integrated environment of IoT and Cloud. Therefore, the focus of this paper is on cloud collaboration with IoT environment with suitable CSPs. A multi‐objective genetic algorithm to find the optimized solution is proposed in this paper. The Non‐dominated Sorting Genetic Algorithm 2 (NSGAII) and Strength Pareto Evolutionary Algorithm 2 (SPEA2) are used to analyze the performance of the proposed algorithm. The Profit Information (PI) to the individual and Trust Relationship (TR) value are considered as the objectives for selecting the CSPs. The results demonstrated that the proposed Multi‐objective Genetic Algorithm (MGA) algorithm along with NSGAII performs more efficiently than MGA algorithm with SPEA2.

This paper presents a new multi-objective optimization method, which is inspired from the idea of non-dominated sorting genetic algorithm (NSGA) and genetic quantum algorithm (GQA). The GQA has been tested on well known test beds in single objective optimization and compared with the genetic algorithm (GA) in the lead author’s previous work [22]. This paper aims to apply the idea of GQA to multi-objective optimization (MOO). The developed method is called non-dominated sorting genetic quantum algorithm (NSGQA). The developed method is tested with benchmark problems collected from literature, which have characteristics representing various aspects of a MOO problem. Test results show that NSGQA has better performance on most benchmark problems than currently popular MOO methods such as the NSGA. The integration of GQA with MOO, and the systematic comparison with other MOO methods on benchmark problems, should be of general interest to researchers on MOO and to practitioners using MOO methods in design.

Partition-and-merge based fuzzy genetic clustering algorithm for categorical data

A robust hybrid between genetic algorithm and support vector machine for extracting an optimal feature gene subset

This paper proposes a multi-objective structure for the optimization of an engine control unit mapping. In this way, first an integrated engine-vehicle model is developed. The objective functions for the optimization problem can be defined from this model. After describing the structure of the optimization problem, two different multi-objective genetic algorithms, namely distance-based Pareto genetic algorithm and non-dominated sorting genetic algorithm (together with entropy-based multi-objective genetic algorithm), are proposed and implemented. The results demonstrate the superiority of this computerized structure to the manual mapping methods and also more generality of the multi-objective methods compared to single-objective ones.

It is common knowledge that the optimal values of the calibrated parameters of a rainfall-runoff model for one model response may not be the optimal values for another model response. Thus, it is highly desirable to derive a Pareto front or trade-off curve on which each point represents a set of optimal values satisfying the desirable accuracy levels of each of the model responses. This paper presents a new genetic algorithm (GA) based calibration scheme, accelerated convergence GA (ACGA), which generates a limited number of points on the Pareto front. A neural network (NN) is then trained to compliment ACGA in the derivation of other desired points on the Pareto front by mimicking the relationship between the ACGA-generated calibration parameters and the model responses. The calibration scheme, ACGA, is linked with HydroWorks and tested on a catchment in Singapore. Results show that ACGA is more efficient and effective in deriving the Pareto front compared to other established GA-based optimization techniques such as vector evaluated GA, multiobjective GA, and nondominated sorting GA. Verification of the trained NN forecaster indicates that the trained network reproduces ACGA generated points on the Pareto front accurately. Thus, ACGA-NN is a useful and reliable tool to generate additional points on the Pareto front.

In this chapter, we explain how multi-objective genetic algorithms can be applied to the design of fuzzy rule-based systems for pattern classification problems. For a multi-class pattern classification problem with many continuous attributes (e.g., wine classification with 13 continuous attributes [1]), a fuzzy rule-based classification system is designed by a multi-objective genetic algorithm [2, 3] with two objectives: to minimize the size of the fuzzy rule-based classification system and to maximize its performance [4, 5]. The size of the fuzzy rule-based classification system is expressed by the number of fuzzy if-then rules, and its performance is measured by the number of correctly classified training patterns. In our approach to the design of the fuzzy rule-based classification system, first a large number of fuzzy if-then rules are generated from training patterns as candidate rules for the rule selection. Then a small number of fuzzy if-then rules are selected from the candidate rules by the two-objective genetic algorithm. The two-objective genetic algorithm tries to find all the non-dominated solutions (i.e., non-dominated rule sets) of the rule selection problem with the above-mentioned objectives. One difficulty of the rule selection method for high-dimensional pattern classification problems with many continuous attributes is that the number of candidate fuzzy if-then rules becomes intractably large. For example, the number of candidate rules is 613 ≅ 1.3 × 1010 for the wine classification problem with 13 continuous attributes if we have six fuzzy sets (terms) on each axis of the 13-dimensional pattern space.

Accurately identifying phenotype-relevant cell subsets from heterogeneous cell populations is crucial for delineating the underlying mechanisms driving biological or clinical phenotypes. Here, by deploying a learning with rejection strategy, we developed a novel supervised learning framework called PENCIL to identify subpopulations associated with categorical or continuous phenotypes from single-cell data. By embedding a feature selection function into this flexible framework, for the first time, we were able to select informative features and identify cell subpopulations simultaneously, which enables the accurate identification of phenotypic subpopulations otherwise missed by methods incapable of concurrent gene selection. Furthermore, the regression mode of PENCIL presents a novel ability for supervised phenotypic trajectory learning of subpopulations from single-cell data. We conducted comprehensive simulations to evaluate PENCIĽs versatility in simultaneous gene selection, subpopulation identification and phenotypic trajectory prediction. PENCIL is fast and scalable to analyze 1 million cells within 1 hour. Using the classification mode, PENCIL detected T-cell subpopulations associated with melanoma immunotherapy outcomes. Moreover, when applied to scRNA-seq of a mantle cell lymphoma patient with drug treatment across multiple time points, the regression mode of PENCIL revealed a transcriptional treatment response trajectory. Collectively, our work introduces a scalable and flexible infrastructure to accurately identify phenotype-associated subpopulations from single-cell data.

This paper investigates UAV conceptual design using optimization methods. The conceptual design of a Medium Altitude Long Endurance (MALE) UAV is formulated as two different optimization problems. The optimization problems use a single objective and dual objective functions. For the single objective case, endurance maximization of the UAV is taken as the objective function with aspect ratio and wing loading as design variables. Wing weight, stall speed, maximum speed and rate of climb are taken as constraints. In the dual objective case, minimizing weight is removed from the constraint set and added as the second objective and four more design variables namely taper ratio, thickness to chord ratio, loiter velocity and loiter altitude are added. In the single objective case, both conventional optimization algorithm and genetic algorithm are used to solve the problem and identical results are obtained. A newly developed multi-objective evolutionary algorithm named NSGA-II (non-dominated sorting genetic algorithm) is used to capture the full Pareto front for the dual objective problem. For the dual objective case, numerical results show that several useful Pareto optimal designs exist for the conceptual design of UAV. These Pareto points are thoroughly analyzed for use in detailed design.

The sequential quadratic programming and genetic algorithms are finely tuned on the optimal design of a brushless DC wheel motor. Combining both methods, a hybrid approach is tested. Multiobjective optimizations are performed using Nondominated Sorting Genetic Algorithm, Strength Pareto Evolutionary Algorithm, and a variable weighted sum of objectives with the sequential quadratic programming. The Pareto fronts are compared in term of accuracy, uniformity, and coverage criteria using some quality indicators.

The potential and effectiveness of the newly developed Pareto-based multiobjective evolutionary algorithms (MOEA) for solving a real-world power system multiobjective nonlinear optimization problem are comprehensively discussed and evaluated in this paper. Specifically, nondominated sorting genetic algorithm, niched Pareto genetic algorithm, and strength Pareto evolutionary algorithm (SPEA) have been developed and successfully applied to an environmental/economic electric power dispatch problem. A new procedure for quality measure is proposed in this paper in order to evaluate different techniques. A feasibility check procedure has been developed and superimposed on MOEA to restrict the search to the feasible region of the problem space. A hierarchical clustering algorithm is also imposed to provide the power system operator with a representative and manageable Pareto-optimal set. Moreover, an approach based on fuzzy set theory is developed to extract one of the Pareto-optimal solutions as the best compromise one. These multiobjective evolutionary algorithms have been individually examined and applied to the standard IEEE 30-bus six-generator test system. Several optimization runs have been carried out on different cases of problem complexity. The results of MOEA have been compared to those reported in the literature. The results confirm the potential and effectiveness of MOEA compared to the traditional multiobjective optimization techniques. In addition, the results demonstrate the superiority of the SPEA as a promising multiobjective evolutionary algorithm to solve different power system multiobjective optimization problems.

Sustainability encompasses the interaction between environmental, economic, and social systems at various levels. In transportation systems, vehicles rely on different fuels to meet energy demands. However, these fuels contribute to environmental pollution by releasing greenhouse gases. Considering this context, the present study investigates a sustainable fixed-charge multi-objective multi-driver multi-route multi-conveyance shortest path problem (FCMOMDMRMCSPP). The primary intent is to identify the most efficient route that minimizes cost, time, risk, carbon emissions, and distance while traveling between sources and destinations. Real-world scenarios often involve uncertainties, making it difficult to precisely define the parameters of FCMOMDMRMCSPP. Triangular fuzzy numbers are introduced in the proposed model to address this ambiguity. The possibilistic programming approach is employed to transform the fuzzy problem into a deterministic one. The resulting deterministic model is then solved using two multi-objective genetic algorithms (MOGAs): aspiration level (AL)-based non-dominated sorting genetic algorithm (NSGA)-II and NSGA-III. An aquatic fish haul system problem has been examined as an application within the framework of the proposed model. For α = 0 and 0.1, the AL-based NSGA-II and III generate 6, 11, and 4 solutions that satisfy the decision-maker’s (DM’s) ALs in cases I, II, and III of the AL and shape parameter combination, respectively. Similarly, for α = 0.5, these methods yield 5, 11, and 4 solutions, while for α = 0.9, they provide 6, 11, and 4 solutions for the same cases. A comparative analysis is conducted between the compromise solutions obtained from the proposed techniques and those derived from the hybrid genetic algorithm, NSGA-II and NSGA-III. A sensitivity analysis of the objective functions concerning the shape parameter and AL is also performed. Finally, the coverage performance measure is computed to assess the effectiveness of the proposed methods.

In this article, our interest is focused on the automatic learning of Boolean queries in information retrieval systems (IRSs) by means of multi‐objective evolutionary algorithms considering the classic performance criteria, precision and recall. We present a comparative study of four well‐known, general‐purpose, multi‐objective evolutionary algorithms to learn Boolean queries in IRSs. These evolutionary algorithms are the Nondominated Sorting Genetic Algorithm (NSGA‐II), the first version of the Strength Pareto Evolutionary Algorithm (SPEA), the second version of SPEA (SPEA2), and the Multi‐Objective Genetic Algorithm (MOGA).

In this paper, we study the resource management problem in Direct Sequence-Wideband Code Division Multiple Access (DS-WCDMA) systems. The control variables, transmission power, and transmission rate for resource management are considered. Three meta-heuristic techniques, Genetic Algorithms (GA), Simulated Annealing (SA), and Tabu Search (TS), are utilized to solve this optimization problem. Also, a nonlinear programming technique, Generalized Reduced Gradient (GRG) method, is adopted to compare with the three meta-heuristic techniques. Two approaches, the single objective approach and the multiobjective approach, are used in the simulation. The results obtained by GA, SA, TS, and GRG are compared in a single objective approach. In a multiobjective approach, Multiobjective Genetic Algorithm (MOGA) is employed to compare with the other two well-known multiobjective evolutionary algorithms (MOEAs), Pareto Archived Evolution Strategy (PAES) and Micro-Genetic Algorithms (MICRO-GA). Two scenarios, scenario (a): 25 users and scenario (b): 50 users, are considered for both approaches. The simulation results of a single objective approach show that GA outperforms SA, TS, and GRG in the two scenarios. Also, the simulation results of a multiobjective approach show that MOGA outperforms PAES and MICRO-GA, and obtains nondominated trade-off solutions with better convergence and diversity between trade minimization of total power and maximization of total rate in two scenarios.