.png){kind=icon}
返回
Genetic algorithms with double strings for 0-1 programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00149-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, genetic algorithms with double strings for 0-1 knapsack problems are first revisited together with some modifications and computational experiments. Then the genetic algorithms with double strings for 0-1 knapsack problems are extended to deal with more general 0-1 programming problems involving both positive and negative coefficients in the constraints. Especially, new decoding algorithms for double strings using reference solutions both without and with the reference solution updating procedure are proposed so that each of individuals is decoded to the corresponding feasible solution for the general 0-1 programming problems. The efficiency and effectiveness of the proposed methods are investigated by comparing them with a branch and bound method with respect to the accuracy of an approximate solution and the processing time through a number of numerical experiments. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
0-1 programming problems
genetic algorithms
double strings
reference solutions
reference solution updating
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
An interactive fuzzy satisficing method for multiobjective 0-1 programming problems with fuzzy numbers through genetic algorithms with double strings通过双字符串遗传算法求解具有模糊数的多目标0-1规划问题的交互式模糊满足方法
PREAI
分享收藏分享收藏Fuzzy programming for multiobjective 0-1 programming problems through revised genetic algorithms
PREAI
分享收藏Meeting fisheries, ecosystem function, and biodiversity goals in a human-dominated world.png)
Science
OAAI
ScienceIF0
OAAI分享收藏
分享收藏 没有更多内容
没有更多内容