CRIS

Permanent URI for this communityhttps://scripta.up.edu.mx/handle/20.500.12552/1

Browse

Settings

Language: search.filters.language.EnglishSubject: search.filters.subject.Packing problem

Search Results

Now showing 1 - 3 of 3
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Monkey Algorithm for Packing Circles with Binary Variables
    (2018)
    Torres Escobar, Rafael
    ;
    Marmolejo Saucedo, José Antonio
    ;
    Litvinchev, Igor
    ;
    Vasant, Pandian
    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. © Springer Nature
    Scopus© Citations 7  6  2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    A new heuristic algorithm to solve Circle Packing problem inspired by nanoscale electromagnetic fields and gravitational effects
    (2018)
    ;
    Marmolejo Saucedo, José Antonio
    ;
    Murillo-Suarez, Alfonso
    In this paper, we present a new algorithm for the fast and efficient solution of the Packing problem in two dimensions. The packing problem consists in finding the best arrangement of objects (many geometrical forms) in a specific space called container.This new algorithm is inspired by the observations of nanometric scale electromagnetic fields. We use the electromagnetic theory of the electric field to calculate the best position to place a circular object in a configuration of other circular objects previously packing. Also, in this new algorithm we simulate two processes called »gravity» and »shaken» that compact the distribution of the objects placed in the container and allow to minimize the unoccupied space. © 2018 IEEE.
    Scopus© Citations 3  11  1
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Packing algorithm inspired by gravitational and electromagnetic effects
    (2019)
    ;
    Murillo-Suarez, Alfonso
    This paper introduces a faster and more efficient algorithm for solving a two-dimension packing problem. This common optimization problem takes a set of geometrical objects and tries to find the best form of packing them in a space with specific characteristics, called container. The visualization of nanoscale electromagnetic fields was the inspiration for this new algorithm, using the electromagnetic field between the previously placed objects, this paper explains how to determine the best positions for to place the remaining ones. Two gravitational phenomena are also simulated to achieve better results: shaken and gravity. They help to compact the objects to reduce the occupied space. This paper shows the executions of the packing algorithm for four types of containers: rectangles, squares, triangles, and circles. © Springer Nature
    Scopus© Citations 2  9  2