Abstract
Shuffled frog-leaping algorithm (SFLA) has long been considered as new evolutionary algorithm of group evolution, and has a high computing performance and excellent ability for global search. Knapsack problem is a typical NP-complete problem. For the discrete search space, this paper presents the improved SFLA (ISFLA), and solves the knapsack problem by using the algorithm. Experimental results show the feasibility and effectiveness of this method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eusuff, M.M., Lansey, K.E.: Optimization of water distribution network design using the shuffled frog leaping algorithm. Water Resource Planning and Management 129(3), 210–225 (2003)
Li, Y.-H., Zhou, J.-Z., Yang, J.-J.: An improved shuffled frog-leaping algorithm based on the selection strategy of threshold. Computer Engineering and Applications 43(35), 19–21 (2007)
Luo, X.-H., Yang, Y., Li, X.: Improved shuffled frog-leaping algorithm for TSP. Journal of Communication 30(7), 130–135 (2009)
He, Y.-C.: Greedy genetic algorithm and its application for KP. Computer Engineering and Design 28(11), 19–22 (2007)
Wu, Z.-H.: Algorithm Design and Analysis, pp. 251–252. Higher Education Press, Beijing (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Li, Z., Zhou, Y., Cheng, P. (2012). An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem. In: Jin, D., Lin, S. (eds) Advances in Computer Science and Information Engineering. Advances in Intelligent and Soft Computing, vol 169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30223-7_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-30223-7_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30222-0
Online ISBN: 978-3-642-30223-7
eBook Packages: EngineeringEngineering (R0)