Iterated tabu search for the circular open dimension problem
From MaRDI portal
Abstract: This paper mainly investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known radii into a strip of fixed width and unlimited length without overlapping. The objective is to minimize the length of the strip. An iterated tabu search approach, named ITS, is proposed. ITS starts from a randomly generated solution and attempts to gain improvements by a tabu search procedure. After that, if the obtained solution is not feasible, a perturbation operator is subsequently employed to reconstruct the incumbent solution and an acceptance criterion is implemented to determine whether or not accept the perturbed solution. This process is repeated until a feasible solution has been found or the allowed computation time has been elapsed. Computational experiments based on well-known benchmark instances show that ITS produces quite competitive results with respect to the best known results. For 18 representative CODP instances taken from the literature, ITS succeeds in improving 13 best known results within reasonable time. In addition, for another challenging related variant: the problem of packing arbitrary sized circles into a circular container, ITS also succeeds in improving many best known results. Supplementary experiments are also provided to analyze the influence of the perturbation operator, as well as the acceptance criterion.
Recommendations
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- Probabilistic tabu search algorithm for the problem of packing circles and rectangles into a strip
- Algorithms for the circular two-dimensional open dimension problem
- A dynamic adaptive local search algorithm for the circular packing problem
Cited in
(16)- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- A memetic algorithm to pack unequal circles into a square
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Adaptive simulated annealing with greedy search for the circle bin packing problem
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints
- Optimized packing clusters of objects in a rectangular container
- Multi-start iterated tabu search for the minimum weight vertex cover problem
- Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem
- Tabu search for the real-world carpooling problem
- Probabilistic tabu search algorithm for the problem of packing circles and rectangles into a strip
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- An action-space-based global optimization algorithm for packing circles into a square container
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- A hybrid method for the intelligent effectiveness management of production operators
This page was built for publication: Iterated tabu search for the circular open dimension problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253497)
