No Journal

1 Qian, H., Zhang, Q., Lei, D., & Pan, Z. (2017). A Cooperated Fruit Fly Optimization Algorithm For Knapsack
Problem, (6), 591–595.

2 Amini, J., Viki, A. H., Radan, A., & Moallem, M. (2017). A General Control Method for Multilevel Converters
Based on Knapsack Problem. IEEE Transactions on Power Electronics, 32(1), 2–10.
https://doi.org/10.1109/TPEL.2016.2522939

3 Banda, J., Velasco, J., & Berrones, A. (2017). A hybrid heuristic algorithm based on Mean-Field Theory with
a Simple Local Search for the Quadratic Knapsack Problem. In 2017 IEEE Congress on Evolutionary
Computation, CEC 2017 - Proceedings (pp. 2559–2565). https://doi.org/10.1109/CEC.2017.7969616
4 Al-iedani, N., Hifi, M., & Saadi, T. (2017). A Reactive Search for the Quadratic Knapsack Problem, (1999),
495–499.

5 Padmanabhan, J., & Swagath, S. (2017). A study Report on Solving 0-1 Knapsack Problem with Imprecise
Data.
6 Chih, M. (2017). A three-ratio SACRO-based particle swarm optimization with local search scheme for the
multidimensional knapsack problem, (2), 17–22.
7 Meng, T., & Pan, Q. K. (2017). An improved fruit fly optimization algorithm for solving the
multidimensional knapsack problem. Applied Soft Computing Journal, 50, 79–93.
https://doi.org/10.1016/j.asoc.2016.11.023

8 Ying, W. (2017). Binary Smart Wolf Pack Algorithm for Uncertain Bilevel Knapsack Problem, (2011), 133–
140.
9 Gupta, I. K., Choubey, A., & Choubey, S. (2017). Clustered genetic algorithm to solve multidimensional
knapsack problem. In 2017 8th International Conference on Computing, Communication and Networking
Technologies (ICCCNT) (pp. 1–6). https://doi.org/10.1109/ICCCNT.2017.8204118

10 Sapra, D., Sharma, R., & Agarwal, A. P. (2017). Comparative study of metaheuristic algorithms using
Knapsack Problem. Cloud Computing, Data Science & Engineering-Confluence, 2017 7th International
Conference on, 134–137. https://doi.org/10.1109/CONFLUENCE.2017.7943137

11 Fang, Z., Gu, X., & Chen, J. (2017). Improved heuristic Flower Pollination Algorithm for Solving Multi-
dimensional Knapsack Problems. https://doi.org/10.1109/ICICTA.2017.15
12 Rezoug, A., Bader-El-Den, M., & Boughaci, D. (2017). Knowledge-based Genetic Algorithm for the 0-1
Multidimensional Knapsack Problem. In 2017 IEEE Congress on Evolutionary Computation, CEC 2017 -
Proceedings (pp. 2030–2037). https://doi.org/10.1109/CEC.2017.7969550

13 Ferjani, A. A., & Liouane, N. (2017). Logic gate-based evolutionary algorithm for the multidimensional
knapsack problem. In 2017 International Conference on Control, Automation and Diagnosis, ICCAD 2017
(pp. 164–168). https://doi.org/10.1109/CADIAG.2017.8075650

14 Bouamama, S., & Blum, C. (2017). On Solving Large-Scale Instances of the Knapsack Problem with Setup
by means of an Iterated Greedy Algorithm, 342–347.
15 Vaze, R. (2017). Online knapsack problem and budgeted truthful bipartite matching. In Proceedings - IEEE
INFOCOM. https://doi.org/10.1109/INFOCOM.2017.8057223
16 Ferdosian, N., Othman, M., Lun, K. Y., & Ali, B. M. (2017). Optimal solution to the fractional knapsack
problem for LTE overload-state scheduling. In 2016 IEEE 3rd International Symposium on
Telecommunication Technologies, ISTT 2016 (pp. 97–102). https://doi.org/10.1109/ISTT.2016.7918092

17 Morimoto, N. (2017). Power Allocation Optimization as the Multiple Knapsack Problem with Assignment
Restrictions. In Proceedings of the 8th The Network of the Future (NoF) conference (to appear) (pp. 40–
45).

18 Husbands, R., Ahmed, Q., & Wang, J. (2017). Transmit Antenna Selection for Massive MIMO : A Knapsack
Problem Formulation, (August), 2–5. https://doi.org/10.1109/ICC.2017.7996694
19 Zhao, X., Dong, Y., & Tang, L. (2016). A contribution-guided discrete differential evolution algorithm for the
quadratic multiple knapsack problem. In 2016 IEEE Congress on Evolutionary Computation, CEC 2016 (pp.
2641–2648). https://doi.org/10.1109/CEC.2016.7744119

