This paper reviews the most relevant literature on efficient models and methods for packing
circular objects/items into Euclidean plane regions where the objects/items and regions are …

This book explains the most prominent and some promising new, general techniques that
combine metaheuristics with other optimization methods. A first introductory chapter reviews …

Automated fibre placement (AFP) systems have successfully intensified the demand for high-
quality composite component manufacturing in both the military and civilian fields. One of …

We introduce a new bin packing problem, termed the circle bin packing problem with circular
items (CBPP-CI). The problem involves packing all the circular items into multiple identical …

The weighted circles packing (WCP) problem typically aims for arranging some circular
objects into a larger rectangular (or circular) container with the constraint of non …

Designing efficient routes for a transit network is one of the main problems faced by city
planners of the world. Due to the largeness and complexity of modern day road networks it is …

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 …

The glass cutting problem proposed by Saint Gobain for the 2018 ROADEF challenge
includes some specific constraints that prevent the direct application of procedures …

In this article, we present the anytime tree search algorithm we designed for the 2018
ROADEF/EURO challenge glass cutting problem proposed by the French company Saint …

This paper presents a deterministic heuristic algorithm for solving the NP-hard two-
dimensional rectangular packing problem with the objective of maximizing the filling rate of a …