Filters








1,905 Hits in 10.3 sec

Quantum-Inspired Wolf Pack Algorithm to Solve the 0-1 Knapsack Problem

Yangjun Gao, Fengming Zhang, Yu Zhao, Chao Li
2018 Mathematical Problems in Engineering  
This paper proposes a Quantum-Inspired wolf pack algorithm (QWPA) based on quantum encoding to enhance the performance of the wolf pack algorithm (WPA) to solve the 0-1 knapsack problems.  ...  Ten classical and four high-dimensional knapsack problems are employed to test the proposed algorithm, and the results are compared with other typical algorithms.  ...  Acknowledgments This work was supported in part by the National Natural Science Foundation of China under Grant 71601183.  ... 
doi:10.1155/2018/5327056 fatcat:25we3xnmejeppkqb7d5c6fqrli

An Explanatory Comparison of Brute Force and Dynamic Programming Techniques to Solve the 0-1 Knapsack Problem

O.A Balogun, M.A Dosunmu, I.O Ibidapo
2022 Zenodo  
This work seeks to explore an optimal way of allocating examination rooms by modeling the problem as a 0-1 Knapsack problem.  ...  During examination periods in schools, the demand on the use of examination rooms usually increases thus necessitating an optimal allocation of such rooms.  ...  the 0-1 KP, especially for the highdimensional instances. [9] made use of Cohort Intelligence (CI) Algorithm to solving 0-1 Knapsack problem.  ... 
doi:10.5281/zenodo.6345484 fatcat:tgmv6crai5ecjhsud6z4khtbce

A Hybrid Harmony Search Algorithm with Distribution Estimation for Solving the 0-1 Knapsack Problem

Kang Liu, Haibin Ouyang, Steven Li, Liqun Gao, Rohit Salgotra
2022 Mathematical Problems in Engineering  
Many optimization algorithms have been applied to solve high-dimensional instances of the 0-1 knapsack problem.  ...  The experimental results reveal that the proposed algorithm is a reliable and promising alternative for solving the 0-1 knapsack problem.  ...  Acknowledgments is work was supported by the National Natural Science Foundation of China (Grant no. 61806058), Natural Science Foundation of Guangdong Province (2018A030310063), and Guangzhou Science  ... 
doi:10.1155/2022/8440165 fatcat:wi7ozrpukfgdxjsddbomn3w5q4

Greedy Approach for Optimizing 0-1 Knapsack Problem

Shafiqul Abidin
2017 Communications on Applied Electronics  
This paper is based on 0-1 knapsack problem, a mathematical model, and analysis of the greedy strategy. Effort is made to give a genetic algorithm that solves the knapsack problem.  ...  0--1 knapsack problem is a typical NP complete problem in field of computer.  ...  We have given a genetic algorithm based on Greedy strategy to solve 0-1 knapsack problem.  ... 
doi:10.5120/cae2017652675 fatcat:hf5hkaetfreljfjmymb3u56ss4

Solving 0–1 knapsack problem by a novel global harmony search algorithm

Dexuan Zou, Liqun Gao, Steven Li, Jianhua Wu
2011 Applied Soft Computing  
This paper proposes a novel global harmony search algorithm (NGHS) to solve 0-1 knapsack problems.  ...  Computational experiments with a set of large-scale instances show that the NGHS can be an efficient alternative for solving 0-1 knapsack problems.  ...  Lin used genetic algorithm to solve knapsack problem with imprecise weight [4] , and he investigated the possibility of using genetic algorithms in solving the fuzzy knapsack problem without defining  ... 
doi:10.1016/j.asoc.2010.07.019 fatcat:vnqpt6k2fbdg7nkgvrwzy3mcou

An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems

Yanhong Feng, Ke Jia, Yichao He
2014 Computational Intelligence and Neuroscience  
In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems.  ...  First of all, for solving binary optimization problem with ICS, based on the idea of individual hybrid encoding, the cuckoo search over a continuous space is transformed into the synchronous evolution  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2014/970456 pmid:24527026 pmcid:PMC3913292 fatcat:awgk35udszgatdlduqaz2zvopi

An improved approach for solving 0/1 Knapsack Problem in polynomial time using Genetic Algorithms

Charu Sachdeva, Shivani Goel
2014 International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)  
A number of numerical experiments are performed and the outcome shows how this approach is better than the previous approach of Genetic Algorithm for solving 0/1 Knapsack Problem.0/1 Knapsack problem now  ...  There is a problem in the existing approach for solving 0/1 knapsack problem with the help of Genetic Algorithms and with the existing approach the performance is not good.  ...  So there is a need of a method to solve this in a polynomial time and gives an optimal solution. So one can use Genetic Algorithms to solve 0/1 knapsack problem.  ... 
doi:10.1109/icraie.2014.6909284 fatcat:olwcamib4nd7boszhn6jyk6ar4

Sequential and Parallel Implementation of GRASP for the 0-1 Multidimensional Knapsack Problem