20 Al Douri, T., & Hifi, M. (2016). A diversified method for the multi-scenarios max-min knapsack problem. In
International Conference on Control, Decision and Information Technologies, CoDIT 2016 (pp. 355–359).
https://doi.org/10.1109/CoDIT.2016.7593588

21 Libao, D., Sha, W., Chengyu, J. I. N., & Cong, H. U. (2016). A Hybrid Mutation Scheme-Based Discrete
Differential Evolution Algorithm for Multidimensional Knapsack Problem, (2), 1009–1014.
https://doi.org/10.1109/IMCCC.2016.142

22 Xiong, X., & Ning, A. (2016). A new fast reduction algorithm for binary knapsack problem. In ICNSC 2016 -
13th IEEE International Conference on Networking, Sensing and Control.
https://doi.org/10.1109/ICNSC.2016.7478998

23 Hajarian, M., Shahbahrami, A., & Hoseini, F. (2016). A parallel solution for the 0-1 knapsack problem using
firefly algorithm. In 1st Conference on Swarm Intelligence and Evolutionary Computation, CSIEC 2016 -
Proceedings (pp. 25–30). https://doi.org/10.1109/CSIEC.2016.7482134

24 Dantas, B. D. A., & Caceres, E. N. (2016). A Parallelization of a Simulated Annealing Approach for 0-1
Multidimensional Knapsack Problem Using GPGPU. In Proceedings - Symposium on Computer
Architecture and High Performance Computing (pp. 134–140). https://doi.org/10.1109/SBAC-
PAD.2016.25

25 Daniel Valadao Baroni, M., & Varejao, F. M. (2016). A shuffled complex evolution algorithm for the
multidimensional knapsack problem using core concept. In 2016 IEEE Congress on Evolutionary
Computation (CEC) (pp. 2718–2723). https://doi.org/10.1109/CEC.2016.7744131

26 Feng, Y., & Wang, G. G. (2016). An Improved Hybrid Encoding Firefly Algorithm for Randomized Time-
Varying Knapsack Problems. In Proceedings - 2015 2nd International Conference on Soft Computing and
Machine Intelligence, ISCMI 2015 (pp. 9–14). https://doi.org/10.1109/ISCMI.2015.24

27 Wu, W., Iori, M., Martello, S., & Yagiura, M. (2016). An iterated dual substitution approach for the min-
max regret multidimensional knapsack problem. In IEEE International Conference on Industrial
Engineering and Engineering Management (Vol. 2016–Decem, pp. 726–730).
https://doi.org/10.1109/IEEM.2016.7797971
28 Urra, E., Cubillos, C., Cabrera-Paniagua, D., & Lefranc, G. (2016). Automatic parameter configuration for an
elite solution hyper-heuristic applied to the Multidimensional Knapsack Problem. In 2016 6th
International Conference on Computers Communications and Control, ICCCC 2016 (pp. 213–219).
https://doi.org/10.1109/ICCCC.2016.7496763

29 Posypkin, M., & Sin, S. T. T. (2016). Comparative analysis of the efficiency of various dynamic programming
algorithms for the knapsack problem. Proceedings of the 2016 IEEE North West Russia Section Young
Researchers in Electrical and Electronic Engineering Conference, EIConRusNW 2016, 313–316.
https://doi.org/10.1109/EIConRusNW.2016.7448182

30 Nakamura, K., & Shimbo, I. (2016). Formulation and solution method of tour conducting knapsack
problem. In 2016 IEEE 5th Global Conference on Consumer Electronics, GCCE 2016 (pp. 16–17).
https://doi.org/10.1109/GCCE.2016.7800387

31 Rojas-Morales, N., Riff, R. M. C., & Montero, U. E. (2016). Learning from the opposite: Strategies for Ants
that solve multidimensional Knapsack problem. In 2016 IEEE Congress on Evolutionary Computation, CEC
2016 (pp. 193–200). https://doi.org/10.1109/CEC.2016.7743795

32 Chen, Y., & Hao, J. K. (2016). Memetic search for the generalized quadratic multiple knapsack problem.
IEEE Transactions on Evolutionary Computation, 20(6), 908–923.
https://doi.org/10.1109/TEVC.2016.2546340

33 Quintuna, V., & Laye, M. (2016). Modeling and optimization of Content Delivery Networks with heuristics
solutions for the Multidimensional Knapsack Problem. In 2016 17th International Telecommunications
Network Strategy and Planning Symposium, Networks 2016 - Conference Proceedings (pp. 13–18).
https://doi.org/10.1109/NETWKS.2016.7751146

34 Ketykó, I., Kecskés, L., Nemes, C., & ... (2016). Multi-user computation offloading as multiple knapsack
problem for 5G mobile edge computing. … EuCNC), 2016 European …, 1–5. Retrieved from
http://ieeexplore.ieee.org/abstract/document/7561037/

