Adaptive large neighborhood search for solving the circle bin packing problem
type: Item
instance of: scholarly article
title: Adaptive large neighborhood search for solving the circle bin packing problem
author: Kun He
author: Kevin Tole
author: Fei Ni
author: Yong Yuan
author: Linyun Liao
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2001.07709
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350535
zbMATH Keywords: NP-hard
zbMATH Keywords: circle bin packing problem
zbMATH Keywords: adaptive large neighborhood search
zbMATH Keywords: simulated annealing
zbMATH Keywords: greedy heuristic
MaRDI profile type: Publication
OpenAlex ID: W3101309573
cites work: A hybrid beam search looking-ahead algorithm for the circular packing problem
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
cites work: Solving circle packing problems by global optimization: numerical results and industrial applications
cites work: Scheduling web advertisements: a note on the minspace problem
cites work: An effective hybrid algorithm for the problem of packing circles into a larger containing circle
cites work: Optimal packings of up to five equal circles on a square flat torus
cites work: Quasi-human seniority-order algorithm for unequal circles packing
cites work: Approximating the advertisement placement problem
cites work: Handbook of metaheuristics
cites work: An improved typology of cutting and packing problems
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
cites work: Greedy algorithms for packing unequal circles into a rectangular container
cites work: Optimization by Simulated Annealing
cites work: An efficient placement heuristic for three-dimensional rectangular packing
cites work: An action-space-based global optimization algorithm for packing circles into a square container
cites work: An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
cites work: Three-dimensional container loading models with cargo stability and load bearing constraints
cites work: A heuristic for the circle packing problem with a variety of containers
cites work: Approximate algorithms for constrained circular cutting problems
cites work: A dynamic adaptive local search algorithm for the circular packing problem
cites work: Adaptive and restarting techniques-based algorithms for circular packing problems
cites work: Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
cites work: Local search algorithms for the bin packing problem and their relationships to various construction heuristics
cites work: Bin-packing by simulated annealing
cites work: New approaches to circle packing in a square. With program codes.
cites work: A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
cites work: New heuristics for packing unequal circles into a circular container
cites work: Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
cites work: PERM for solving circle packing problem
DOI: 10.1016/J.COR.2020.105140
description: scientific article; zbMATH DE number 7350535