Bianca de Almeida Dantas, Edson Norberto Cáceres
2015 Procedia Computer Science  
The problem has a great number of variants and obtaining an exact solution to any of these is not easily accomplished, which motivates the search for alternative techniques to solve the problem.  ...  In this work we propose a sequential and a parallel implementation for the multidimensional knapsack problem using GRASP metaheuristic.  ...  Conclusion In this work we presented sequential and GPGPU-based algorithms using GRASP metaheuristic to solve 0-1 MKP and tested them using the test instances of ORLIB library.  ... 
doi:10.1016/j.procs.2015.05.411 fatcat:mn5isjhc45gelm57top2f5zjpq

Quantum-Inspired Differential Evolution with Grey Wolf Optimizer for 0-1 Knapsack Problem

Yule Wang, Wanliang Wang
2021 Mathematics  
cases for 0-1 knapsack problems.  ...  The experimental results for 0-1 knapsack problems confirm the advantages of QDGWO with the effectiveness and global search capability for knapsack problems, especially for high-dimensional situations.  ...  Acknowledgments: The authors would like to thank the anonymous reviewers for their constructive comments and suggestions.  ... 
doi:10.3390/math9111233 fatcat:acrge4upjzg7podp7ot2rgxs5u

An elite opposition-flower pollination algorithm for a 0-1 knapsack problem

Mohamed Abdel Basset, Yongquan Zhou
2018 International Journal of Bio-Inspired Computation (IJBIC)  
In this paper, we apply an elite opposition-flower pollination algorithm (EFPA), to solve 0-1 knapsack problem, an NP-hard combinatorial optimisation problem.  ...  Computational experiments with a set of large-scale instances show that the EFPA can be an efficient alternative for solving 0-1 knapsack problems.  ...  It can be concluded that EFPA is an effective and stable algorithm for solving 0-1 knapsack problems.  ... 
doi:10.1504/ijbic.2018.090080 fatcat:33mf7r5kwzhslcshlse4igqn2y

An Improved Meerkat Clan Algorithm for Solving 0-1 Knapsack Problem

Samer Alaa Hussein, Ahmed Yacoub Yousif
2022 Iraqi Journal of Science  
The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems.  ...  This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC).  ...  In [11] , an improved binary chicken swarm optimization algorithm was proposed for solving the 0-1 knapsack problem.  ... 
doi:10.24996/ijs.2022.63.2.32 fatcat:e6n35lamjngyldxr34a2x2nu6y

A Hybrid Parallel Multi-Objective Genetic Algorithm for 0/1 Knapsack Problem

Sudhir B. Jagtap, Subhendu Kumar Pani, Ganeshchandra Shinde
2011 Journal of Software Engineering and Applications  
In this paper a hybrid parallel multi-objective genetic algorithm is proposed for solving 0/1 knapsack problem.  ...  Hence, the classical multi-objective genetic algorithms (MOGAs) (i.e., non-Parallel MOGAs) may fail to solve such intractable problem in a reasonable amount of time.  ...  In this paper, we proposed a new hybrid model to parallelize multi-objective genetic algorithms and implemented it on 0/1 knapsack problem.  ... 
doi:10.4236/jsea.2011.45035 fatcat:iwchgv5gbfaj7hcpsaqvqzeldy

A Thermodynamical Selection-Based Discrete Differential Evolution for the 0-1 Knapsack Problem

Zhaolu Guo, Xuezhi Yue, Kejun Zhang, Shenwen Wang, Zhijian Wu
2014 Entropy  
Lu and Yu [20] introduced a quantum multi-objective evolutionary algorithm with an adaptive population (APMQEA) to solve multi-objective 0-1 knapsack problems.  ...  In the literature [22] , an amoeboid organism algorithm is proposed by Zhang et al. to solve 0-1 knapsack problems.  ...  Author Contributions All authors contributed to the design of the research.  ... 
doi:10.3390/e16126263 fatcat:mybe5uj2kffsbovqia6ig5xwo4

Binary social group optimization algorithm for solving 0-1 knapsack problem

Anima Naik, Pradeep Kumar Chokkalingam
2022 Decision Science Letters  
In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem.  ...  The experiments are carried out using both low-dimensional and high-dimensional knapsack problems. The results obtained by the BSGO algorithm are compared with other binary optimization algorithms.  ...  So to solve the 0-1 knapsack problem using the SGO algorithm, the continuous variables have to be transformed into discrete variables.  ... 
doi:10.5267/j.dsl.2021.8.004 fatcat:25qac7wztzefrbf2lu4gdaskry

Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem [article]

Ivars Dzalbs, Tatiana Kalganova, Ian Dear
2020 arXiv   pre-print
This work investigates the performance of the proposed algorithm across 101 Multidimensional Knapsack Problem (MKP) benchmark instances.  ...  The multidimensional knapsack problem is a well-known constrained optimization problem with many real-world engineering applications.  ...  work solves multidimensional NP-hard 0-1 knapsack problems using an Imperialist Competitive Algorithm for the first time.  ... 
arXiv:2003.06617v1 fatcat:f3qs6y2thbde7dbtdixj7holo4
« Previous Showing results 1 — 15 out of 1,905 results