35 Ben Salem, M., Taktak, R., Mahjoub, A. R., & Ben-Abdallah, H. (2016). Optimization algorithms for the
disjunctively constrained knapsack problem. Soft Computing, pp. 1–19. https://doi.org/10.1007/s00500-
016-2465-7

36 Salem, M. Ben, Taktak, R., Abdallah, B., & Mahjoub, A. R. (2016). Polyhedral Analysis for the Disjunctively
Constrained Knapsack Problem.
37 Bhattacharjee, K. K. (2015). A Binary Cuckoo Search Algorithm for Knapsack Problems.
38 Bhattacharjee, K. K., & Sarmah, S. P. (2015). A Binary Firefly Algorithm for Knapsack Problems, (3), 73–77.
39 Huang, B., Li, J., Lih, K. W., & Wang, H. (2015). Approximation algorithms for the generalized multiple
knapsack problems with K restricted elements. In Proceedings - 2015 7th International Conference on
Intelligent Human-Machine Systems and Cybernetics, IHMSC 2015 (Vol. 1, pp. 470–474).
https://doi.org/10.1109/IHMSC.2015.149

40 Müller, S., Al-shatri, H., Wichtlhuber, M., Hausheer, D., & Klein, A. (2015). Computation Offloading in
Wireless Multi-Hop Networks : Energy Minimization via Multi-Dimensional Knapsack Problem, 1717–
1722.

41 Li, Q. J., & Szeto, K. Y. (2015). Efficiency of adaptive genetic algorithm with mutation matrix in the solution
of the knapsack problem of increasing complexity. In 2015 IEEE Congress on Evolutionary Computation,
CEC 2015 - Proceedings (Vol. 0, pp. 31–38). https://doi.org/10.1109/CEC.2015.7256871

42 Kiss, Z. I., Hosu, A. C., Varga, M., & Polgar, Z. A. (2015). Load Balancing Solution for Heterogeneous
Wireless Networks based on the Knapsack Problem. Telecommunications and Signal Processing (TSP),
2015 38th International Conference.

43 Lee, S. K., Kim, S. G., & Kim, Y. H. (2015). Multimode Image Compression Algorithm Employing Multiple -
Choice Knapsack Problem - based Encoding Mode Selection. IEEE Transactions on Consumer Electronics,
2010 vol:(6), 549–556. https://doi.org/10.1109/JDT.2015.2506762

44 Tairan, N., Algarni, A., Varghese, J., & Jan, M. A. (2015). Population-based guided local search for
multidimensional Knapsack problem. In 2015 4th International Conference on Future Generation
Communication Technology, FGCT 2015. https://doi.org/10.1109/FGCT.2015.7300245

45 Pitchai, A., & Savarimuthu, N. (2015). Quantum walk based Genetic Algorithm for 0-1 Quadratic Knapsack
Problem, (3), 283–287.
46 Uslu, F. S. (2015). S ı rt Çantas ı Probleminin Genetik Algoritma ile Çözümü Solving Knapsack Problem with
Genetic Algorithm.
47 Li, J., Li, W., & Wang, H. (2015). THE MULTIPLE KNAPSACK PROBLEM WITH COMPATIBLE BIPARTITE
GRAPHS, (1), 91–97.
48 Rahim, S., Khan, S. A., Javaid, N., Shaheen, N., Iqbal, Z., & Rehman, G. (2015). Towards multiple knapsack
problem approach for home energy management in smart grid. In Proceedings - 2015 18th International
Conference on Network-Based Information Systems, NBiS 2015 (pp. 48–52).
https://doi.org/10.1109/NBiS.2015.11
49 Dantas, B., & Cáceres, E. (2014). A parallel implementation to the multidimensional knapsack problem
using augmented neural networks. In Computing Conference (CLEI), 2014 XL Latin American (pp. 1–9).
https://doi.org/10.1109/CLEI.2014.6965168

50 Hifi, M., Negre, S., Saadi, T., Saleh, S., & Wu, L. (2014). A parallel large neighborhood search-based
heuristic for the disjunctively constrained knapsack problem. In Proceedings of the International Parallel
and Distributed Processing Symposium, IPDPS (pp. 1547–1551).
https://doi.org/10.1109/IPDPSW.2014.173

51 Morimoto, N., Fujita, Y., Yoshida, M., Yoshimizu, H., Takiyamada, M., Akehi, T., & Tanaka, M. (2014). A
power allocation management system using an algorithm for the knapsack problem. In Proceedings - IEEE
38th Annual International Computers, Software and Applications Conference Workshops, COMPSACW
2014 (pp. 590–595). https://doi.org/10.1109/COMPSACW.2014.99

52 He, J., Mitavskiy, B., & Zhou, Y. (2014). A theoretical assessment of solution quality in evolutionary
algorithms for the knapsack problem. In Proceedings of the 2014 IEEE Congress on Evolutionary
Computation, CEC 2014 (pp. 141–148). https://doi.org/10.1109/CEC.2014.6900442

