期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A Weight-Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem 被引量:2
1
作者 Quan Yuan Zhixin Yang 《Advances in Pure Mathematics》 2016年第10期659-675,共17页
A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computatio... A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm pro-posed by Raidl (1999) and to some existing benchmarks, it can yield better results than the ones reported in the OR-library. 展开更多
关键词 Weight-Coding Evolutionary Algorithm multidimensional knapsack Problem (MKP)
下载PDF
IMPROVING SOLVER PERFORMANCE THROUGH REDUNDANCY
2
作者 Eduardo Lalla-Ruiz Stefan Voβ 《Journal of Systems Science and Systems Engineering》 SCIE EI CSCD 2016年第3期303-325,共23页
It is well known that hierarchies of mathematical programming formulatlons with different numbers of variables and constraints have a considerable impact regarding the quality of solutions obtained once these formulat... It is well known that hierarchies of mathematical programming formulatlons with different numbers of variables and constraints have a considerable impact regarding the quality of solutions obtained once these formulations are fed to a commercial solver. In addition, even if dimensions are kept the same, changes in formulations may largely influence solvability and quality of results. This becomes evident especially if redundant constraints are used. We propose a related framework for information collection based on these constraints. We exemplify by means of a well-known combinatorial optimization problem from the knapsack problem family, i.e., the multidimensional multiple-choice knapsack problem (MMKP). This incorporates a relationship of the MMKP to some generalized set partitioning problems. Moreover, we investigate an application in maritime shipping and logistics by means of the dynamic berth allocation problem (DBAP), where optimal solutions are reached from the root node within the solver. 展开更多
关键词 Erraticism redundant constraints multidimensional multiple-choice knapsack problem dynamic berth allocation problem
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部