遗传算法与极大熵相结合解多目标规划问题  

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

作　　者：刘海燕[1] 陈高波[1] 彭川[2] 

机构地区：[1]西南交通大学应用数学系,四川成都610031 [2]西南交通大学成人教育学院,四川成都610031

出　　处：《西南交通大学学报》2003年第1期8-11,共4页Journal of Southwest Jiaotong University

摘　　要：采用极大熵解法,将多目标规划转化为一般的可微规划.鉴于转化后的目标函数和约束条件都是高度非线性的,采用遗传算法求解多目标规划.取已有的典型算例运用文中提出的方法,得到了较好的精度.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.

关 键 词：多目标规划 目标函数 极大熵 遗传算法 约束条件 可微规划 

分 类 号：O221.6[理学—运筹学与控制论] O242.23[理学—数学]