A Novel Local Search Algorithm for Knapsack Problem

被引：0

作者：

Memariani, Mostafa ^{[1
]}

Ghandeshtani, Kambiz Shojaee ^{[2
]}

Madadi, Ahmad ^{[3
]}

Neshati, Mohammad Mohsen ^{[1
]}

机构：

[1] Ferdowsi Univ Mashhad, Dept Elect Engn, Mashhad, Iran

[2] Univ Tehran, Dept Elect Engn, Tehran, Iran

[3] Univ Amir Kabir, Dept Comp Engn, Tehran, Iran

来源：

PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON ADVANCED ENGINEERING COMPUTING AND APPLICATIONS IN SCIENCES (ADVCOMP 2010) | 2010年

关键词：

Artificial intelligence; NP-hard; Knapsack problem; Combinational optimization;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Knapsack problem is an integer programming that is generally called "Multidimentional Knapsack". Knapsack problem is known as a NP-hard problem. This paper is an introduction to a new idea for solving one-dimentional knapsack that with defining the "Weight Value Index", "Sorting" and "Smart local search" forms a new algorithm. This algorithm is mathematically formulated and has run on 5 sample problems of one-dimentional knapsack, that in most of them the result is close to the optimum. The results show that this method by comparison with the others recently published in this field, despite of its simplicity, has enough required functionality in order to get the result on the tested items.

引用

下载

页码：77 / 80

页数：4

共 50 条

[21] A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem
Sbihi, Abdelkader
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (02) : 339 - 346
[22] A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
Hifi, M
Michrafy, M
Sbihi, A
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2006, 33 (2-3) : 271 - 285
[23] A hybrid heuristic algorithm based on Mean-Field Theory with a Simple Local Search for the Quadratic Knapsack Problem
Banda, Juan
Velasco, Jonas
Berrones, Arturo
2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 2559 - 2565
[24] A KNN quantum cuckoo search algorithm applied to the multidimensional knapsack problem
Garcia, Jose
Maureira, Carlos
APPLIED SOFT COMPUTING, 2021, 102
[25] A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
Wei, Zequn
Hao, Jin-Kao
COMPUTERS & OPERATIONS RESEARCH, 2021, 136
[26] AN IMPROVED BINARY SEARCH ALGORITHM FOR THE MULTIPLE-CHOICE KNAPSACK PROBLEM
He, Cheng
Leung, Joseph Y-T.
Lee, Kangbok
Pinedo, Michael L.
RAIRO-OPERATIONS RESEARCH, 2016, 50 (4-5) : 995 - 1001
[27] An approximate binary search algorithm for the multiple-choice knapsack problem
Gens, G
Levner, E
INFORMATION PROCESSING LETTERS, 1998, 67 (05) : 261 - 265
[28] A Differential Evolution Algorithm with Variable Neighborhood Search for Multidimensional Knapsack Problem
Tasgetiren, M. Fatih
Pan, Quan-Ke
Kizilay, Damla
Suer, Gursel
2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 2797 - 2804
[29] Visualization and analysis of the exact algorithm for knapsack problem based on exhaustive search
Kupriyashin, M.A.
Borzunov, G.I.
Scientific Visualization, 2015, 7 (04):
[30] A Knapsack Problem Based Algorithm for Local Level Management in Smart Grid
Ali, Usman
Qamar, Usman
Wahab, Kanwal
Arif, Khawaj Sarmad
ADVANCES IN INTERNET, DATA AND WEB TECHNOLOGIES (EIDWT 2020), 2020, 47 : 301 - 310

← 1 2 3 4 5 →