Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container.
Rafael Torres-EscobarJosé Antonio Marmolejo-SaucedoIgor S. LitvinchevPublished in: Wirel. Networks (2020)
Keyphrases
- packing problem
- learning algorithm
- dynamic programming
- k means
- preprocessing
- theoretical analysis
- computational complexity
- search space
- times faster
- np hard
- worst case
- high accuracy
- improved algorithm
- strip packing
- piecewise linear
- detection algorithm
- input data
- linear programming
- simulated annealing
- experimental evaluation
- significant improvement
- optimal solution
- objective function
- expectation maximization
- knn
- matching algorithm
- data streams
- non binary
- arbitrary shaped
- similarity measure