Multiobjective hBOA, Clustering, and Scalability

Details Multiobjective hBOA, Clustering, and Scalability Multiobjective hBOA, Clustering, and Scalability

2005-02-07

arxiv.org/abs/cs/0502034v1

Computer Science

Neural and Evolutionary Computing

Also IlliGAL Report No. 2005005 (http://www-illigal.ge.uiuc.edu/). Submitted to GECCO-2005

Scientific paper

This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominated sorting genetic algorithm (NSGA-II) and clustering in the objective space. It is first argued that for good scalability, clustering or some other form of niching in the objective space is necessary and the size of each niche should be approximately equal. Multiobjective hBOA (mohBOA) is then described that combines hBOA, NSGA-II and clustering in the objective space. The algorithm mohBOA differs from the multiobjective variants of BOA and hBOA proposed in the past by including clustering in the objective space and allocating an approximately equally sized portion of the population to each cluster. The algorithm mohBOA is shown to scale up well on a number of problems on which standard multiobjective evolutionary algorithms perform poorly.

Affiliated with

Also associated with

No associations

Rating

Multiobjective hBOA, Clustering, and Scalability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiobjective hBOA, Clustering, and Scalability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiobjective hBOA, Clustering, and Scalability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-129065