.png){kind=icon}
返回
An effective genetic algorithm approach to large scale mixed integer programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2005.05.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To effectively reduce the search space of GAs on large-scale M I P problems, this paper proposed a new variable grouping method based on Structure properties of a problem. Taking the capacity expansion and technology selection problem as a typical example, this method groups problem's decision variables over time period and machine line. Based on this new variable grouping method, we developed a variable-grouping based genetic algorithm according to problem's structure properties (VGGA-S). We tested the performance of VGGA-S by applying it on the capacity expansion and technology selection problem. Numerical experiments suggested that, VGGA-S Outperforms the standard GA and variable-grouping based GAs without considering problem's structure properties, both on computation time and solution quality. Although VGGA-S is proposed based on structure properties of a specific MIP problem, it is a general optimization algorithm and theoretically applicable to other large scale MIP problems. (c) 2005 Elsevier Inc. All rights reserved.
Keyword:
mixed integer programming
genetic algorithm
variable grouping
structure property
search space
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
A Hybrid approach for integer programming combining genetic algorithms, linear programming and ordinal optimization结合遗传算法，线性规划和顺序优化的整数规划的混合方法
PREAI
分享收藏
查看更多内容