| Genetic Tabu Search for the Multi-Objective Knapsack Problem |
| |
| 作者姓名： | VincentBarichard Jin-KaoHao |
| |
| 作者单位： | LERIA,FacultyofSciences,UniversityofAngers,2BoulevardLavoisier,49045AngersCedex01,France |
| |
| 摘 要： | We introduce a hybrid algorithm for the 0 - 1 multidimensional multi-objective knapsack problem.This algorithm, called GTS^MOKP, combines a genetic procedure and a tabu search operator. The algorithm is evaluated on 9 well-known benchmark instances and shows highly competitive results compared with two state-of-the-art algorithms.
|
| 关 键 词： | 混合算法 遗传小板搜寻 搜索空间 多目标渐缩问题 0-1规划 |
Genetic Tabu Search for the Multi-Objective Knapsack Problem |
| |
| VincentBarichard Jin-KaoHao.Genetic Tabu Search for the Multi-Objective Knapsack Problem[J].Tsinghua Science and Technology,2003,8(1):8-13. |
| |
| Authors: | Vincent Barichard Jin-Kao Hao |
| |
| Abstract: | We introduce a hybrid algorithm for the 01 multidimensional multi-objective knapsack problem. This algorithm, called GTS MOKP, combines a genetic procedure and a tabu search operator. The algorithm is evaluated on 9 well-known benchmark instances and shows highly competitive results compared with two state-of-the-art algorithms. |
| |
| Keywords: | hybrid algorithm genetic tabu search search space |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
