An Ant colony optimization approach for binary knapsack problem under fuzziness

Applied Mathematics and Computation

Volumn 223, Issue , 2013, Pages 243-253

  Changdar, C ^a   Mahapatra, G S ^b   Pal, R K ^c  

^a Raja Narendra Lal Khan Women's College   (India)

^b NATIONAL INSTITUTE OF TECHNOLOGY PUDUCHERRY   (India)

^c UNIVERSITY OF CALCUTTA   (India)

Author keywords

Ant colony optimization; Candidate value; Knapsack problem; Necessity; Possibility; Trapezoidal fuzzy number

Indexed keywords

CANDIDATE VALUE; KNAPSACK PROBLEMS; NECESSITY; POSSIBILITY; TRAPEZOIDAL FUZZY NUMBERS;

ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; FUZZY RULES; FUZZY SYSTEMS;

ALGORITHMS;

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

References (32)

1. A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian Ant system for job-shop scheduling Belgian Journal of Operations Research, Statistics and Computer Science 34 1 1994 39 53
2. A. Fréville The multidimensional 0-1 knapsack problem: an overview European Journal of Operational Research. 155 2004 1 21
3. B. Liu, and K. Iwamura A note on chance constrained programming with fuzzy coefficients Fuzzy Sets and Systems 100 1998 229 233 (Pubitemid 128654404)
4. C. Peng, Z. Jian, Li. Liu, Solving 0-1 knapsack problems by a discrete binary version of differential evolution, in: Second International Symposium on Intelligent Information Technology Application, IITA '08, vol. 2, 2008, pp. 513-516.
5. D. Zou, L. Gao, S. Li, and J. Wu Solving 0-1 knapsack problem by a novel global harmony search algorithm Applied Soft Computing 11 2011 1556 1564
6. D. Dubois, and H. Prade Fuzzy Sets and System-Theory and Application 1980 Academic New York
7. E. Bas A capital budgeting problem for preventing workplace mobbing using analytic hierarchy process and fuzzy 0-1 bidimensional knapsack model Expert System with Application 38 10 2011 12415 12422
8. E. Bas, and C. Kahraman Fuzzy capital rationing model Journal of Computer and Applied Mathematics 224 2 2009 628 645
9. F.T. Lin Solving the knapsack problem with imprecise weight coefficients using genetic algorithms European Journal of Operational Research 185 1 2008 133 145
10. F.T. Lin, and J.S. Yao Using fuzzy numbers in knapsack problems European Journal of Operational Research 135 2001 158 176
11. H. Huo, J. Xu, and Z. Bao Solving 0-1 knapsack problem using genetic algorithm Journal of Xidian University 26 4 1999 493 497
12. H. Kellerer, U. Pferschy, and D. Pisinger Knapsack Problems 2004 Springer Berlin
13. J.C. Bansal, and K. Deep A modified binary particle swarm optimization for knapsack problems Applied Mathematics and Computation 218 22 2012 11042 11061
14. J. Xiao, and L. Li A hybrid ant colony optimization for continuous domains Expert Systems with Applications 38 2011 11072 11077
15. K. Socha, and M. Dorigo Ant colony optimization for continuous domains European Journal of Operational Research 185 2008 1155 1173 (Pubitemid 47505285)
16. L.A. Zadeh Fuzzy sets as a basis for a theory of possibility Fuzzy Sets and Systems 1 1978 3 28
17. L.M. Gambardella, M. Dorigo, HAS-SOP: an hybrid ant system for the sequential ordering problem, Technical Report IDSIA, 97-11, Lugano, Switzerland, 1997.
18. M. Dorigo, V. Maniezzo, and A. Colorni The ant system: optimization by a colony of cooperating agents IEEE Transactions on Systems, Man, and Cybernetics-Part B 26 1 1996 28 41
19. M. Dorigo, and L.M. Gambardella Ant colony system: a co-operative learning approach to the travelling salesman problem IEEE Transactions on Evloutionary Computing 1 1 1997 53 56
20. M. Kong, P. Tian, and Y. Kao A new ant colony optimization algorithm for the multidimensional Knapsack problem Computers & Operations Research 35 8 2008 2672 2683 (Pubitemid 350235140)
21. P.C. Chu, and J.E. Beasley A genetic algorithm for the multidimensional knapsack problem Journal of Heuristics 4 1998 63 86 (Pubitemid 128512788)
22. S.J. Chen, and C.L. Hwang Fuzzy Multiple Attribute Decision Making: Methods and Applications 1992 Springer Berlin, Heidelberg, NewYork
23. S. Martello, and P. Toth Knapsack Problems: Algorithms and Computer Implementations 1990 John Wiley & Sons New York
24. S.P. Chen Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights Applied Mathematical Modelling 33 7 2009 2927 2933
25. T.K. Truong, K. Li, and Y. Xu Chemical reaction optimization with greedy strategy for the 0-1 knapsack problem Applied Soft Computing 13 4 2013 1774 1780
26. V. Maniezzo, and A. Carbonaro An ANTS heuristic for the frequency assignment problem Future Generation Computer Systems 16 2000 927 935
27. V. Maniezzo Exact and approximate nonditerministic tree search procedures for the quadratic assignment problem INFORMS Journal of Computing 11 1999 358 369
28. X.M. Hu, J. Zhang, and Y. Li Orthogonal methods based ant colony search for solving continuous optimization problems Journal of Computer Science and Technology 23 1 2008 2 18 (Pubitemid 351192919)
29. X. Shen, W. Wang, and P. Zheng Modified particle swarm optimization for 0-1 knapsack problem Computer Engineering 32 18 2006 23 24
30. X. Zhang, S. Huang, Y. Hu, Y. Zhang, S. Mahadevan, and Y. Deng Solving 0-1 knapsack problems based on amoeboid organism algorithm Applied Mathematics and Computation 219 19 2013 9959 9970
31. Y. Liu, C. Liu, Schema-guiding evolutionary algorithm for 0-1 knapsack problem, in: International Association of Computer Science and Information Technology-Spring Conference, 2009, pp. 160-164.
32. Z. Ren, Z. Feng, and A. Zhang Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem Information Sciences 182 1 2012 15 29