Recursive circle packing problems | Zendy

Pedroso João Pedro | Zendy; Cunha Sílvia | Zendy; Tavares João Nuno | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Recursive circle packing problems

Author(s) -

Pedroso João Pedro,

Cunha Sílvia,

Tavares João Nuno

Publication year - 2014

Publication title -

international transactions in operational research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.032

H-Index - 52

eISSN - 1475-3995

pISSN - 0969-6016

DOI - 10.1111/itor.12107

Subject(s) - packing problems , container (type theory) , set packing , set (abstract data type) , mathematical optimization , benchmark (surveying) , circle packing , rectangle , class (philosophy) , computer science , mathematics , combinatorics , algorithm , artificial intelligence , geometry , engineering , mechanical engineering , programming language , geodesy , geography

This paper presents a class of packing problems where circles may be placed either inside or outside other circles, the whole set being packed in a rectangle. This corresponds to a practical problem of packing tubes in a container. Before being inserted in the container, tubes may be put inside other tubes in a recursive fashion. A variant of the greedy randomized adaptive search procedure is proposed for tackling this problem, and its performance is assessed in a set of benchmark instances.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research