Applied Mathematics

Volume 5, Issue 21 (December 2014)

ISSN Print: 2152-7385   ISSN Online: 2152-7393

Google-based Impact Factor: 0.83  Citations  

Three-Objective Programming with Continuous Variable Genetic Algorithm

HTML  XML Download Download as PDF (Size: 3665KB)  PP. 3297-3310  
DOI: 10.4236/am.2014.521307    3,108 Downloads   4,252 Views  Citations


The subject area of multiobjective optimization deals with the investigation of optimization problems that possess more than one objective function. Usually, there does not exist a single solution that optimizes all functions simultaneously; quite the contrary, we have solution set that is called nondominated set and elements of this set are usually infinite. It is from this set decision made by taking elements of nondominated set as alternatives, which is given by analysts. Since it is important for the decision maker to obtain as much information as possible about this set, our research objective is to determine a well-defined and meaningful approximation of the solution set for linear and nonlinear three objective optimization problems. In this paper a continuous variable genetic algorithm is used to find approximate near optimal solution set. Objective functions are considered as fitness function without modification. Initial solution was generated within box constraint and solutions will be kept in feasible region during mutation and recombination.

Share and Cite:

Fita, A. (2014) Three-Objective Programming with Continuous Variable Genetic Algorithm. Applied Mathematics, 5, 3297-3310. doi: 10.4236/am.2014.521307.

Cited by

[1] Metaheuristic Start for Gradient based Optimization Algorithms
American Journal of Computational and Applied Mathematics, 2015

Copyright © 2021 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.