.png){kind=icon}
返回
An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.09.070.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The multi-objective resource allocation problem (MORAP) addresses the important issue which seeks to find the expected objectives by allocating the limited amount of resource to various activates. Resources may be manpower, assets, raw material or anything else in limited supply which can be used to accomplish the goals. The goals may be objectives (i.e., minimizing costs, or maximizing efficiency) usually driven by specific future needs. In this paper, in order to obtain a set of Pareto solution efficiently, we proposed a modified version of ant colony optimization (ACO), in this algorithm we try to increase the efficiency of algorithm by increasing the learning of ants. Effectiveness and efficiency of proposed algorithm was validated by comparing the result of ACO with hybrid genetic algorithm (hGA) which was applied to MORAP later. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
ant colony optimization
multi-objective optimization model
multi-objective resources allocation problem (MORAP)
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
Adsorption of Cu(II), Pb(II), and Cd(II) Ions from Acidic Aqueous Solutions by Diethylenetriaminepentaacetic Acid-Modified Magnetic Graphene Oxide二乙烯三胺五乙酸改性的磁性氧化石墨烯对酸性水溶液中Cu(II)，Pb(II) 和Cd(II) 离子的吸附
PREAI
分享收藏An ant colony optimization algorithm for the minimum weight vertex cover problem求解最小权顶点覆盖问题的蚁群优化算法
PREAI
分享收藏分享收藏An effective genetic algorithm approach multiobjective resource allocation problems (MORAPs)一种有效的遗传算法解决多目标资源分配问题 (MORAPs)
PREAI
分享收藏分享收藏
查看更多内容