Abstract
Ant Colony Algorithm is a new bionic algorithm which adopts the positive feedback structure, combines parallel computing and heuristic factors. It showed remarkable performance in combinatorial optimization problem. One-dimensional Cutting Stock is one of the classic NP-hard combinatorial optimization problems. It is widely applied in engineering technology and industrial production. Aiming at the specific characteristics of the problem, a series of improvement strategies and the specific algorithm implementation steps are given. Then the parameters are analyzed in details. Through experiment analysis and results comparison, it is proved that the improvement strategies and adjusted parameters have advantages in implementation efficiency and solving ability.
This is a preview of subscription content, log in via an institution to check access.
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
Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Proceedings of 1st European Conference on Artificial Life, Paris,France, pp. 134–142. Elsevier publishing, Amsterdam (1991)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)
Huang, L., Zhou, C.G., Wang, K.P.: Hybrid Ant Colony Algorithm for Traveling Salesman Problem. Progress in Nature Science 13, 295–299 (2003)
Jia, Z.X., Yin, G.F., Hu, X.B., Shu, B.: Optimization for One-Dimensional Cutting-Stock Problem Based on Genetic Algorithm. Journal of Xi an Jiaotong University 36, 967–970 (2002)
Umetani, S., Yagiura, M., et al.: One-dimensional Cutting-stock Problem with a Given Number of Setups: A hybrid Approach of Metaheuristics and Linear Programming. Journal of Mathematical Modelling and Algorithms 5, 43–64 (2006)
Wang, L.J.: Research and Development on One Dimensional Optimum Cutting System Base Linear Programming. Master Thesis of Dalian university of technology (2003)
Wu, Z.J., Zhang, L.P., Wang, K.: An Ant Colony Algorithm for One-dimensional Cutting-stock Problem. Mechanical Science and Technology for Aerospace Engineering 27, 1681–1684 (2008)
Bullnheimer, B., Hartl, R.F., Strauss, C.: A New Rank-based Version of the Ant System: A Computational Study. Central European Journal for Operations Research and Economics 7, 25–38 (1999)
Maniezzo, V., Dorigo, M., Colorni, A.: The Ant System Applied to the Quaddratic Assignment Problem. Technical Report IRIDIA/94~28, Universite de Bruxelles, Belgium (1994)
Operations research textbook compiling group: Operations research. Tsinghua University Press, Beijing (2004)
Duan, H.B.: Theory and Application of Ant Colony Algorithm. Science Press, Beijing (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, L., Chen, H., Yang, B., Zhou, CG. (2009). Research on Improvement Strategies and Parameter Analysis of Ant Colony Algorithm for One-Dimensional Cutting Stock Problem. In: Yu, W., Sanchez, E.N. (eds) Advances in Computational Intelligence. Advances in Intelligent and Soft Computing, vol 116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03156-4_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-03156-4_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03155-7
Online ISBN: 978-3-642-03156-4
eBook Packages: EngineeringEngineering (R0)