Genetic algorithms for multi-objectives problems under its objective boundary

  • Authors:
  • Anon Sukstrienwong

  • Affiliations:
  • Department of Science and Technology, Bangkok University, Bangkok, Thailand, Thailand

  • Venue:
  • ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

In real-world problems, there exist many problems which their multi-objective vectors are required to be within the area in which something acts or operates. Many traditional methods scalarize the objective vector into a single objective, and some researchers are interested in the set known as Pareto optimal solution. However, in this paper, a new approach is proposed to solve the multi-objectives problems in which some elements of objective y = (y1, y2,...,ym) are requested to be balanced within its objective boundary. The proposed algorithm called genetic algorithm for objective boundary (GasOB scheme). The experimental results derived from the proposed algorithm have compared with the result derived by a linear search technique through the search space. In most cases, the results indicate that GAsOB can find the solution more efficiently than the linear search technique with a good customization of a number of eras and immigration rate.