Adaptive large neighborhood search for solving the circle bin packing problem

DOI10.1016/j.cor.2020.105140OpenAlexW3101309573MaRDI QIDQ2027009

Linyun Liao, Kevin Tole, Yong Yuan, Fei Ni, Kun He

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.07709

zbMATH Keywords

simulated annealingNP-hardadaptive large neighborhood searchgreedy heuristiccircle bin packing problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

Adaptive simulated annealing with greedy search for the circle bin packing problem ⋮ Exact and approximate methods for the score-constrained packing problem

Cites Work

• Optimization by Simulated Annealing
• Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
• An action-space-based global optimization algorithm for packing circles into a square container
• Quasi-human seniority-order algorithm for unequal circles packing
• A heuristic for the circle packing problem with a variety of containers
• An efficient placement heuristic for three-dimensional rectangular packing
• A hybrid beam search looking-ahead algorithm for the circular packing problem
• Optimal packings of up to five equal circles on a square flat torus
• New approaches to circle packing in a square. With program codes.
• Scheduling web advertisements: a note on the minspace problem
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Bin-packing by simulated annealing
• Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
• Local search algorithms for the bin packing problem and their relationships to various construction heuristics
• Approximate algorithms for constrained circular cutting problems
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
• A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
• Three-dimensional container loading models with cargo stability and load bearing constraints
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle
• PERM for solving circle packing problem
• Approximating the advertisement placement problem
• Adaptive and restarting techniques-based algorithms for circular packing problems
• New heuristics for packing unequal circles into a circular container
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
• An improved typology of cutting and packing problems
• A dynamic adaptive local search algorithm for the circular packing problem
• Tabu Search—Part I
• Tabu Search—Part II
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Greedy algorithms for packing unequal circles into a rectangular container
• Handbook of metaheuristics

This page was built for publication: Adaptive large neighborhood search for solving the circle bin packing problem