Solving Multi-objective Programming Problems
with Maximal Entropy Method and Genetic Algorithm

LIUHai-yan; CHEN Gao-bo; PENG Chuan

Volume 16 Issue 1

Feb. 2003

Turn off MathJax

Article Contents

Journal of Southwest Jiaotong University > 2003 > 16(1): 8-11.

LIUHai-yan, CHEN Gao-bo, PENG Chuan. Solving Multi-objective Programming Problemswith Maximal Entropy Method and Genetic Algorithm[J]. Journal of Southwest Jiaotong University, 2003, 16(1): 8-11.

Citation:

LIUHai-yan, CHEN Gao-bo, PENG Chuan. Solving Multi-objective Programming Problems with Maximal Entropy Method and Genetic Algorithm[J]. Journal of Southwest Jiaotong University, 2003, 16(1): 8-11.

LIUHai-yan, CHEN Gao-bo, PENG Chuan. Solving Multi-objective Programming Problemswith Maximal Entropy Method and Genetic Algorithm[J]. Journal of Southwest Jiaotong University, 2003, 16(1): 8-11.

Citation:

LIUHai-yan, CHEN Gao-bo, PENG Chuan. Solving Multi-objective Programming Problems with Maximal Entropy Method and Genetic Algorithm[J]. Journal of Southwest Jiaotong University, 2003, 16(1): 8-11.

PDF( 0 KB)

Solving Multi-objective Programming Problems with Maximal Entropy Method and Genetic Algorithm

Publish Date: 25 Feb 2003

Abstract

Abstract

The maximal entropy method is applied to convert a non-differentiable multi-objective programming to a differentiable one. Then the converted multi-objective programming is solved with genetic algorithm because of the high nonlinearity of its objective functions and restraints. A typical example from literature is solved as an example, with satisfactory accuracy obtained.
- multiple objectives programming,
- objective functions,
- maximal entropy,
- genetic algorithm