期刊
JOURNAL OF HEURISTICS
卷 14, 期 6, 页码 613-625出版社
SPRINGER
DOI: 10.1007/s10732-007-9053-z
关键词
Distance; Variety; Diversity
Suppose two solution vectors are needed that have good objective function values and are different from each other. The following question has not yet been systematically researched: Should the two vectors be generated sequentially or simultaneously? We provide evidence that for broad ranges of practically achievable distances, sequential generation usually requires less computational effort and produces solutions that are at least as good as produced by simultaneous generation. This is done using experiments based on publicly available instances of the multi-constrained, zero-one knapsack problem, which are corroborated using experiments conducted with the linear assignment problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据