Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Solution-Hashing Search Based on Layout-Graph Transformation for Unequal Circle Packing (2403.06211v1)

Published 10 Mar 2024 in cs.CG

Abstract: The problem of packing unequal circles into a circular container stands as a classic and challenging optimization problem in computational geometry. This study introduces a suite of innovative and efficient methods to tackle this problem. Firstly, we present a novel layout-graph transformation method that represents configurations as graphs, together with an inexact hash method facilitating fast comparison of configurations for isomorphism or similarity. Leveraging these advancements, we propose an Iterative Solution-Hashing Search algorithm adept at circumventing redundant exploration through efficient configuration recording. Additionally, we introduce several enhancements to refine the optimization and search processes, including an adaptive adjacency maintenance method, an efficient vacancy detection technique, and a Voronoi-based locating method. Through comprehensive computational experiments across various benchmark instances, our algorithm demonstrates superior performance over existing state-of-the-art methods, showcasing remarkable applicability and versatility. Notably, our algorithm surpasses the best-known results for 56 out of 179 benchmark instances while achieving parity with the remaining instances.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (69)
  1. Efficiently packing unequal disks in a circle. Operations Research Letters 36, 37–42.
  2. Isomorphism testing for T-graphs in FPT, in: International Conference and Workshops on Algorithms and Computation, Springer. pp. 239–250.
  3. A non-oscillating beam-search with a look-ahead for the circular packing problem, in: 2009 IEEE International Conference on Industrial Engineering and Engineering Management, IEEE. pp. 365–369.
  4. Adaptive beam search lookahead algorithms for the circular packing problem. International Transactions in Operational Research 17, 553–575.
  5. A beam search algorithm for the circular packing problem. Computers & Operations Research 36, 1513–1528.
  6. A hybrid heuristic for packing unequal circles into a circular container, in: 2006 International Conference on Service Systems and Service Management, IEEE. pp. 922–927.
  7. Packing circles in the smallest circle: an adaptive hybrid algorithm. Journal of the Operational Research Society 62, 1917–1930.
  8. Efficient algorithms for the dense packing of congruent circles inside a square. Discrete & Computational Geometry 70, 249–267.
  9. Voronoi Diagrams. Handbook of computational geometry 5, 201–290.
  10. A tabu search approach for the circle packing problem, in: 2014 17th International conference on network-based information systems, IEEE. pp. 165–171.
  11. Solving circle packing problems by global optimization: numerical results and industrial applications. European Journal of Operational Research 191, 786–802.
  12. Circle packing for origami design is hard, in: Origami 5. AK Peters/CRC Press, pp. 623–640.
  13. Computational algorithm for the sequential unconstrained minimization technique for nonlinear programming. Management Science 10, 601–617.
  14. Evolutionary computation solutions to the circle packing problem. Soft Computing 20, 1521–1535.
  15. A sweepline algorithm for Voronoi diagrams, in: Proceedings of the second annual symposium on Computational geometry, pp. 313–322.
  16. Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12, 133–137.
  17. Bubble treemaps for uncertainty visualization. IEEE transactions on visualization and computer graphics 24, 719–728.
  18. An improved isomorphism test for bounded-tree-width graphs. ACM Transactions on Algorithms (TALG) 16, 1–31.
  19. A greedy heuristic based on corner occupying action for the 2d circular bin packing problem, in: Theoretical Computer Science: 35th National Conference, NCTCS 2017, Wuhan, China, October 14-15, 2017, Proceedings, Springer. pp. 75–85.
  20. An action-space-based global optimization algorithm for packing circles into a square container. Computers & Operations Research 58, 67–74.
  21. A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints. Computers & Industrial Engineering 66, 1049–1060.
  22. Adaptive large neighborhood search for solving the circle bin packing problem. Computers & Operations Research 127, 105140.
  23. An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container. Computers & Operations Research 92, 26–36.
  24. A literature review on circle and sphere packing problems: Models and methodologies. Advances in Operations Research 2009.
  25. A threshold search-based population algorithm for the sphere packing problem. Knowledge-Based Systems 261, 110177.
  26. A dynamic adaptive local search algorithm for the circular packing problem. European Journal of Operational Research 183, 1280–1294.
  27. Adaptive and restarting techniques-based algorithms for circular packing problems. Computational Optimization and Applications 39, 17–35.
  28. On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem. European Journal of Operational Research 238, 87–94.
  29. A short tutorial on the weisfeiler-lehman test and its variants, in: ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE. pp. 8533–8537.
  30. Tabu search algorithm combined with global perturbation for packing arbitrary sized circles into a circular container. Science China Information Sciences 56, 1–14.
  31. A short note on a simple search heuristic for the diskspacking problem. Annals of Operations Research 131, 101–108.
  32. A “learning from human” heuristic for solving unequal circle packing problem 1/2121/21 / 2 .
  33. New heuristics for packing unequal circles into a circular container. Computers & Operations Research 33, 2125–2142.
  34. Extremal optimization with local search for the circular packing problem, in: Third International Conference on Natural Computation (ICNC 2007), IEEE. pp. 19–23.
  35. Two personification strategies for solving circles packing problem. Science in China Series E: Technological Sciences 42, 595–602.
  36. Greedy vacancy search algorithm for packing equal circles in a square. Operations Research Letters 38, 378–382.
  37. A new algorithm for packing unequal disks in a larger circle, in: 2012 International Conference on Computer Science and Information Processing (CSIP), IEEE. pp. 32–35.
  38. Packing unequal disks in a circular container using a population based algorithm, in: 2012 Sixth International Conference on Genetic and Evolutionary Computing, IEEE. pp. 437–440.
  39. Using iterated local search for efficiently packing unequal disks in a larger circle. Advanced Materials Research 430, 1477–1481.
  40. The graph isomorphism problem: its structural complexity. Springer Science & Business Media.
  41. Perturbation-based thresholding search for packing equal circles and spheres. INFORMS Journal on Computing .
  42. Iterated dynamic thresholding search for packing equal circles into a circular container. European Journal of Operational Research 299, 137–153.
  43. Iterated dynamic neighborhood search for packing equal circles on a sphere. Computers & Operations Research 151, 106121.
  44. On the limited memory BFGS method for large scale optimization. Mathematical programming 45, 503–528.
  45. Efficiently packing circles into a larger containing circle, in: High Performance Computing and Applications: Second International Conference, HPCA 2009, Shanghai, China, August 10-12, 2009, Revised Selected Papers, Springer. pp. 250–256.
  46. An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle. Computers & Industrial Engineering 57, 1144–1149.
  47. A heuristic quasi-physical algorithm with coarse and fine adjustment for multi-objective weighted circles packing problem. Computers & Industrial Engineering 101, 416–426.
  48. Packing unequal circles using formulation space search. Computers & Operations Research 40, 1276–1288.
  49. A formulation space search heuristic for packing unequal circles in a fixed size circular container. European Journal of Operational Research 251, 64–73.
  50. PERM for solving circle packing problem. Computers & Operations Research 35, 1742–1755.
  51. Packing a multidisperse system of hard disks in a circular environment. Physical Review E 79, 021102.
  52. ClonePacker: A tool for clone set visualization, in: 2015 IEEE 22nd International Conference on Software Analysis, Evolution, and Reengineering (SANER), IEEE. pp. 474–478.
  53. Balanced circular packing problems with distance constraints. Computation 10, 113.
  54. VOROPACK-D: Real-time disk packing algorithm using Voronoi diagram. Applied Mathematics and Computation 375, 125076.
  55. Ultrametricity property of energy landscapes of multidisperse packing problems. Physical Review E 79, 031122.
  56. A precise algorithm to detect voids in polydisperse circle packings. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471, 20150421.
  57. Packomania website: http://www.packomania.com .
  58. On the global minimum in a balanced circular packing problem. Optimization Letters 10, 1347–1360.
  59. Optimized packing multidimensional hyperspheres: a unified approach. Mathematical Biosciences and Engineering 17, 6601–6630.
  60. An improved algorithm for the packing of unequal circles within a larger containing circle. European Journal of Operational Research 141, 440–453.
  61. Visualization of large hierarchical data by circle packing, in: Proceedings of the SIGCHI conference on Human Factors in computing systems, pp. 517–520.
  62. A stimulus–response-based allocation method for the circle packing problem with equilibrium constraints. Physica A: Statistical Mechanics and its Applications 522, 232–247.
  63. Iterated tabu search algorithm for packing unequal circles in a circle. arXiv preprint arXiv:1306.0694 .
  64. Adaptive simulated annealing with greedy search for the circle bin packing problem. Computers & Operations Research 144, 105826.
  65. Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container. European Journal of Operational Research 250, 615–627.
  66. Adaptive Tabu search and variable neighborhood descent for packing unequal circles into a square. Applied Soft Computing 65, 196–213.
  67. A simulated annealing algorithm for the circles packing problem, in: International Conference on Computational Science, Springer. pp. 206–214.
  68. A personified annealing algorithm for circles packing problem. Acta Automatica Sinica 31, 590.
  69. An effective hybrid algorithm for the problem of packing circles into a larger containing circle. Computers & Operations Research 32, 1941–1951.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Jianrong Zhou (16 papers)
  2. Jiyao He (1 paper)
  3. Kun He (177 papers)

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now