53 Al-Maliky, F., Hifi, M., & Mhalla, H. (2014). An exact solution search for the max-min multiple knapsack
problem. In Proceedings - 2014 International Conference on Control, Decision and Information
Technologies, CoDIT 2014 (pp. 117–122). https://doi.org/10.1109/CoDIT.2014.6996879

54 Sachdeva, C., & Goel, S. (2014). An improved approach for solving 0/1 Knapsack Problem in polynomial
time using Genetic Algorithms. International Conference on Recent Advances and Innovations in
Engineering, ICRAIE 2014, 2–5. https://doi.org/10.1109/ICRAIE.2014.6909284

55 Liu, X., Xiang, F., & Mao, J. (2014). An improved method forsolving the multidimensional 0-1 knapsack
problem. In International Conference on Electronics and Communication System (pp. 1–6).

56 Ben, N., & Ying, B. (2014). Binary bacterial foraging optimization for 0/1 knapsack problem. In Evolutionary
Computation (CEC), 2014 IEEE Congress on (pp. 647–652). https://doi.org/10.1109/CEC.2014.6900513

57 Xia, L., Cao, C. C., Chen, L., & Chen, Z. (2014). C -DMr : Crowd-powered Decision Maker for Real World
Knapsack Problems. In ICDE’14 Proceedings of IEEE 30th International Conference on Data Engineering
(pp. 1174–1177).
58 Xiong, X., & Ning, A. (2014). Cellular competitive decision algorithm for binary knapsack problem. In 2014
10th International Conference on Natural Computation, ICNC 2014 (pp. 503–507).
https://doi.org/10.1109/ICNC.2014.6975886

59 Talla Nobibon, F., & Leus, R. (2014). Complexity Results and Exact Algorithms for Robust Knapsack
Problems. Journal of Optimization Theory and Applications, 161(2), 533–552.
https://doi.org/10.1007/s10957-013-0319-3

60 Anantathanavit, M., & Munlin, M. A. (2014). Fusing binary particle swarm optimzation with simulated
annealing for knapsack problems. In Proceedings of the 2014 9th IEEE Conference on Industrial
Electronics and Applications, ICIEA 2014 (pp. 1995–2000). https://doi.org/10.1109/ICIEA.2014.6931496

61 Wedashwara, W., Mabu, S., Obayashi, M., & Kuremoto, T. (2014). Genetic Network Programming and
Knapsack Problem Implementation for Record Clustering on Distributed Database.
https://doi.org/10.1109/SICE.2014.6935234

62 Ibrahim, A., & Alfa, A. S. (2014). Solving binary and continuous knapsack problems for radio resource
allocation over high altitude platforms. In Wireless Telecommunications Symposium.
https://doi.org/10.1109/WTS.2014.6834994

63 Pradhan, T., Israni, A., & Sharma, M. (2014). Solving the 0-1 Knapsack Problem Using Genetic Algorithm
and Rough Set Theory (pp. 1120–1125).
64 Zan, D., & Jaros, J. (2014). Solving the Multidimensional Knapsack Problem using a CUDA accelerated PSO
BT - 2014 IEEE Congress on Evolutionary Computation, CEC 2014, July 6, 2014 - July 11, 2014. Evolutionary
Computation Conference (CEC), (2), 2933–2939. https://doi.org/10.1109/CEC.2014.6900534

65 Martins, J. P., Neto, C. B., Crocomo, M. K., Vittori, K., & Delbem, A. C. B. (2013). A comparison of Linkage-
learning-based genetic algorithms in multidimensional knapsack problems. In 2013 IEEE Congress on
Evolutionary Computation, CEC 2013 (pp. 502–509). https://doi.org/10.1109/CEC.2013.6557610

66 Mahato, S., & Biswas, S. (2013). A faster genetic algorithm to solve Knapsack problem employing fuzzy
technique. In 2013 4th International Conference on Computing, Communications and Networking
Technologies, ICCCNT 2013. https://doi.org/10.1109/ICCCNT.2013.6726649
67 Zongxin Jin, & Hongjuan Fan. (2013). A New Immune Genetic Algorithm for 0-1 Knapsack Problem. In
2013 Sixth International Symposium on Computational Intelligence and Design (pp. 31–33).
https://doi.org/10.1109/ISCID.2013.15

68 Khan, M. H. A. (2013). An Evolutionary Algorithm with Masked Mutation for 0 / 1 Knapsack Problem, 1(1).

69 Ruan, N. (2013). An interesting cryptography study based on knapsack problem. In Proceedings - UKSim
15th International Conference on Computer Modelling and Simulation, UKSim 2013 (Vol. 2, pp. 330–334).
https://doi.org/10.1109/UKSim.2013.20

