Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container
- 13 November 2018
- journal article
- research article
- Published by Springer Nature in Wireless Networks
- Vol. 26 (7) , 4743-4752
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- The Dotted-Board Model: A new MIP model for nesting irregular shapesInternational Journal of Production Economics, 2013
- A global optimization point of view to handle non-standard object packing problemsJournal of Global Optimization, 2012
- Packing circles in the smallest circle: an adaptive hybrid algorithmJournal of the Operational Research Society, 2011
- Quasi-physical global optimization method for solving the equal circle packing problemScience China Information Sciences, 2011
- New and improved results for packing identical unitary radius circles within triangles, rectangles and stripsComputers & Operations Research, 2010
- Solving circle packing problems by global optimization: Numerical results and industrial applicationsEuropean Journal of Operational Research, 2008
- An improved typology of cutting and packing problemsEuropean Journal of Operational Research, 2007
- Adaptive and restarting techniques-based algorithms for circular packing problemsComputational Optimization and Applications, 2007
- Circle Packings and the Sacred LotusLeonardo, 2003
- Two personification strategies for solving circles packing problemScience China Technological Sciences, 1999