Adaptive large neighborhood search for solving the circle bin packing problem
We address a new packing problem variant known as the 2D circle bin packing problem (2D-
CBPP), which involves packing circles into multiple square bins as densely as possible so …
CBPP), which involves packing circles into multiple square bins as densely as possible so …
Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
This paper presents an Iterated Tabu Search and Variable Neighborhood Descent (ITS-
VND) algorithm for packing unequal circles into a circular container (PUCC). The algorithm …
VND) algorithm for packing unequal circles into a circular container (PUCC). The algorithm …
An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
We propose an efficient quasi-physical quasi-human (QPQH) algorithm for the equal circle
packing problem. QPQH is based on our modified Broyden–Fletcher–Goldfarb–Shanno …
packing problem. QPQH is based on our modified Broyden–Fletcher–Goldfarb–Shanno …
Adaptive tabu search and variable neighborhood descent for packing unequal circles into a square
This paper proposes a hybrid metaheuristic for Packing Unequal Circles into a Square
(PUCS), denoted by Adaptive Tabu search and Variable Neighborhood Descent (ATS …
(PUCS), denoted by Adaptive Tabu search and Variable Neighborhood Descent (ATS …
Solving the circular open dimension problem by using separate beams and look-ahead strategies
In this paper, a constructive method is investigated for solving the circular open dimension
problem (CODP), a problem of the Cutting and Packing family. CODP is a combinatorial …
problem (CODP), a problem of the Cutting and Packing family. CODP is a combinatorial …
Многокритериальная задача доставки грузов различным потребителям
НИ Юсупова, АФ Валеева, ЕЮ Рассадникова… - … и управление цепями …, 2011 - elibrary.ru
В статье рассматривается задача доставки грузов потребителям, которая
сформулирована как многокритериальная задача комбинаторной оптимизации. Для …
сформулирована как многокритериальная задача комбинаторной оптимизации. Для …
A memetic algorithm to pack unequal circles into a square
ZZ Zeng, XG Yu, M Chen, YY Liu - Computers & Operations Research, 2018 - Elsevier
A circle packing problem involves packing given circles into a container. The objective is to
minimize the size of the container without causing any overlap. This paper focuses on a …
minimize the size of the container without causing any overlap. This paper focuses on a …
Iterated tabu search algorithm for packing unequal circles in a circle
T Ye, W Huang, Z Lu - arxiv preprint arxiv:1306.0694, 2013 - arxiv.org
This paper presents an Iterated Tabu Search algorithm (denoted by ITS-PUCC) for solving
the problem of Packing Unequal Circles in a Circle. The algorithm exploits the continuous …
the problem of Packing Unequal Circles in a Circle. The algorithm exploits the continuous …
Adaptive large neighborhood search for circle bin packing problem
We address a new variant of packing problem called the circle bin packing problem (CBPP),
which is to find a dense packing of circle items to multiple square bins so as to minimize the …
which is to find a dense packing of circle items to multiple square bins so as to minimize the …
Daire Paketleme Problemi: Bir Literatür Çalışması
S Hakyemez, U Özcan - Journal of Information Systems and …, 2020 - dergipark.org.tr
Accepted: 25.06. 2020 The Circle Packing Problem (CPP) refers to the problem of placing
circle-shaped objects in a pallet or a different area so that they do not overlap each other …
circle-shaped objects in a pallet or a different area so that they do not overlap each other …