70 De Queiroz, T. A., & Miyazawa, F. K. (2013). Approaches for the 2D 0-1 knapsack problem with conflict
graphs. In Proceedings of the 2013 39th Latin American Computing Conference, CLEI 2013.
https://doi.org/10.1109/CLEI.2013.6670612

71 Parada, L., Sepulveda, M., Herrera, C., & Parada, V. (2013). Automatic generation of algorithms for the
binary knapsack problem. In 2013 IEEE Congress on Evolutionary Computation, CEC 2013 (pp. 3148–
3152). https://doi.org/10.1109/CEC.2013.6557954

72 Qian, S. Q., & Wu, H. H. (2013). Dynamic stochastic ranking selection immune optimization algorithm for
dynamical 0/1 knapsack problem. In Proceedings - 2013 5th International Conference on Intelligent
Human-Machine Systems and Cybernetics, IHMSC 2013 (Vol. 1, pp. 100–103).
https://doi.org/10.1109/IHMSC.2013.31

73 Ishibuchi, H., Tanigaki, Y., Akedo, N., & Nojima, Y. (2013). How to Strike a Balance Between Local Search
and Global Search in Multiobjective Memetic Algorithms for Multiobjective 0/1 Kanapsack Problems. In
2013 IEEE Congress on Evolutionary Computation (CEC’2013) (pp. 1643–1650).

74 Tharanipriya, P. G., & Vishnuraja, P. (2013). Hybrid genetic algorithm for solving Knapsack problem. In
2013 International Conference on Information Communication and Embedded Systems (ICICES) (pp. 416–
420). https://doi.org/10.1109/ICICES.2013.6508280

75 Samanta, S., Chakraborty, S., Acharjee, S., Mukherjee, A., & Dey, N. (2013). Solving 0/1 knapsack problem
using ant weight lifting algorithm. In 2013 IEEE International Conference on Computational Intelligence
and Computing Research (pp. 1–5). https://doi.org/10.1109/ICCIC.2013.6724162

76 Htiouech, S., Bouamama, S., & Attia, R. (2013). Using surrogate information to solve the multidimensional
multi-choice knapsack problem. In 2013 IEEE Congress on Evolutionary Computation, CEC 2013 (pp.
2102–2107). https://doi.org/10.1109/CEC.2013.6557817
77 Rasmy, M. H. ., Tharwat, A. A. ., El-Beltagy, M. A. ., & Heikal, A. F. . (2012). A comparative study on the
performance of genetic algorithm, artificial immune system and hybrid intelligent approach to multiple-
choice multidimensional knapsack problem. 2012 8th International Conference on Informatics and
Systems, INFOS 2012, BIO20-BIO26. Retrieved from http://www.scopus.com/inward/record.url?eid=2-
s2.0-84864836759&partnerID=40&md5=693b85de50b126299174d30903db87dd

78 Chettaoui, H., & Ben Charrada, F. (2012). A Decentralized Periodic Replication Strategy based on Knapsack
Problem. In Proceedings - IEEE/ACM International Workshop on Grid Computing (pp. 3–11).
https://doi.org/10.1109/Grid.2012.23

79 Li, Y., Zhou, A., & Zhang, G. (2012). A Decomposition based Estimation of Distribution Algorithm for
Multiobjective Knapsack Problems, (Icnc), 803–807.
80 Bonyadi, M. R., & Michalewicz, Z. (2012). A fast particle swarm optimization algorithm for the
multidimensional knapsack problem. 2012 IEEE Congress on Evolutionary Computation, (August), 1–8.
https://doi.org/10.1109/CEC.2012.6256113

81 Algorithm, A. I. (2012). A Fundamental Study on the Effectiveness of Immune Algorithm for Multi-
Objective 0 / 1 Knapsack Problem, (3), 1660–1665.
82 Mundim, L. R., & de Queiroz, T. A. (2012). A hybrid heuristic for the 0–1 knapsack problem with
items of irregular shape. In Informatica (CLEI), 2012 XXXVIII Conferencia Latinoamericana En (pp. 1–6).
https://doi.org/10.1109/CLEI.2012.6427170

83 Zhang, P., Shan, X., & Gu, W. (2012). A modified harmony search algorithm for 0-1 knapsack problems. In
Proceedings - 2012 3rd International Conference on Digital Manufacturing and Automation, ICDMA 2012
(pp. 85–88). https://doi.org/10.1109/ICDMA.2012.20

84 Sabet, S., Farokhi, F., & Shokouhifar, M. (2012). A novel artificial bee colony algorithm for the knapsack
problem. In 2012 International Symposium on Innovations in Intelligent Systems and Applications (pp. 1–
5). https://doi.org/10.1109/INISTA.2012.6247029

85 Suri, B., Bordoloi, U. D., & Eles, P. (2012). A scalable GPU-based approach to accelerate the multiple-
choice knapsack problem. 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE),
1126–1129. https://doi.org/10.1109/DATE.2012.6176665

