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 条

[1] Ant Algorithm with Local Search Procedure for Multiple Knapsack Problem
Fidanova, Stefka
Atanassov, Krassimir
[J]. LARGE-SCALE SCIENTIFIC COMPUTATIONS, LSSC 2023, 2024, 13952 : 246 - 252
[2] BRANCH SEARCH ALGORITHM FOR KNAPSACK PROBLEM
GREENBERG, H
HEGERICH, RL
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 16 (05): : 327 - 332
[3] A Hybrid Ant Colony Algorithm with a Local Search for the Strongly Correlated Knapsack Problem
Zouari, Wiem
Alaya, Ines
Tagina, Moncef
[J]. 2017 IEEE/ACS 14TH INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS (AICCSA), 2017, : 527 - 533
[4] A reactive local search-based algorithm for the disjunctively constrained knapsack problem
Hifi, M.
Michrafy, M.
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2006, 57 (06) : 718 - 726
[5] A flipping local search genetic algorithm for the multidimensional 0-1 knapsack problem
Alonso, Cesar L.
Caro, Fernando
Montana, Jose Luis
[J]. CURRENT TOPICS IN ARTIFICIAL INTELLIGENCE, 2006, 4177 : 21 - 30
[6] Solving 0-1 knapsack problem by a novel global harmony search algorithm
Zou, Dexuan
Gao, Liqun
Li, Steven
Wu, Jianhua
[J]. APPLIED SOFT COMPUTING, 2011, 11 (02) : 1556 - 1564
[7] A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
Avci, Mustafa
Topaloglu, Seyda
[J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 83 : 54 - 65
[8] An Improved Iterated Local Search Algorithm for Invest strongly correlated 0/1 Knapsack Problem
Luo, Xiaohu
Lv, Qiang
Qian, Peide
[J]. 2009 INTERNATIONAL FORUM ON COMPUTER SCIENCE-TECHNOLOGY AND APPLICATIONS, VOL 2, PROCEEDINGS, 2009, : 167 - 171
[9] A novel resampling algorithm based on the knapsack problem
Bacak, Ahmet
Hocaoglu, Ali Koksal
[J]. SIGNAL PROCESSING, 2020, 170
[10] A Binary Machine Learning Cuckoo Search Algorithm Improved by a Local Search Operator for the Set-Union Knapsack Problem
Garcia, Jose
Lemus-Romani, Jose
Altimiras, Francisco
Crawford, Broderick
Soto, Ricardo
Becerra-Rozas, Marcelo
Moraga, Paola
Paz Becerra, Alex
Pena Fritz, Alvaro
Rubio, Jose-Miguel
Astorga, Gino
[J]. MATHEMATICS, 2021, 9 (20)

← 1 2 3 4 5 →