eprintid: 12283
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/01/22/83
datestamp: 2023-11-10 03:26:49
lastmod: 2023-11-10 03:26:49
status_changed: 2023-11-10 01:17:18
type: article
metadata_visibility: show
creators_name: Torres-Escobar, R.
creators_name: Marmolejo-Saucedo, J.A.
creators_name: Litvinchev, I.
creators_name: Vasant, P.
title: Monkey Algorithm for Packing Circles with Binary Variables
ispublished: pub
keywords: Containers; Heuristic methods; Markov processes; Optimization, Evolutionary computing; Metaheuristic; Monkey algorithms; Non-congruent circles; Packing problems, Intelligent computing
note: 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
abstract: 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.
date: 2019
publisher: Springer Verlag
official_url: 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
id_number: 10.1007/978-3-030-00979-3₅₈
full_text_status: none
publication: Advances in Intelligent Systems and Computing
volume: 866
pagerange: 547-559
refereed: TRUE
isbn: 9783030009786
issn: 21945357
citation:   Torres-Escobar, R. and Marmolejo-Saucedo, J.A. and Litvinchev, I. and Vasant, P.  (2019) Monkey Algorithm for Packing Circles with Binary Variables.  Advances in Intelligent Systems and Computing, 866.  pp. 547-559.  ISSN 21945357