Using surrogate information to solve the multidimensional multi-choice knapsack problem

被引：0

作者：

Htiouech, Skander ^{[1
]}

Bouamama, Sadok ^{[2
]}

Attia, Rabeh ^{[3
]}

机构：

[1] Sys Com, Natl Engn Sch Tunis, Tunis, Tunisia

[2] Natl Engn Sch Tunis, HANA Lab, Tunis, Tunisia

[3] Sys Com, Polytech Sch, Tunis, Tunisia

来源：

2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2013年

关键词：

ALGORITHM;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we present a new heuristic for solving the multidimensional multi-choice knapsack problem called MMKP. The main idea is to explore both sides of the feasibility border that consists in alternating both constructive and destructive phases in a strategic oscillating manner. Performance analysis of the method shows the merits of using surrogate constraint information as choice rules for solving this problem class. A constraint normalization method is also used to strengthen the surrogate constraint information in order to improve the computational results. Numerical results show that the performance of this approach is competitive with previously published results.

引用

页码：2102 / 2107

页数：6

共 45 条

[21]

[Anonymous], OPERATIONS RES

[22]

[Anonymous], 1998, SURROGATE CONSTRAINT

[23]

[Anonymous], 1998, THESIS

[24]

[Anonymous], MATH PROGRAMMING STU