Adaptive large neighborhood search for solving the circle bin packing problem
From MaRDI portal
Publication:2027009
Recommendations
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- A dynamic adaptive local search algorithm for the circular packing problem
- Adaptive beam search lookahead algorithms for the circular packing problem
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Adaptive algorithms for circular cutting/packing problems
Cites work
- A dynamic adaptive local search algorithm for the circular packing problem
- A heuristic for the circle packing problem with a variety of containers
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
- Adaptive and restarting techniques-based algorithms for circular packing problems
- An action-space-based global optimization algorithm for packing circles into a square container
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- An efficient placement heuristic for three-dimensional rectangular packing
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- An improved typology of cutting and packing problems
- Approximate algorithms for constrained circular cutting problems
- Approximating the advertisement placement problem
- Bin-packing by simulated annealing
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Greedy algorithms for packing unequal circles into a rectangular container
- Handbook of metaheuristics
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Local search algorithms for the bin packing problem and their relationships to various construction heuristics
- New approaches to circle packing in a square. With program codes.
- New heuristics for packing unequal circles into a circular container
- Optimal packings of up to five equal circles on a square flat torus
- Optimization by simulated annealing
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- PERM for solving circle packing problem
- Quasi-human seniority-order algorithm for unequal circles packing
- Scheduling web advertisements: a note on the minspace problem
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- Tabu Search—Part I
- Tabu Search—Part II
- Three-dimensional container loading models with cargo stability and load bearing constraints
Cited in
(7)- Adaptive simulated annealing with greedy search for the circle bin packing problem
- Exact and approximate methods for the score-constrained packing problem
- An efficient solution space exploring and descent method for packing equal spheres in a sphere
- Solution-hashing search based on layout-graph transformation for unequal circle packing
- Optimizing plastic product manufacturing scheduling: an integrated approach to minimize setup costs and tardiness with preventive maintenance considerations
- Online and offline packing cylinders in a cylindrical container
- The two-dimensional orthogonal packing problem with item fragmentation: formulation and local search-based algorithms (applications on tank-farm layout planning)
This page was built for publication: Adaptive large neighborhood search for solving the circle bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2027009)
