메뉴 건너뛰기




Volumn 19, Issue , 2014, Pages 252-263

Shuffled frog leaping algorithm and its application to 0/1 knapsack problem

Author keywords

Discrete shuffled frog leaping algorithm; Genetic mutation; Knapsack problem; Meta heuristics

Indexed keywords

ALGORITHMS; PARTICLE SWARM OPTIMIZATION (PSO);

EID: 84896534992     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2014.02.010     Document Type: Article
Times cited : (102)

References (31)
  • 1
    • 35848970555 scopus 로고    scopus 로고
    • Selection among ranked projects under segmentation, policy and logical constraints
    • DOI 10.1016/j.ejor.2007.03.010, PII S0377221707003074
    • G. Mavrotas, D. Diakoulaki, and A. Kourentzis Selection among ranked projects under segmentation, policy and logical constraints European Journal of Operational Research 187 2008 177 192 (Pubitemid 350061096)
    • (2008) European Journal of Operational Research , vol.187 , Issue.1 , pp. 177-192
    • Mavrotas, G.1    Diakoulaki, D.2    Kourentzis, A.3
  • 3
    • 80054923943 scopus 로고    scopus 로고
    • A constrained binary knapsack approximation for shortest path network interdiction
    • J. Yates, and K. Lakshmanan A constrained binary knapsack approximation for shortest path network interdiction Computers & Industrial Engineering 61 2011 981 992
    • (2011) Computers & Industrial Engineering , vol.61 , pp. 981-992
    • Yates, J.1    Lakshmanan, K.2
  • 4
  • 6
    • 34548692952 scopus 로고    scopus 로고
    • Solving the knapsack problem with imprecise weight coefficients using genetic algorithms
    • F.T. Lin Solving the knapsack problem with imprecise weight coefficients using genetic algorithms European Journal of Operational Research 185 2008 133 145
    • (2008) European Journal of Operational Research , vol.185 , pp. 133-145
    • Lin, F.T.1
  • 8
    • 33845979112 scopus 로고    scopus 로고
    • A novel quantum swarm evolutionary algorithm and its applications
    • DOI 10.1016/j.neucom.2006.10.001, PII S0925231206002657
    • Y. Wanga, X. Feng, Y. Huang, D. Pub, W. Zhoua, Y. Liang, and C. Zhou A novel quantum swarm evolutionary algorithm and its applications Neurocomputing 70 2007 633 640 (Pubitemid 46043961)
    • (2007) Neurocomputing , vol.70 , Issue.4-6 , pp. 633-640
    • Wang, Y.1    Feng, X.-Y.2    Huang, Y.-X.3    Pu, D.-B.4    Zhou, W.-G.5    Liang, Y.-C.6    Zhou, C.-G.7
  • 9
    • 46249121520 scopus 로고    scopus 로고
    • Solution to 0/1 knapsack problem based on improved ant colony algorithm
    • H.X. Shi Solution to 0/1 knapsack problem based on improved ant colony algorithm International Conference on Information Acquisition 2006 1062 1066
    • (2006) International Conference on Information Acquisition , pp. 1062-1066
    • Shi, H.X.1
  • 10
    • 70449436449 scopus 로고    scopus 로고
    • A novel multi-mutation binary particle swarm optimization for 0/1 knapsack problem
    • Z.K. Li, and N. Li A novel multi-mutation binary particle swarm optimization for 0/1 knapsack problem Control and Decision Conference 2009 3042 3047
    • (2009) Control and Decision Conference , pp. 3042-3047
    • Li, Z.K.1    Li, N.2
  • 11
    • 78751627944 scopus 로고    scopus 로고
    • Solving 0-1 knapsack problem by a novel global harmony search algorithm
    • 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
    • (2011) Applied Soft Computing , vol.11 , pp. 1556-1564
    • Zou, D.1    Gao, L.2    Li, S.3    Wu, J.4
  • 12
    • 33244474874 scopus 로고    scopus 로고
    • Shuffled frog-leaping algorithm: A memetic meta-heuristic for discrete optimization
    • DOI 10.1080/03052150500384759, PII R65340053330467
    • M.M. Eusuff, K. Lansey, and F. Pasha Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization Engineering Optimization 38 2006 129 154 (Pubitemid 43279596)
    • (2006) Engineering Optimization , vol.38 , Issue.2 , pp. 129-154
    • Eusuff, M.1    Lansey, K.2    Pasha, F.3
  • 14
    • 0038363680 scopus 로고    scopus 로고
    • Optimization of water distribution network design using the shuffled frog leaping algorithm
    • DOI 10.1061/(ASCE)0733-9496(2003)129:3(210)
    • M. Eusuff, and K. Lansey Optimization of water distribution network design using the shuffled frog leaping algorithm Journal of Water Resource Plan Management 129 2003 210 225 (Pubitemid 36562716)
    • (2003) Journal of Water Resources Planning and Management , vol.129 , Issue.3 , pp. 210-225
    • Eusuff, M.M.1    Lansey, K.E.2
  • 15
  • 16
    • 67549104619 scopus 로고    scopus 로고
    • Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm
    • Springer-Verlag New York
    • A. Rahimi-Vahed, and A. Mirzaei Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm Soft Computing 2007 Springer-Verlag New York
    • (2007) Soft Computing
    • Rahimi-Vahed, A.1    Mirzaei, A.2
  • 17
    • 79960557901 scopus 로고    scopus 로고
    • An effective shuffled frog-leaping algorithm for multi-mod resource-constrained project scheduling problem
    • L. Wang, and C. Fang An effective shuffled frog-leaping algorithm for multi-mod resource-constrained project scheduling problem Information Sciences 181 2011 4804 4822
    • (2011) Information Sciences , vol.181 , pp. 4804-4822
    • Wang, L.1    Fang, C.2
  • 19
    • 67549088272 scopus 로고    scopus 로고
    • Solving tsp with shuffled frog-leaping algorithm
    • X.H. Luo, Y. Yang, and X. Li Solving tsp with shuffled frog-leaping algorithm Proc. ISDA, vol. 3 2008 228 232
    • (2008) Proc. ISDA, Vol. 3 , pp. 228-232
    • Luo, X.H.1    Yang, Y.2    Li, X.3
  • 20
    • 22344432656 scopus 로고    scopus 로고
    • Comparison among five evolutionary-based optimization algorithms
    • DOI 10.1016/j.aei.2005.01.004, PII S1474034605000091
    • E. Elbeltagi, T. Hegazy, and D. Grierson Comparison among five evolutionary-based optimization algorithms Advanced Engineering Informatics 19 2005 43 53 (Pubitemid 41000265)
    • (2005) Advanced Engineering Informatics , vol.19 , Issue.1 , pp. 43-53
    • Elbeltagi, E.1    Hegazy, T.2    Grierson, D.3
  • 22
    • 22344437756 scopus 로고    scopus 로고
    • Optimal design of water distribution network using shuffled complex evolution
    • S. Liong, and M. Atiquzzaman Optimal design of water distribution network using shuffled complex evolution Journal of Instrumentation Engineering 44 2004 93 107
    • (2004) Journal of Instrumentation Engineering , vol.44 , pp. 93-107
    • Liong, S.1    Atiquzzaman, M.2
  • 24
    • 78751639079 scopus 로고    scopus 로고
    • On the sequential combination tree algorithm for 0-1 knapsack problem
    • C. An, and Y.J. Fu On the sequential combination tree algorithm for 0-1 knapsack problem Journal of Wenzhou University (Natural Sciences) 29 2008 10 14
    • (2008) Journal of Wenzhou University (Natural Sciences) , vol.29 , pp. 10-14
    • An, C.1    Fu, Y.J.2
  • 25
    • 78650327210 scopus 로고    scopus 로고
    • Study of greedy-policy-based algorithm for 0/1 knapsack problem
    • W. You Study of greedy-policy-based algorithm for 0/1 knapsack problem Computer and Modernization 4 2007 10 16
    • (2007) Computer and Modernization , vol.4 , pp. 10-16
    • You, W.1
  • 27
    • 34250403783 scopus 로고
    • Resolution of the 0-1 knapsack problem comparison of methods
    • D. Fayard, and G. Plateau Resolution of the 0-1 knapsack problem comparison of methods Mathematical Programming 8 1975 272 307
    • (1975) Mathematical Programming , vol.8 , pp. 272-307
    • Fayard, D.1    Plateau, G.2
  • 29
    • 58149295134 scopus 로고    scopus 로고
    • DNA ligation design and biological realization of knapsack problem
    • Y. Zhu, L.H. Ren, and Y. Ding DNA ligation design and biological realization of knapsack problem Chinese Journal of Computers 31 2008 2207 2214
    • (2008) Chinese Journal of Computers , vol.31 , pp. 2207-2214
    • Zhu, Y.1    Ren, L.H.2    Ding, Y.3
  • 30
    • 78650392048 scopus 로고    scopus 로고
    • Research on the algorithm for 0/1 knapsack problem
    • B.D. Li Research on the algorithm for 0/1 knapsack problem Computer and Digital Engineering 5 2008 23 26
    • (2008) Computer and Digital Engineering , vol.5 , pp. 23-26
    • Li, B.D.1


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