Search Results

Now showing 1 - 3 of 3

Some of the metrics are blocked by your
consent settings
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
Some of the metrics are blocked by your
consent settings
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
Some of the metrics are blocked by your
consent settings
μ𝜃-EGF: A New Multi-Thread and Nature-Inspired Algorithm for the Packing Problem
(2020)
García-Jacas, César R.
;
;
Marmolejo Saucedo, José Antonio
;
Murillo-Suarez, Alfonso
In this paper, the authors present a new algorithm efficient solution to the packing problem in two dimensions. The authors propose a new heuristic using the value of the electromagnetic field to determine the best position to place a circular object in a configuration of other circular objects previously packed. Also, this algorithm simulates two processes to compact objects already placed, inspired by gravitational forces, to minimize the empty space in the container and maximizing the number of objects in the container. To determine the efficacy of this algorithm, the authors carried out experiments with twenty-four instances. Parallel computing can contribute to making decision processes such as optimization and prediction more agile and faster. Real-time decision making involves the use of solution methodologies and algorithms. For this reason the present manuscript shows an alternative for the solution of a classic industry problem that must be solved quickly. Packaging optimization can help reduce waste of container material. The material used to transport the products can reduce its environmental impact due to an efficient packaging process. Light-weighting can also be accomplished by reducing the amount of packaging material used. © Springer Nature
36 1

CRIS

Browse

Filters

Settings

Sort By

Results per page

Search Results