A b s t r a c t .
Reduction of the search space to the feasible region with global optimum is one of the approaches that can significantly improve the efficiency of a GA. This study focuses on the modelling of a GA with dynamical adjustment of a search space size to analytically establish the setting of a parameter k, which specifies a ratio of narrowing the boundaries of a… (More)
Two computer models were developed to realize the algorithms of random Apollonian and Apollonian packings of the spherical particles in a unit cube. A genetic algorithm was developed for the latter packing model. The upper and lower bounds of a fractal dimension were computed using various numerical methods. It was observed that for both models the fractal… (More)
The dense packing of particulate assemblies is an enduring theoretical and practical problem. In spite of its apparent simplicity, this problem still remains challenging. Recent progress in the performance of computers boosted the development and realization of a number of effective packing algorithms. Yet, because of the complexity of the problem, many of… (More)