Memetic Algorithm for Solving the 0-1 Multidimensional Knapsack Problem

被引：6

作者：

Rezoug, Abdellah ^{[1
]}

Boughaci, Dalila ^{[2
]}

Badr-El-Den, Mohamed ^{[3
]}

机构：

[1] Univ Mhamed Bougarra Boumerdes, Dept Comp Sci, Boumerdes, Algeria

[2] USTHB, Dept Comp Sci Beb Ezzouar, FEI, Algiers, Algeria

[3] Univ Portsmouth, Fac Technol, Sch Comp, Portsmouth, Hants, England

来源：

PROGRESS IN ARTIFICIAL INTELLIGENCE-BK | 2015年 / 9273卷

关键词：

Multidimensional knapsack problem; Stochastic local search; Genetic algorithm; Simulated annealing; Local search; Memetic algorithm; OPTIMIZATION;

D O I：

10.1007/978-3-319-23485-4_31

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, we propose a memetic algorithm for the Multidimensional Knapsack Problem (MKP). First, we propose to combine a genetic algorithm with a stochastic local search (GA-SLS), then with a simulated annealing (GA-SA). The two proposed versions of our approach (GA-SLS and GA-SA) are implemented and evaluated on benchmarks to measure their performance. The experiments show that both GA-SLS and GA-SA are able to find competitive results compared to other well-known hybrid GA based approaches.

引用

页码：298 / 304

页数：7

共 50 条

[41] Binary social group optimization algorithm for solving 0-1 knapsack problem
Naik, Anima
Chokkalingam, Pradeep Kumar
DECISION SCIENCE LETTERS, 2022, 11 (01) : 55 - 72
[42] Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
Wu H.
Zhou Y.
Luo Q.
Zhou, Yongquan (yongquanzhou@126.com), 2018, Inderscience Enterprises Ltd. (12) : 23 - 53
[43] Hybrid symbiotic organisms search algorithm for solving 0-1 knapsack problem
Wu, Haizhou
Zhou, Yongquan
Luo, Qifang
INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION, 2018, 12 (01) : 23 - 53
[44] Artificial Glowworm Swarm Optimization Algorithm for Solving 0-1 Knapsack Problem
Gong, Qiaoqiao
Zhou, Yongquan
Yang, Yan
SMART MATERIALS AND INTELLIGENT SYSTEMS, PTS 1 AND 2, 2011, 143-144 : 166 - 171
[45] A PBIL Algorithm for Solving 0-1 Knapsack Problem Based on Greedy Strategy
Fang, Xiaoping
Chen, Niansheng
Guo, Yu
PROCEEDINGS OF THE 2013 ASIA-PACIFIC COMPUTATIONAL INTELLIGENCE AND INFORMATION TECHNOLOGY CONFERENCE, 2013, : 664 - 672
[46] An enhanced binary slime mould algorithm for solving the 0-1 knapsack problem
Abdollahzadeh, Benyamin
Barshandeh, Saeid
Javadi, Hatef
Epicoco, Nicola
ENGINEERING WITH COMPUTERS, 2022, 38 (SUPPL 4) : 3423 - 3444
[47] An improved sexual genetic algorithm for solving 0/1 multidimensional knapsack problem
Laabadi, Soukaina
Naimi, Mohamed
El Amri, Hassan
Achchab, Boujemaa
ENGINEERING COMPUTATIONS, 2019, 36 (07) : 2260 - 2292
[48] Migrating Birds Optimization (MBO) Algorithm to Solve 0-1 Multidimensional Knapsack Problem
Tongur, Vahit
Ulker, Erkan
2017 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), 2017, : 786 - 789
[49] Improved convergent heuristics for the 0-1 multidimensional knapsack problem
Hanafi, Said
Wilbaut, Christophe
ANNALS OF OPERATIONS RESEARCH, 2011, 183 (01) : 125 - 142
[50] The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects
Arnaud Fréville
SaÏd Hanafi
Annals of Operations Research, 2005, 139 : 195 - 227

← 1 2 3 4 5 →