86 Zavala-Díaz, J. C., Ruiz-Vanoye, J. A., Díaz-Parra, O., & Aguilar, J. A. H. (2012). A solution to the strongly
correlated 0-1 Knapsack Problem by a Binary Branchand-Bound Algorithm. In Proceedings of the 2012 5th
International Joint Conference on Computational Sciences and Optimization, CSO 2012 (pp. 237–241).
https://doi.org/10.1109/CSO.2012.60
87 Lee, S., & Bau, Y. (2012). An Ant Colony Optimization Approach for Solving the Multidimensional Knapsack
Problem, 441–446.
88 Mahajan, R., & Chopra, S. (2012). Analysis of 0/1 Knapsack Problem Using Deterministic and Probabilistic
Techniques. In 2012 Second International Conference on Advanced Computing & Communication
Technologies (pp. 150–155). https://doi.org/10.1109/ACCT.2012.26

89 Lai, I. W., Lee, C. H., Ascheid, G., & Chiueh, T. D. (2012). Channel-adaptive MIMO detection based on the
multiple-choice knapsack problem (MCKP). IEEE Wireless Communications Letters, 1(6), 633–636.
https://doi.org/10.1109/WCL.2012.091312.120513

90 Arin, A., & Rabadi, G. (2012). Meta-RaPS with path relinking for the 0-1 multidimensional knapsack
problem. In IS’2012 - 2012 6th IEEE International Conference Intelligent Systems, Proceedings (pp. 347–
352). https://doi.org/10.1109/IS.2012.6335159

91 Jaros, J. (2012). Multi-GPU island-based genetic algorithm for solving the knapsack problem. In 2012 IEEE
Congress on Evolutionary Computation, CEC 2012 (pp. 10–15).
https://doi.org/10.1109/CEC.2012.6256131

92 Wang, R. (2012). mutation and its application to 0-1 knapsack problem l l, (M Ic), 484–488.
93 Sibanda, C. C. L., & Bagula, A. B. (2012). Network Selection for Mobile Nodes in Heterogeneous Wireless
Networks using Knapsack Problem Dynamic Algorithms, 174–177.
94 Ouyang, L., & Wang, D. (2012). New Particle Swarm Optimization algorithm for Knapsack Problem, 0(Icnc),
786–788.
95 Godrich, H., Petropulu, A. P., & Poor, H. V. (2012). Sensor Selection in Distributed Multiple-Radar
Architectures for Localization : A Knapsack Problem Formulation, 60(1), 247–260.
96 Yanqin Ma. (2012). The Modified Hybrid Adaptive genetic algorithm for 0-1 knapsack problem. In 2012
24th Chinese Control and Decision Conference (CCDC) (pp. 326–329).
https://doi.org/10.1109/CCDC.2012.6244047

97 Hifi, M., & Otmani, N. (2011). A first level scatter search for disjunctively constrained knapsack problems.
In 2011 International Conference on Communications, Computing and Control Applications, CCCA 2011.
https://doi.org/10.1109/CCCA.2011.6031544

98 Luo, S., Godrich, H., Petropulu, A., & Poor, H. V. (2011). A knapsack problem formulation for relay selection
in secure cooperative wireless communication. 2011 IEEE International Conference on Acoustics, Speech
and Signal Processing (ICASSP), 2512–2515. https://doi.org/10.1109/ICASSP.2011.5946995
99 Li, K., Li, L., Tesfazghi, T., & Sha, E. H. M. (2011). Adaptive and cost-optimal parallel algorithm for the 0-1
knapsack problem. In Proceedings - 19th International Euromicro Conference on Parallel, Distributed, and
Network-Based Processing, PDP 2011 (pp. 537–544). https://doi.org/10.1109/PDP.2011.11

100 Gopalan, P., Klivans, A., Meka, R., Štefankovič, D., Vempala, S., & Vigoda, E. (2011). An FPTAS for
#knapsack and related counting problems. In Proceedings - Annual IEEE Symposium on Foundations of
Computer Science, FOCS (pp. 817–826). https://doi.org/10.1109/FOCS.2011.32

101 Shen, W., Xu, B., & Huang, J. (2011). An Improved Genetic Algorithm for 0-1 Knapsack Problems. 2011
Second International Conference on Networking and Distributed Computing, 32–35.
https://doi.org/10.1109/ICNDC.2011.14

102 Godrich, H., Petropulu, A., & Poor, H. V. (2011). Antenna subset selection in distributed multiple-radar
architectures: A knapsack problem formulation. In European Signal Processing Conference (pp. 1693–
1697).

103 Godrich, H., Petropulu, A., & Poor, H. V. (2011). Antenna subset selection in distributed multiple-radar
architectures: A knapsack problem formulation. In European Signal Processing Conference (pp. 1693–
1697).

