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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
