Adaptive simulated annealing with greedy search for the circle bin packing problem

DOI10.1016/J.COR.2022.105826MaRDI QIDQ2147115zbMATH OpenOpenAlexFDO

Authors Yong Yuan, Kevin Tole, Fei Ni, Kun He, Zhengda Xiong, Jinfa Liu

Publication date 22 June 2022

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

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

zbMATH Keywords

heuristicspackinggreedy searchadaptive simulated annealingtangent occupying action

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Adaptive large neighborhood search for solving the circle bin packing problem
• Computational Science - ICCS 2004
• A dynamic adaptive local search algorithm for the circular packing problem
• Adaptive beam search lookahead algorithms for the circular packing problem
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle

Cites work

• A beam search algorithm for the circular packing problem
• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• A set-covering-based heuristic approach for bin-packing problems
• A simulated annealing approach for the circular cutting problem
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• Adaptive large neighborhood search for solving the circle bin packing problem
• Algorithms for the variable sized bin packing problem
• An action-space-based global optimization algorithm for packing circles into a square container
• An efficient deterministic heuristic for two-dimensional rectangular packing
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
• An improved algorithm for the packing of unequal circles within a larger containing circle
• Approximate algorithms for constrained circular cutting problems
• Approximation and online algorithms for multidimensional bin packing: a survey
• Curved hexagonal packings of equal disks in a circle
• Guided local search for the three-dimensional bin-packing problem
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• Iterated tabu search for the circular open dimension problem
• New heuristics for packing unequal circles into a circular container
• On Packing Two-Dimensional Bins
• Optimization by simulated annealing
• PERM for solving circle packing problem
• Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
• Reformulation descent applied to circle packing problems
• Solving the problem of packing equal and unequal circles in a circular container
• Two-dimensional packing problems: a survey

Cited in

(7)

• Iterated dynamic neighborhood search for packing equal circles on a sphere
• Adaptive large neighborhood search for solving the circle bin packing problem
• A morph-based simulated annealing heuristic for a modified bin-packing problem
• Computational Science - ICCS 2004
• A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem
• A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle

This page was built for publication: Adaptive simulated annealing with greedy search for the circle bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147115)