Inheritable genetic algorithm for biobjective 0/1 combinatorial optimization problems and its applications

Authors:
Shinn-Ying Ho;Jian-Hung Chen;Meng-Hsun Huang
Affiliations:
Dept. of Inf. Eng. & Comput. Sci., Feng Chia Univ., Taichung, Taiwan;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2004

Citing 0
Cited 5

Enhancing optimal feeder assignment of the multi-head surface mounting machine using genetic algorithms

Applied Soft Computing
A new orthogonal array based crossover, with analysis of gene interactions, for evolutionary algorithms and its application to car door design

Expert Systems with Applications: An International Journal
Human Pol II promoter prediction by using nucleotide property composition features

ISB '10 Proceedings of the International Symposium on Biocomputing
Model building using bi-level optimization

Journal of Global Optimization
Prediction of mouse senescence from HE-Stain liver images using an ensemble SVM classifier

ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we formulate a special type of multiobjective optimization problems, named biobjective 0/1 combinatorial optimization problem BOCOP, and propose an inheritable genetic algorithm IGA with orthogonal array crossover (OAX) to efficiently find a complete set of nondominated solutions to BOCOP. BOCOP with n binary variables has two incommensurable and often competing objectives: minimizing the sum r of values of all binary variables and optimizing the system performance. BOCOP is NP-hard having a finite number C(n,r) of feasible solutions for a limited number r. The merits of IGA are threefold as follows: 1) OAX with the systematic reasoning ability based on orthogonal experimental design can efficiently explore the search space of C(n,r); 2) IGA can efficiently search the space of C(n,r±1) by inheriting a good solution in the space of C(n,r); and 3) The single-objective IGA can economically obtain a complete set of high-quality nondominated solutions in a single run. Two applications of BOCOP are used to illustrate the effectiveness of the proposed algorithm: polygonal approximation problem (PAP) and the problem of editing a minimum reference set for nearest neighbor classification (MRSP). It is shown empirically that IGA is efficient in finding complete sets of nondominated solutions to PAP and MRSP, compared with some existing methods.