Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container
Sign Up to like & getrecommendations! Published in 2020 at "Wireless Networks"
DOI: 10.1007/s11276-018-1869-y
Abstract: A Packing problem consists in the best arrangement of several objects inside a bounded area named as the container. This arrangement must fulfill with technological constraints, for example, objects should not be overlapping. Some packing… read more here.
Keywords: monkey; monkey algorithm; problem; binary monkey ... See more keywords