.png){kind=icon}
返回
A path relinking approach with ejection chains for the generalized assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.08.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The generalized assignment problem is a classical combinatorial optimization problem known to be NP-hard. It can model a variety of real world applications in location, allocation, machine assignment, and supply chains. The problem has been studied since the late 1960s, and computer codes for practical applications emerged in the early 1970s. We propose a new algorithm for this problem that proves to be more effective than previously existing methods. The algorithm features a path relinking approach, which is a mechanism for generating new solutions by combining two or more reference solutions. It also features an ejection chain approach, which is embedded in a neighborhood construction to create more complex and powerful moves. Computational comparisons on benchmark instances show that the method is not only effective in general, but is especially effective for types D and E instances, which are known to be very difficult. (c) 2004 Elsevier B.V. All rights reserved.
Keyword:
metaheuristics
scatter search
path relinking
ejection chains
generalized assignment problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
A tabu search approach to the constraint satisfaction problem as a general problem solver作为一般问题解决者的约束满足问题的禁忌搜索方法
PREAI
分享收藏分享收藏
分享收藏Predictive risk stratification model: a progressive cluster-randomised trial in chronic conditions management (PRISMATIC) research protocol.png)
Trials
OAAI
TrialsIF0
OAAI分享收藏分享收藏
查看更多内容