104 Patalia, T. P., & Kulkarni, G. R. (2011). Design of Genetic Algorithm for Knapsack Problem to Perform Stock
Portfolio Selection Using Financial Indicators. 2011 International Conference on Computational
Intelligence and Communication Networks, 289–292. https://doi.org/10.1109/CICN.2011.60

105 Ma, Y., & Wan, J. (2011). Improved hybrid adaptive genetic algorithm for solving knapsack problem. 2011
2nd International Conference on Intelligent Control and Information Processing, 644–647.
https://doi.org/10.1109/ICICIP.2011.6008329

106 Tan, Y. Y., Jiao, Y. C., & Wang, X. K. (2011). MOEA/D with uniform design for the multiobjective 0/1
knapsack problem. In Proceedings - 2011 7th International Conference on Computational Intelligence and
Security, CIS 2011 (Vol. 1, pp. 96–100). https://doi.org/10.1109/CIS.2011.29

107 Chiu, C., Yang, Y., & Chou, Y. (2011). Quantum-Inspired Tabu Search Algorithm for Solving 0 / 1 Knapsack
Problems. ORSA Journal on Computing, (1), 55–56.
108 Singh, R. P. (2011). Solving 0–1 Knapsack problem using Genetic Algorithms. 2011 IEEE 3rd International
Conference on Communication Software and Networks, 591–595.
https://doi.org/10.1109/ICCSN.2011.6013975
109 Chen, W., Hao, Z., & Liu, H. (2011). The 0/1 multi-objective knapsack problem based on regional search. In
Proceedings - 2011 7th International Conference on Computational Intelligence and Security, CIS 2011
(pp. 149–153). https://doi.org/10.1109/CIS.2011.41

110 Suryadi, D., & Kartika, E. K. (2011). Using the multiple knapsack problem to model the problem of virtual
machine allocation in cloud computing. In Proceedings - 3rd International Conference on Computational
Intelligence, Communication Systems and Networks, CICSyN 2011 (pp. 11–16).
https://doi.org/10.1109/CICSyN.2011.16

111 Suryadi, D., & Kartika, E. K. (2011). Viral systems application for Knapsack problem. In Proceedings - 3rd
International Conference on Computational Intelligence, Communication Systems and Networks, CICSyN
2011 (pp. 11–16). https://doi.org/10.1109/CICSyN.2011.16

112 Sotelo-Figueroa, M. A., Baltazar-Flores, M. D. R., Carpio, J. M., & Zamudio, V. (2010). A comparation
between bee swarm optimization and greedy algorithm for the knapsack problem with bee reallocation.
In Proceedings of Special Session - 9th Mexican International Conference on Artificial Intelligence:
Advances in Artificial Intelligence and Applications, MICAI 2010 (pp. 22–27).
https://doi.org/10.1109/MICAI.2010.32

113 Lin, C. (2010). A heuristic Genetic Algorithm based on schema replacement for 0-1 knapsack problem. In
Proceedings - 4th International Conference on Genetic and Evolutionary Computing, ICGEC 2010 (pp.
301–304). https://doi.org/10.1109/ICGEC.2010.81

114 Iqbal, S., Bari, M. F., & Rahman, M. S. (2010). A novel ACO technique for fast and near optimal solutions
for the multi-dimensional multi-choice knapsack problem. In Proceedings of 2010 13th International
Conference on Computer and Information Technology, ICCIT 2010 (pp. 33–38).
https://doi.org/10.1109/ICCITECHN.2010.5723825

115 Hoto, R., MacUlan, N., & Borssoi, A. (2010). A study of the Compartimentalized Knapsack Problem with
additional restrictions. IEEE Latin America Transactions, 8(3), 269–274.
https://doi.org/10.1109/TLA.2010.5538401

116 Pat, A. (2010). An Adaptive Quantum-inspired Differential Evolution Algorithm for 0-1 Knapsack Problem,
703–708.
117 Jianqiang, S. (2010). Backtracking Ant Colony Algorithm for the 0-1 Knapsack Problem, (70871081), 0–3.

118 Xiong, W., & Wei, P. (2010). Binary ant Colony Algorithm with Congestion Control Strategy for the 0 / 1
Multiple Knapsack Problems, 3296–3301.
119 Chou, Y. H., Chang, C. C., Chiu, C. H., Lin, F. J., Yang, Y. J., & Peng, Z. V. (2010). Classical and quantum-
inspired electromagnetism-like mechanism for solving 0/1 knapsack problems. In Conference Proceedings
- IEEE International Conference on Systems, Man and Cybernetics (pp. 3211–3218).
https://doi.org/10.1109/ICSMC.2010.5642288

