Abstract
This paper discusses the circular open dimension problem (CODP), where set of circles of different radii has to be packed into a rectangular strip of predetermined width and variable length. The circle packing problem is one of the variant of cutting and packing problems. We propose four different nature inspired Meta heuristic algorithms for solving this problem. These algorithms are proved to be the best in finding local solutions. The algorithms are based on food foraging process and breeding behavior of some biological species such as bat, bee, firefly and cuckoo. Circle packing problem is one of the NP hard problems. It is very difficult to solve NP hard problems exactly, so the proposed approaches tries to give approximate solution within the stipulated time. The standard benchmark instances are used for comparison, and it is proved that firefly is giving the best solution.
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
Akeb, H., Hifi, M., Negre, S.: An augmented beam search-based algorithm for the circular open dimension problem. Comput. Ind. Eng. 61(2), 373–381 (2011)
Stoyan, Y.G., Yas’kov, G.: A mathematical model and a solution method for the problem of placing various-sized circles into a strip. European Journal of Operational Research 156, 590–600 (2004)
He, Y., Wu, Y.: Packing non-identical circles within a rectangle with open length. J. Global Optim. (2012), doi:10.1007/s10898-012-9948-6
Huang: Greedy algorithms for packing unequal circles into a rectangular container. Journal of the Operational Research Society 56, 539–548 (2005)
Fu, Z., Huang, W., Zhipeng: Iterated tabu search for the circular open dimension problem. European Journal of Operational Research 225, 236–243 (2013)
Hifi, M., Paschos, V.T., Zissimopoulos, V.: A simulated annealing approach for the circular cutting problem. European Journal of Operational Research 159, 430–448 (2004)
Stoyan, Y.G., Yaskov, G.N.: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. International Transactions in Operational Research 5(1), 45–57 (1998)
Lü, Z.P., Hao, J.K.: Adaptive Tabu Search for course timetabling. European Journal of Operational Research 200(1), 235–244 (2010)
Maranas, C.D., Floudas, C.A., Pardalos, P.M.: New results in the packing of equal circles in a square. Discrete Mathematics 142(1), 287–293 (1995)
Huang, W.Q., Ye, T.: Greedy vacancy search algorithm for packing equal circles in a square. Operations Research Letters 38(5), 378–382 (2010)
Huang, W.Q., Ye, T.: Global optimization method for finding dense packings of equal circles in a circle. European Journal of Operational Research 210(3), 474–481 (2011)
Yang, X.-S.: A New Metaheuristic Bat-Inspired Algorithm. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) NICSO 2010. SCI, vol. 284, pp. 65–74. Springer, Heidelberg (2010)
Altringham, J.D.: Bats: Biology and Behaviour. Oxford Univesity Press (1996)
Pham, D.T., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., Zaidi, M.: The Bees Algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK (2005)
Yang, X.-S., Deb, S.: Cuckoo search via Lévy flights. In: Proc. of World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), India, pp. 210–214. IEEE Publications, USA (2009)
Yang, X.-S.: Firefly algorithm, Lévy flights and global optimization. In: Bramer, M., Ellis, R., Petridis, M. (eds.) Research and Development in Intelligent Systems XXVI, pp. 209–218. Springer, London (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Sudana Rao, N.M., Aruna, M., Bhuvaneswari, S. (2013). Meta Heuristic Approaches for Circular Open Dimension Problem. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2013. Lecture Notes in Computer Science, vol 8298. Springer, Cham. https://doi.org/10.1007/978-3-319-03756-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-03756-1_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03755-4
Online ISBN: 978-3-319-03756-1
eBook Packages: Computer ScienceComputer Science (R0)