A particle packing algorithm for packed beds with size distribution
Granular Matter
Springer Berlin / Heidelberg
ISSN 1434-5021 (Print) 1434-7636 (Online)
Volume 10, Number 4 / Июнь 2008 г.
DOI 10.1007/s10035-008-0097-z
pp. 257-262
A particle packing algorithm for packed beds with size distribution
G. A. Georgalli1 and M. A. Reuter2
(1) Department of Materials Science and Engineering, Technical University of Delft, Mekelweg 2, 2628 CD Delft, The Netherlands
(2) Department of Chemical and Biomolecular Engineering, University of Melbourne, Melbourne, VIC, 3010, Australia
Received: 11 December 2006 Published online: 4 March 2008
Abstract A particle packing algorithm for simulating realistic packed beds of spheres with size distribution is described. The algorithm used the Monte Carlo method combined with the simulated annealing minimisation algorithm to solve the packed bed simulations. The objective function which was minimised was a combination of two functions, one describing the deviation from the target mean coordination number of the spheres in each size interval and the other the average fraction of overlapping volume of the spheres per contact. In this way a realistic bed structure was maintained while at the same time controlling the coordination number of the spheres. The algorithm used an experimentally validated model to predict the mean coordination number of the spheres in each size interval.
Keywords Particle packing algorithm - Simulated annealing - Coordination number
--------------------------------------------------------------------------------
G. A. Georgalli
Email: g.a.georgalli@gmail.com
References
1. Suzuki, M., Oshima, T.: Estimation of the co-ordination number in a multi-component mixture of spheres. Powder Technol. 35, 159–166 (1983)
2. Suzuki, M., Oshima, T.: Comparison between the computer-simulated results and the model for estimating the co-ordination number in a three-component random mixture of spheres. Powder Technol. 43, 19–25 (1985)
3. Suzuki, M., Oshima, T.: Co-ordination number of a multi-component randomely packed bed of spheres with size distribution. Powder Technol. 44, 213–218 (1985)
4. Gotoh, K.: J. Soc. Pow. Tech. 15, 220 (1978)
5. Georgalli, G.A., Reuter, M.A.: Modelling the co-ordination number of a packed bed of spheres with distributed sizes using a CT scanner. Miner. Eng. In Press (2005)
6. Sobolev, K., Amirjanov, A.: A simulation model of the dense packing of particulate material. Adv. Powder Technol. 15(3), 365–376 (2004)
7. Sobolev, K., Amirjanov, A.: The development of a simulation model of the dense packing of large particulate assemblies. Powder Technol. 141, 155–160 (2004)
8. Reyes, S.C., Iglesia, E.: Monte Carlo simulations of structural properties of packed beds. Chem. Eng. Sci. 46(4), 1089–1099 (1991)
9. Abreu, C.R.A., Macias-Salinas, R., Tavares, F.W., Castier, M.: A Monte Carlo simulation of packing and segregation of spheres in cylinders. Braz. J. Chem. Eng. 16(4), 395–405 (1999)
10. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–689 (1983)
11. Press, W.H., Flannery, B.P., Teulosky, S.A., Vetterling, W.T.: Numerical Recipes in C. Cambridge University Press, Cambridge (1988)
12. Bodin, P.: Bubbleplot3.m.
http://www.mathworks.com (2005)
Отправлено: 22.08.08 08:23. Заголовок: A particle packing algorithm for packed beds with size distribution
