메뉴 건너뛰기




Volumn 14, Issue , 2014, Pages 66-75

Improved binary artificial fish swarm algorithm for the 0-1 multidimensional knapsack problems

Author keywords

0 1 knapsack problem; Artificial fish swarm; Decoding algorithm; Multidimensional knapsack

Indexed keywords


EID: 84895062423     PISSN: 22106502     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.swevo.2013.09.002     Document Type: Article
Times cited : (94)

References (46)
  • 1
    • 0001497251 scopus 로고
    • Computational experience with variants of the balas algorithm applied to the selection of R&D projects
    • C.C. Petersen Computational experience with variants of the balas algorithm applied to the selection of R&D projects Management Science 13 9 1967 736 750
    • (1967) Management Science , vol.13 , Issue.9 , pp. 736-750
    • Petersen, C.C.1
  • 3
    • 0021886787 scopus 로고
    • Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
    • B. Gavish, and H. Pirkul Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality Mathematical Programming 31 1985 78 105
    • (1985) Mathematical Programming , vol.31 , pp. 78-105
    • Gavish, B.1    Pirkul, H.2
  • 4
    • 84974859764 scopus 로고
    • A branch and bound method for the multiconstraint zero-one knapsack problem
    • W. Shih A branch and bound method for the multiconstraint zero-one knapsack problem Journal of the Operational Research Society 30 1979 369 378
    • (1979) Journal of the Operational Research Society , vol.30 , pp. 369-378
    • Shih, W.1
  • 5
    • 0004218571 scopus 로고    scopus 로고
    • Ph.D. Thesis, Department of Computer Science, University of Copenhagen, Denmark, 1995. 〈 âŒ
    • D. Pisinger, Algorithms for knapsack problems, Ph.D. Thesis, Department of Computer Science, University of Copenhagen, Denmark, 1995. 〈 http://www.diku.dk/hjemmesider/ansatte/pisinger/ âŒ.
    • Algorithms for Knapsack Problems
    • Pisinger, D.1
  • 6
    • 35349021400 scopus 로고    scopus 로고
    • A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
    • S. Balev, N. Yanev, A. Fréville, and R. Andonov A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem European Journal of Operational Research 166 2008 63 76
    • (2008) European Journal of Operational Research , vol.166 , pp. 63-76
    • Balev, S.1    Yanev, N.2    Fréville, A.3    Andonov, R.4
  • 7
    • 0001889296 scopus 로고
    • Methods for the solution of the multidimensional 0/1 knapsack problem
    • H.M. Weingartner, and D.N. Ness Methods for the solution of the multidimensional 0/1 knapsack problem Operations Research 15 1967 83 103
    • (1967) Operations Research , vol.15 , pp. 83-103
    • Weingartner, H.M.1    Ness, D.N.2
  • 8
    • 0030231834 scopus 로고    scopus 로고
    • The 0-1 bidimensional knapsack problem towards an efficient high-level primitive tool
    • A. Fréville, and G. Plateau The 0-1 bidimensional knapsack problem towards an efficient high-level primitive tool Journal of Heuristics 2 1996 147 167
    • (1996) Journal of Heuristics , vol.2 , pp. 147-167
    • Fréville, A.1    Plateau, G.2
  • 9
    • 0343752702 scopus 로고
    • An enumeration algorithm for knapsack problems
    • A.V. Cabot An enumeration algorithm for knapsack problems Operations Research 18 1970 306 311
    • (1970) Operations Research , vol.18 , pp. 306-311
    • Cabot, A.V.1
  • 14
    • 77952042144 scopus 로고    scopus 로고
    • The multidimensional knapsack problem structure and algorithms
    • J. Puchinger, G.R. Raidl, and U. Pferschy The multidimensional knapsack problem structure and algorithms INFORMS Journal on Computing 22 2 2010 250 265
    • (2010) INFORMS Journal on Computing , vol.22 , Issue.2 , pp. 250-265
    • Puchinger, J.1    Raidl, G.R.2    Pferschy, U.3
  • 15
    • 0023861635 scopus 로고
    • A simulated annealing approach to the multiconstraint zero-one knapsack problem
    • A. Drexl A simulated annealing approach to the multiconstraint zero-one knapsack problem Computing 40 1988 1 8
    • (1988) Computing , vol.40 , pp. 1-8
    • Drexl, A.1
  • 16
    • 0032045852 scopus 로고    scopus 로고
    • An efficient tabu search approach for the 0-1 multidimensional knapsack problem
    • S. Hanafi, and A. Fréville An efficient tabu search approach for the 0-1 multidimensional knapsack problem European Journal of Operational Research 106 1998 659 675
    • (1998) European Journal of Operational Research , vol.106 , pp. 659-675
    • Hanafi, S.1    Fréville, A.2
  • 17
    • 12344257761 scopus 로고    scopus 로고
    • Improved results on the 0-1 multidimensional knapsack problem
    • M. Vasquez, and Y. Vimont Improved results on the 0-1 multidimensional knapsack problem European Journal of Operational Research 165 2005 70 81
    • (2005) European Journal of Operational Research , vol.165 , pp. 70-81
    • Vasquez, M.1    Vimont, Y.2
  • 18
    • 0032090794 scopus 로고    scopus 로고
    • A genetic algorithm for the multidimensional knapsack problem
    • P.C. Chu, and J.E. Beasley A genetic algorithm for the multidimensional knapsack problem Journal of Heuristics 4 1998 63 86
    • (1998) Journal of Heuristics , vol.4 , pp. 63-86
    • Chu, P.C.1    Beasley, J.E.2
  • 19
    • 0037290083 scopus 로고    scopus 로고
    • Genetic algorithms with double strings for 0-1 programming problems
    • M. Sakawa, and K. Kato Genetic algorithms with double strings for 0-1 programming problems European Journal of Operational Research 144 2003 581 597
    • (2003) European Journal of Operational Research , vol.144 , pp. 581-597
    • Sakawa, M.1    Kato, K.2
  • 21
    • 36849024458 scopus 로고    scopus 로고
    • A new ant colony optimization algorithm for the multidimensional knapsack problem
    • M. Kong, P. Tian, and Y. Kao A new ant colony optimization algorithm for the multidimensional knapsack problem Computers and Operations Research 35 2008 2672 2683
    • (2008) Computers and Operations Research , vol.35 , pp. 2672-2683
    • Kong, M.1    Tian, P.2    Kao, Y.3
  • 22
    • 78751627944 scopus 로고    scopus 로고
    • Solving 0-1 knapsack problem by a novel global harmony search algorithm
    • D. Zou, L. Gao, S. Li, and Z. Wu Solving 0-1 knapsack problem by a novel global harmony search algorithm Applied Soft Computing 11 2011 1556 1564
    • (2011) Applied Soft Computing , vol.11 , pp. 1556-1564
    • Zou, D.1    Gao, L.2    Li, S.3    Wu, Z.4
  • 23
    • 33846894350 scopus 로고    scopus 로고
    • Greedy algorithm for the general multidimensional knapsack problem
    • Y. Akçay, H. Li, and S.H. Xu Greedy algorithm for the general multidimensional knapsack problem Annals of Operations Research 150 2007 17 29
    • (2007) Annals of Operations Research , vol.150 , pp. 17-29
    • Akçay, Y.1    Li, H.2    Xu, S.H.3
  • 25
    • 79957603312 scopus 로고    scopus 로고
    • Problem reduction heuristic for the 0-1 multidimensional knapsack problem
    • R.R. Hill, Y.K. Cho, and J.T. Moore Problem reduction heuristic for the 0-1 multidimensional knapsack problem Computers and Operations Research 39 2012 19 26
    • (2012) Computers and Operations Research , vol.39 , pp. 19-26
    • Hill, R.R.1    Cho, Y.K.2    Moore, J.T.3
  • 26
    • 0023332292 scopus 로고
    • A heuristic solution procedure for the multiconstraint zero-one knapsack problem
    • H. Pirkul A heuristic solution procedure for the multiconstraint zero-one knapsack problem Naval Research Logistics 34 1987 161 172
    • (1987) Naval Research Logistics , vol.34 , pp. 161-172
    • Pirkul, H.1
  • 28
  • 29
    • 78651522368 scopus 로고    scopus 로고
    • Image segmentation with improved artificial fish swarm algorithm
    • N. Mastorakis, Springer-Verlag Heidelberg
    • M. Jiang, N. Mastorakis, D. Yuan, and M.A. Lagunas Image segmentation with improved artificial fish swarm algorithm N. Mastorakis, ECC 2008, LNEE vol. 28 2009 Springer-Verlag Heidelberg 133 138
    • (2009) ECC 2008, LNEE , vol.28 , pp. 133-138
    • Jiang, M.1    Mastorakis, N.2    Yuan, D.3    Lagunas, M.A.4
  • 30
    • 73649117518 scopus 로고    scopus 로고
    • Optimal multiuser detection with artificial fish swarm algorithm
    • D.S. Huang, Springer-Verlag Heidelberg
    • M. Jiang, Y. Wang, S. Pfletschinger, M.A. Lagunas, and D. Yuan Optimal multiuser detection with artificial fish swarm algorithm D.S. Huang, ICIC 2007, CCIS vol. 2 2007 Springer-Verlag Heidelberg 1084 1093
    • (2007) ICIC 2007, CCIS , vol.2 , pp. 1084-1093
    • Jiang, M.1    Wang, Y.2    Pfletschinger, S.3    Lagunas, M.A.4    Yuan, D.5
  • 32
    • 84883883710 scopus 로고    scopus 로고
    • An artificial fish swarm algorithm based and abc supported QoS unicast routing scheme in NGI
    • G. Min, Springer-Verlag Heidelberg
    • X. Wang, N. Gao, S. Cai, and M. Huang An artificial fish swarm algorithm based and abc supported QoS unicast routing scheme in NGI G. Min, ISPA 2006, Lecture Notes in Computer Sciences vol. 4331 2006 Springer-Verlag Heidelberg 205 214
    • (2006) ISPA 2006, Lecture Notes in Computer Sciences , vol.4331 , pp. 205-214
    • Wang, X.1    Gao, N.2    Cai, S.3    Huang, M.4
  • 35
    • 84924406244 scopus 로고    scopus 로고
    • Artificial fish swarm algorithm a survey of the state-of-The-art, hybridization, combinatorial and indicative applications
    • 10.1007/s10462-012-9342-2
    • M. Neshat, G. Sepidnam, M. Sargolzaei, and A.N. Toosi Artificial fish swarm algorithm a survey of the state-of-the-art, hybridization, combinatorial and indicative applications Artificial Intelligence Review 2012 10.1007/s10462-012-9342-2
    • (2012) Artificial Intelligence Review
    • Neshat, M.1    Sepidnam, G.2    Sargolzaei, M.3    Toosi, A.N.4
  • 36
    • 84875210170 scopus 로고    scopus 로고
    • S-shaped versus V-shaped transfer functions for binary particle swarm optimization
    • S. Mirjalili, and A. Lewis S-shaped versus V-shaped transfer functions for binary particle swarm optimization Swarm and Evolutionary Computation 9 2013 1 14
    • (2013) Swarm and Evolutionary Computation , vol.9 , pp. 1-14
    • Mirjalili, S.1    Lewis, A.2
  • 37
    • 84875219094 scopus 로고    scopus 로고
    • Hybrid improved binary particle swarm optimization approach for generation maintenance scheduling problem
    • K. Suresh, and N. Kumarappan Hybrid improved binary particle swarm optimization approach for generation maintenance scheduling problem Swarm and Evolutionary Computation 9 2013 69 89
    • (2013) Swarm and Evolutionary Computation , vol.9 , pp. 69-89
    • Suresh, K.1    Kumarappan, N.2
  • 38
    • 84862849244 scopus 로고    scopus 로고
    • A modified binary particle swarm optimization for knapsack problems
    • J.C. Bansal, and K. Deep A modified binary particle swarm optimization for knapsack problems Applied Mathematics and Computation 218 22 2012 11042 11061
    • (2012) Applied Mathematics and Computation , vol.218 , Issue.22 , pp. 11042-11061
    • Bansal, J.C.1    Deep, K.2
  • 39
    • 84885426987 scopus 로고    scopus 로고
    • Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
    • Z. Beheshti, S.M. Shamsuddin, and S.S. Yuhaniz Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems Journal of Global Optimization 57 2 2013 549 573
    • (2013) Journal of Global Optimization , vol.57 , Issue.2 , pp. 549-573
    • Beheshti, Z.1    Shamsuddin, S.M.2    Yuhaniz, S.S.3
  • 41
    • 84871145567 scopus 로고    scopus 로고
    • Set-based particle swarm optimization applied to the multidimensional knapsack problem
    • J. Langeveld, and A.P. Engelbrecht Set-based particle swarm optimization applied to the multidimensional knapsack problem Swarm Intelligence 6 2012 297 342
    • (2012) Swarm Intelligence , vol.6 , pp. 297-342
    • Langeveld, J.1    Engelbrecht, A.P.2
  • 42
    • 77954773201 scopus 로고    scopus 로고
    • A novel probability binary particle swarm optimization algorithm and its application
    • L. Wang, X. Wang, J. Fu, and L. Zhen A novel probability binary particle swarm optimization algorithm and its application Journal of Software 3 9 2008 28 35
    • (2008) Journal of Software , vol.3 , Issue.9 , pp. 28-35
    • Wang, L.1    Wang, X.2    Fu, J.3    Zhen, L.4
  • 44
    • 77952305482 scopus 로고    scopus 로고
    • Geometric generalization of the Nelder-Mead algorithm
    • P. Cowling, P. Merz, Springer-Verlag Heidelberg
    • A. Moraglio, and C.G. Johnson Geometric generalization of the Nelder-Mead algorithm P. Cowling, P. Merz, EvoCOP 2010, Lecture Notes in Computer Sciences vol. 6022 2010 Springer-Verlag Heidelberg 190 201
    • (2010) EvoCOP 2010, Lecture Notes in Computer Sciences , vol.6022 , pp. 190-201
    • Moraglio, A.1    Johnson, C.G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.