TY  - JOUR
VL  - 866
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-85054750586&doi=10.1007%2f978-3-030-00979-3_58&partnerID=40&md5=5805717f5fbfbe8e0984738416318dad
A1  - Torres-Escobar, R.
A1  - Marmolejo-Saucedo, J.A.
A1  - Litvinchev, I.
A1  - Vasant, P.
JF  - Advances in Intelligent Systems and Computing
Y1  - 2019///
KW  - Containers; Heuristic methods; Markov processes; Optimization
KW  -  Evolutionary computing; Metaheuristic; Monkey algorithms; Non-congruent circles; Packing problems
KW  -  Intelligent computing
ID  - scholars12283
N2  - The problem of packing non-congruent circles within a rectangular container is considered. The objective is to place the maximum number of circles inside the container such that no circle overlaps with another one. This problem is known to be NP-Hard. Dealing with these problems efficiently is difficult, so heuristic-based methods have been used. In this paper the problem of packing non-congruent circles is solved using the binary version of monkey algorithm. The proposed algorithm uses a grid for approximating the container and considering the grid points as potential positions for assigning centers of the circles. The algorithm consists of five main routines: the climb process, watch-jump process, repairing process, cooperation process and somersault process. Numerical results on packing non-congruent circles are presented to demonstrate the efficiency of the proposed approach. © 2019, Springer Nature Switzerland AG.
EP  - 559
SN  - 21945357
PB  - Springer Verlag
TI  - Monkey Algorithm for Packing Circles with Binary Variables
SP  - 547
N1  - cited By 7; Conference of International Conference on Intelligent Computing and Optimization, ICO 2018 ; Conference Date: 4 October 2018 Through 5 October 2018; Conference Code:219079
AV  - none
ER  -