120 Wang, Y., Lu, W., Zhang, X., & Cui, G. (2010). DNA Tile Assembly Model for 0-1 Knapsack Problem, 180–
184.
121 Zou, S., Wang, J., & Zhang, H. (2010). Multi-population cooperative GA and multi-objective knapsack
problem. In 2010 International Conference on Management and Service Science, MASS 2010 (Vol. 1, pp.
2–5). https://doi.org/10.1109/ICMSS.2010.5577426

122 Inoue, M., & Takagi, H. (2010). Proposal of F-F-objective optimization for many objectives and its
evaluation with a 0/1 knapsack problem. In Proceedings - 2010 2nd World Congress on Nature and
Biologically Inspired Computing, NaBIC 2010 (pp. 520–525).
https://doi.org/10.1109/NABIC.2010.5716333

123 Chang, C., Chen, C., Fan, C., Chao, H., Chou, Y., & Qiea, A. Q. E. A. (2010). Quantum-Inspired
Electromagnetism-like Mechanism for Solving 0 / 1 Knapsack Problem, (3).
Abstract
A Cooperated fruit fly optimization algorithm
(CFOA) is proposed for knapsack problems. In CFOA, a group generating strategy is designed for
generating the initial solution. A novel cooperation strategy is used to enhance the connection and
communication between flies. A repair operator based on value-weight ratio of each item is employed to
guarantee the feasibility of the solution and enhance the usage rate of the constraint. Extensive numerical
experiments are conducted on some well-known benchmark instances and the results show that CFOA
presents extreme fast convergence speed and accuracy
Abstract—In this paper, we propose an reactive method
to solve the Quadratic Knapsack Problem (noted QKP). The quadratic knapsack problem is a well-studied
combinatorial optimisation problem. In all variants of the quadratic knapsack problems, for a set of given
items, profits are not only assigned to individual items but also to pairs of them. The pairwise profit is
added to the quadratic objective value only when the two corresponding items are both included in the
same knapsack.
We let a knapsack with a capacity C and a set of candidate
objects (or items), each item has a positive weight wi , and profit pi, if selected, generates an object profit
pi and a pairwise profit pij with any other selected object j. The objective of the QKP is to select a subset
of objects to fill the knapsack so as to maximize the overall profit P,while the overall weight does not
exceed the knapsack capacity C. This problem is known as quadratic knapsack problem and has been
shown strongly NP-hard and it has been applied with a variety of important applications, such as, in the
location of satellites, airports, railway stations or freight terminals.
The proposed method is mainly based on two complementary
phases.In the first phase we use a greedy algorithm for provide the starting solution. In the second phase
we improved the quality of the starting solutions based on a reactive search with applying a destroy and
repair process, the reactive phase is based both diversification and intensification strategy. The obtained
results are compared to those reached by the Cplex solverl and literature. Consequently, the experimental
results show the effectiveness of the proposed approach, and the computational results show that the
algorithm is capable of solving instances of the QKP that cannot be solved by other methods.
Author No Presensi Nama
Hao Qian, Qingyong Zhang, Deming Lei, Zixiao Pan School of Automation 1 Amir

1 Amir

1 Amir
Al-iedani, Najat 2 Budi
Hifi, Mhand
Saadi, Toufik

3
3

6
7

9
10

10

10

11

11

11

12

12

12

13
13
13

14

14

14

15

15

15

16

16

16
17

17

17

18

18

18

19

19

19
20

20

20

21

21

21

22

22

22
23

23

23

24

24

24

25

25

25

26
26

26

27

27

27

28

28

28

29

29
29

30

30

30

31

31
31

32

32

32

33

33
33

34

34

34

35

35

35

36

36

36
37

37

37

38

38

38

39

39

39

40
40

40

41

41

41
Jenis Knapsack Problem Methode Detail Method Comparation Testing Number of Problem Testing
Knapsack Problem Corporate Fruit Fly CFOA FOR KNAPSACK PROBLEM 1. Corporate Fruit Fly 10
Optimization Algorithm A. Encoding scheme Optimization (CFOA)
B. Population generation 2. basic fruit fly optimization
C. Smell-based search (FOA)
D. Cooperation process 3. Cognitive discrete
E. Repair operator gravitational search Algorithm
F. Vision-based search (CDGSA)
Quadratic Knapsack Problem Reactive Search (1) Greedy algorithm for N/A 10
construct the starting solution
(2) Reactive search for
improving the quality of the
starting solutions
Result / Conclusion Future Work
For the small-scale instances, it is testing its efficiency to solve large scale
demonstrated that the proposed knapsack problems and applying the FOA-
CFOA perform much better than based algorithm to other kind of knapsack
CDGSA and FOA. CFOA have the problems like nonlinear knapsack
ability to achieve the optimal problems, 0-1 quadratic knapsack
solution of problems during every problem and multidimensional knapsack
independent run in the first iteration problems
• A greedy procedure that iteratively N/A
introduces an item with best
efficiency into the knapsack for
construct a
starting solutions.
• A reactive search to improve the
quality of the starting solutions .