Modern heuristic techniques for combinatorial problems
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
New heuristics for one-dimensional bin-packing
Computers and Operations Research
An algorithm based on tabu search for satisfiability problem
Journal of Computer Science and Technology
New heuristics for packing unequal circles into a circular container
Computers and Operations Research
Note on: an improved algorithm for the packing of unequal circles within a larger containing circle
Computers and Industrial Engineering
PERM for solving circle packing problem
Computers and Operations Research
Adaptive and restarting techniques-based algorithms for circular packing problems
Computational Optimization and Applications
Implementing soft computing techniques to solve economic dispatch problem in power systems
Expert Systems with Applications: An International Journal
A beam search algorithm for the circular packing problem
Computers and Operations Research
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Computers and Industrial Engineering
Computers and Operations Research
Solving the problem of packing equal and unequal circles in a circular container
Journal of Global Optimization
Two-dimensional equilibrium constraint layout using simulated annealing
Computers and Industrial Engineering
A heuristic approach for packing identical rectangles in convex regions
Computers and Operations Research
Efficiently packing circles into a larger containing circle
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
A meta-heuristic algorithm for the strip rectangular packing problem
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
A hybrid heuristic algorithm for the rectangular packing problem
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
A probability collectives approach with a feasibility-based rule for constrained optimization
Applied Computational Intelligence and Soft Computing
Efficiently packing unequal disks in a circle
Operations Research Letters
Hi-index | 0.02 |
Simulated annealing is a powerful stochastic search method, but it still has the disadvantage of blind search. Tabu search (TS) which can prevent cycling and enhance diversification, is an adaptive strategy based on tabu list. By reasonably combining simulated annealing with TS, an effective hybrid algorithm for the problem of packing circles into a larger containing circle is presented. Based on a special neighborhood and tabu strategy, some benchmark problem instances can be well solved by the presented hybrid algorithm, and the computational results can compete with the best literature results.