Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
From MaRDI portal
Publication:322528
DOI10.1016/J.EJOR.2015.09.001zbMATH Open1346.90526OpenAlexW1416294610MaRDI QIDQ322528FDOQ322528
Authors: Zhizhong Zeng, Xinguo Yu, Kun He, Wenqi Huang, Zhanghua Fu 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.09.001
Recommendations
- Iterated tabu search for the circular open dimension problem
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Packing unequal circles using formulation space search
- Solving the problem of packing equal and unequal circles in a circular container
- New heuristics for packing unequal circles into a circular container
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Circle packings and discrete conformal geometry (52C26)
Cites Work
- Title not available (Why is that?)
- On the limited memory BFGS method for large scale optimization
- Variable neighborhood search
- Adaptive tabu search for course timetabling
- Variable Neighborhood Search
- Tabu Search—Part II
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Iterated tabu search for the circular open dimension problem
- Approximate algorithms for constrained circular cutting problems
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
- Greedy algorithms for packing unequal circles into a rectangular container
- A literature review on circle and sphere packing problems: models and methodologies
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Two personification strategies for solving circles packing problem
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- PERM for solving circle packing problem
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- A dynamic adaptive local search algorithm for the circular packing problem
- Disk packing in a square: a new global optimization approach
- Adaptive beam search lookahead algorithms for the circular packing problem
- Packing unequal circles using formulation space search
- Greedy vacancy search algorithm for packing equal circles in a square
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A population-based approach for hard global optimization problems based on dissimilarity measures
- Efficiently packing unequal disks in a circle
- A beam search algorithm for the circular packing problem
- Solving the problem of packing equal and unequal circles in a circular container
Cited In (17)
- Near optimal minimal convex hulls of disks
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints
- Quasi-physical global optimization method for solving the equal circle packing problem
- Adaptive large neighborhood search for solving the circle bin packing problem
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- A memetic algorithm to pack unequal circles into a square
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
- Title not available (Why is that?)
- Multi-trip time-dependent vehicle routing problem with time windows
- Iterated tabu search for the circular open dimension problem
- Beam search and non-linear programming tools for the circular packing problem
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
Uses Software
This page was built for publication: Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322528)
