Solving 0/1 Knapsack Problem Using Hybrid TLBO-GA Algorithm

Advances in Intelligent Systems and Computing - Proceedings of Fourth International Conference on Soft Computing for Problem Solving ◽

10.1007/978-81-322-2217-0_1 ◽

2014 ◽

pp. 1-10 ◽

Cited By ~ 4

Author(s):

A. J. Umbarkar ◽

P. D. Sheth ◽

S. V. Babar

Keyword(s):

Knapsack Problem ◽

Ga Algorithm

Download Full-text

A core approach to the 0 –1 equality knapsack problem

Journal of the Operational Research Society ◽

10.1038/sj.jors.2600488 ◽

1998 ◽

Vol 49 (1) ◽

pp. 86-92

Author(s):

A Volgenant ◽

S Marsman

Keyword(s):

Knapsack Problem

Download Full-text

Recycling Lethal Chromosomes Based on Immune Operation in Genetic Algorithm for Multi-Knapsack Problem

IEICE Proceeding Series ◽

10.15248/proc.1.219 ◽

2014 ◽

Vol 1 ◽

pp. 219-222

Author(s):

Jing Guo ◽

Jousuke Kuroiwa ◽

Hisakazu Ogura ◽

Izumi Suwa ◽

Haruhiko Shirai ◽

...

Keyword(s):

Genetic Algorithm ◽

Knapsack Problem

Download Full-text

A Hybrid GABC-GA Algorithm for Mechanical Design Optimization Problems

Intelligent Automation & Soft Computing ◽

10.31209/2019.100000085 ◽

2019 ◽

pp. -1--1

Author(s):

Hui Zhi ◽

Sanyang Liua

Keyword(s):

Design Optimization ◽

Optimization Problems ◽

Mechanical Design ◽

Ga Algorithm

Download Full-text

Investigation on conducted EMI noise source impedance extraction for electro magnetic compatibility based on SP‐GA algorithm

IET Power Electronics ◽

10.1049/iet-pel.2018.5912 ◽

2019 ◽

Vol 12 (7) ◽

pp. 1792-1799 ◽

Cited By ~ 1

Author(s):

Zhou Mengxia ◽

Zhao Yang ◽

Yan Wei ◽

Cao Yi ◽

Abdul Moeed ◽

...

Keyword(s):

Noise Source ◽

Source Impedance ◽

Ga Algorithm ◽

Impedance Extraction ◽

Electro Magnetic ◽

Conducted Emi ◽

Electro Magnetic Compatibility

Download Full-text

An iterative dynamic programming approach for the temporal knapsack problem

European Journal of Operational Research ◽

10.1016/j.ejor.2020.12.036 ◽

2020 ◽

Author(s):

F. Clautiaux ◽

B. Detienne ◽

G. Guillot

Keyword(s):

Dynamic Programming ◽

Knapsack Problem ◽

Programming Approach ◽

Dynamic Programming Approach ◽

Iterative Dynamic Programming

Download Full-text

An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem

Engineering With Computers ◽

10.1007/s00366-021-01470-z ◽

2021 ◽

Author(s):

Benyamin Abdollahzadeh ◽

Saeid Barshandeh ◽

Hatef Javadi ◽

Nicola Epicoco

Keyword(s):

Knapsack Problem ◽

Slime Mould

Download Full-text

ACO with Intuitionistic Fuzzy Pheromone Updating Applied on Multiple-Constraint Knapsack Problem

Mathematics ◽

10.3390/math9131456 ◽

2021 ◽

Vol 9 (13) ◽

pp. 1456

Author(s):

Stefka Fidanova ◽

Krassimir Todorov Atanassov

Keyword(s):

Decision Making ◽

Knapsack Problem ◽

Propositional Logic ◽

Optimization Problems ◽

Real Life ◽

Combinatorial Optimization Problems ◽

Intuitionistic Fuzzy ◽

Life Problems ◽

Multiple Constraint

Some of industrial and real life problems are difficult to be solved by traditional methods, because they need exponential number of calculations. As an example, we can mention decision-making problems. They can be defined as optimization problems. Ant Colony Optimization (ACO) is between the best methods, that solves combinatorial optimization problems. The method mimics behavior of the ants in the nature, when they look for a food. One of the algorithm parameters is called pheromone, and it is updated every iteration according quality of the achieved solutions. The intuitionistic fuzzy (propositional) logic was introduced as an extension of Zadeh’s fuzzy logic. In it, each proposition is estimated by two values: degree of validity and degree of non-validity. In this paper, we propose two variants of intuitionistic fuzzy pheromone updating. We apply our ideas on Multiple-Constraint Knapsack Problem (MKP) and compare achieved results with traditional ACO.

Download Full-text