Solving 0-1 knapsack problems based on amoeboid organism algorithm

Applied Mathematics and Computation

Volumn 219, Issue 19, 2013, Pages 9959-9970

  Zhang, Xiaoge ^a   Huang, Shiyan ^a   Hu, Yong ^b   Zhang, Yajuan ^a   Mahadevan, Sankaran ^c   Deng, Yong ^a,c  

^a SOUTHWEST UNIVERSITY   (China)

^b GUANGDONG UNIVERSITY OF FOREIGN STUDIES   (China)

^c VANDERBILT UNIVERSITY   (United States)

Author keywords

0 1 Knapsack problem; Bio inspired algorithm; Network converting algorithm; Optimization; Shortest path problem

Indexed keywords

0-1 KNAPSACK PROBLEM; BIO-INSPIRED ALGORITHMS; BIO-INSPIRED MODELS; DISCRETE OPTIMIZATION PROBLEMS; LONGEST PATH PROBLEMS; NUMERICAL EXAMPLE; REAL APPLICATIONS; SHORTEST PATH PROBLEM;

ALGORITHMS; BIOLOGY; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; OPTIMIZATION;

PROBLEM SOLVING;

EID: 84877341037     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2013.04.023     Document Type: Article

References (48)

1. H. Kellerer, and V. Strusevich Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications Algorithmica 57 4 2010 769 795
2. J. Tavares, F. Pereira, and E. Costa Multidimensional knapsack problem: a fitness landscape analysis IEEE Trans. Syst. Man Cybern. Part B Cybern. 38 3 2008 604 616 (Pubitemid 351796143)
3. T.K. Truong, K. Li, and Y. Xu Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem Appl. Soft Comput. 13 4 2013 1774 1780
4. F. Mardukhi, N. NematBakhsh, K. Zamanifar, A. Barati, QoS decomposition for service composition using genetic algorithm, Appl. Soft Comput. http://dx.doi.org/10.1016/j.asoc.2012.12.033.
5. E. Bas A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0-1 bidimensional knapsack model Expert Syst. Appl. 38 10 2011 12415 12422
6. C. Wilbaut, S. Hanafi, and S. Salhi A survey of effective heuristics and their application to a variety of knapsack problems IMA J. Manage. Math. 19 3 2008 227
7. G. Wascher, and H. Schumann An improved typology of cutting and packing problems Eur. J. Oper. Res. 183 3 2007 1109 1130 (Pubitemid 47030730)
8. J. Nawrocki, W. Complak, J. Błażewicz, S. Kopczyńska, and M. Maćkowiaki The knapsack-lightening problem and its application to scheduling HRT tasks Bull. Polish Acad. Sci.: Tech. Sci. 57 1 2009 71 77
9. M. Kong, P. Tian, and Y. Kao A new ant colony optimization algorithm for the multidimensional knapsack problem Comput. Oper. Res. 35 8 2008 2672 2683 (Pubitemid 350235140)
10. O. Granmo, B. Oommen, S. Myrer, and M. Olsen Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation IEEE Trans Syst. Man Cybern. Part B Cybern. 37 1 2007 166 175 (Pubitemid 46358489)
11. D. Vanderster, N. Dimopoulos, R. Parra-Hernandez, and R. Sobie Resource allocation on computational grids using a utility model and the knapsack problem Future Gener. Comput. Syst. 25 1 2009 35 50
12. Y. Deng, Y. Chen, Y. Zhang, and S. Mahadevan Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment Appl. Soft Comput. 12 2011 1231 1237
13. G. Mavrotas, D. Diakoulaki, and A. Kourentzis Selection among ranked projects under segmentation, policy and logical constraints Eur. J. Oper. Res. 187 1 2008 177 192 (Pubitemid 350061096)
14. R. Kumar, and P. Singh Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms Appl. Soft Comput. 10 3 2010 711 718
15. L. McLay, and S. Jacobson Algorithms for the bounded set-up knapsack problem Discrete Optim. 4 2 2007 206 212 (Pubitemid 46551944)
16. C. Gao, J. Liu, and N. Zhong Network immunization with distributed autonomy-oriented entities IEEE Trans. Parallel Distrib. Syst. 22 7 2011 1222 1229
17. C. Gao, and J. Liu Modeling and restraining mobile virus propagation IEEE Trans. Mob. Comput. 12 3 2013 529 541
18. S. Balev, N. Yanev, A. Fréville, and R. Andonov A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem Eur. J. Oper. Res. 186 1 2008 63 76 (Pubitemid 47600516)
19. A. Rong, J. Figueira, and K. Klamroth Dynamic programming based algorithms for the discounted {0-1} knapsack problem Appl. Math. Comput. 218 2 2012 6921 6933
20. D. Vanderpooten, H. Hugot, and C. Bazgan Solving efficiently the 0-1 multi-objective knapsack problem Comput. Oper. Res. 36 1 2009 260 279
21. F. Ghassemi-Tari, and E. Jahangiri Development of a hybrid dynamic programming approach for solving discrete nonlinear knapsack problems Appl. Math. Comput. 188 1 2007 1023 1030 (Pubitemid 46686784)
22. F. Jolai, M. Rezaee, M. Rabbani, J. Razmi, and P. Fattahi Exact algorithm for bi-objective 0-1 knapsack problem Appl. Math. Comput. 194 2 2007 544 551 (Pubitemid 350088997)
23. G. Mavrotas, J. Figueira, and K. Florios Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core Appl. Math. Comput. 215 7 2009 2502 2514
24. M. Pérez-Jiménez, and A. Riscos-Núnez A linear-time solution to the knapsack problem using P systems with active membranes Lect. Notes Comput. Sc. 2933 2004 3 34
25. M. Hifi, H. M'Halla, and S. Sadfi An exact algorithm for the knapsack sharing problem Comput. Oper. Res. 32 5 2005 1311 1324
26. M. Hifi, and H. Mhalla The knapsack sharing problem: a tree search exact algorithm Eng. Tech. 66 2010 661 664
27. M. Darehmiraki, and H. Nehi A surface-based DNA algorithm for the solving binary knapsack problem Appl. Math. Comput. 188 2 2007 1991 1994 (Pubitemid 46710088)
28. H. Shi, Solution to 0-1 knapsack problem based on improved ant colony algorithm, in: IEEE International Conference on Information Acquisition 2006, pp. 1062-1066.
29. A. Bortfeldt, and T. Winter A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces Int. Trans. Oper. Res. 16 6 2009 685 713
30. J.C. Bansal, and K. Deep A modified binary particle swarm optimization for knapsack problems Appl. Math. Comput. 218 22 2012 11042 11061
31. M.M. Baldi, G. Perboli, and R. Tadei The three-dimensional knapsack problem with balancing constraints Appl. Math. Comput. 218 19 2012 9802 9818
32. X. Zhang, Y. Deng, F.T.S. Chan, P. Xu, S. Mahadevan, Y. Hu, IFSJSP: a novel methodology for the job-shop scheduling problem based on intuitionistic fuzzy sets, Int. J. Prod. Res. http://dx.doi.org/10.1080/00207543.2013.793425.
33. Z. Hua, and F. Huang An effective genetic algorithm approach to large scale mixed integer programming problems Appl. Math. Comput. 174 2 2006 897 909
34. S. El Moumen, R. Ellaia, and R. Aboulaich A new hybrid method for solving global optimization problem Appl. Math. Comput. 218 7 2009 3265 3276
35. P. Chu, and J. Beasley A genetic algorithm for the multidimensional knapsack problem J. Heuristics 4 1 1998 63 86 (Pubitemid 128512788)
36. F. Hembecker, H. Lopes, and W. Godoy Particle swarm optimization for the multidimensional knapsack problem Adapt. Natur. Comput. Algorithms 4431 2007 358 365
37. I. Trelea The particle swarm optimization algorithm: convergence analysis and parameter selection Inform. Process. Lett. 85 6 2003 317 325
38. A. Tero, S. Takagi, T. Saigusa, K. Ito, D. Bebber, M. Fricker, K. Yumiki, R. Kobayashi, and T. Nakagaki Rules for biologically inspired adaptive network design Science 327 5964 2010 439 442
39. T. Nakagaki, H. Yamada, and A. Toth Path finding by tube morphogenesis in an amoeboid organism Biophys. Chem. 92 1-2 2001 47 52 (Pubitemid 32799125)
40. X. Zhang, Z. Zhang, Y. Zhang, D. Wei, and Y. Deng Route selection for emergency logistics management: a bio-inspired algorithm Saf. Sci. 54 2013 87 91
41. Y. Zhang, Z. Zhang, Y. Deng, and S. Mahadevan A biologically inspired solution for fuzzy shortest path problems Appl. Soft Comput. 13 5 2013 2356 2363
42. A. Tero, R. Kobayashi, and T. Nakagaki A mathematical model for adaptive transport network in path finding by true slime mold J. Theor. Biol. 244 4 2007 553 564 (Pubitemid 46148964)
43. R. Ahuja, T. Magnanti, J. Orlin, and K. Weihe Network flows: theory, algorithms and applications ZOR - Methods Models Oper. Res. 41 3 1995 252 254
44. M. Eugénia Captivo, J. Clìmaco, J. Figueira, E. Martins, and J. Luis Santos Solving bicriteria 0-1 knapsack problems using a labeling algorithm Comput. Oper. Res. 30 12 2003 1865 1886 (Pubitemid 36893357)
45. G. Zhang, H. Yang, and Z. Liu Using watering algorithm to find the optimal paths of a maze Computer 24 8 2007 171 173
46. T. Nakagaki, H. Yamada, and Á. Tóth Maze-solving by an amoeboid organism Nature 407 6803 2000 470
47. K. Habgood, and I. Arel A condensation-based application of Cramer's rule for solving large-scale linear systems J. Discrete Algorithms 10 2012 98 109
48. D. Zou, L. Gao, S. Li, and J. Wu Solving 0-1 knapsack problem by a novel global harmony search algorithm Appl. Soft Comput. 11 2 2011 1556 1564