Cover Image

Monkey Algorithm for Packing Circles with Binary Variables

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 diffi...

Full description

Saved in:
Bibliographic Details
Main Authors: Torres-Escobar, R., Marmolejo-Saucedo, J.A., Litvinchev, I., Vasant, P.
Format: Article
Published: Springer Verlag 2019
Online Access: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
http://eprints.utp.edu.my/23667/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utp.eprints.23667
record_format eprints
spelling my.utp.eprints.236672021-08-19T08:08:04Z Monkey Algorithm for Packing Circles with Binary Variables Torres-Escobar, R. Marmolejo-Saucedo, J.A. Litvinchev, I. Vasant, P. 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. Springer Verlag 2019 Article NonPeerReviewed 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 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. http://eprints.utp.edu.my/23667/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
description 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.
format Article
author Torres-Escobar, R.
Marmolejo-Saucedo, J.A.
Litvinchev, I.
Vasant, P.
spellingShingle Torres-Escobar, R.
Marmolejo-Saucedo, J.A.
Litvinchev, I.
Vasant, P.
Monkey Algorithm for Packing Circles with Binary Variables
author_facet Torres-Escobar, R.
Marmolejo-Saucedo, J.A.
Litvinchev, I.
Vasant, P.
author_sort Torres-Escobar, R.
title Monkey Algorithm for Packing Circles with Binary Variables
title_short Monkey Algorithm for Packing Circles with Binary Variables
title_full Monkey Algorithm for Packing Circles with Binary Variables
title_fullStr Monkey Algorithm for Packing Circles with Binary Variables
title_full_unstemmed Monkey Algorithm for Packing Circles with Binary Variables
title_sort monkey algorithm for packing circles with binary variables
publisher Springer Verlag
publishDate 2019
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
http://eprints.utp.edu.my/23667/
_version_ 1738656504489181184
score 13.211869

Similar Items