Authors: Chikit Au
Addresses: Faculty of Engineering, University of Waikato, Hamilton, New Zealand
Abstract: Seeking an improbable, but globally optimum, state is useful in many scientific and engineering endeavours. To handle a larger data size, computational techniques are often employed. Yet, they are bound by the inherent combinatorial complexity. This paper employs the examples of packing a set of circles into a square to verify the existence of the pathways between the global optimisations based on the hypothesis that hopping from one known optimum to an unknown optimum in a global landscape is feasible. Twenty seven proven optimal circle packing configurations are investigated and eleven pathways are identified. These pathways lead to other optimal configurations which conform to the best known results. These pathways are beneficial to obtaining the optimum since it does not require going through the combinatorial many intermediate configuration before reaching the optimum.
Keywords: circle packing; squares; optimisation; patterns; pathways; optimal configurations.
International Journal of Computer Applications in Technology, 2013 Vol.48 No.1, pp.58 - 73
Published online: 31 Jul 2013 *Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article