Formulation Space Search for Circle Packing Problems

DOI10.1007/978-3-540-74446-7_20MaRDI QIDQ5429303zbMATH OpenOpenAlexFDO

Authors Nenad Mladenović, Frank Plastria, Dragan Urošević

Publication date 29 November 2007

Published in Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74446-7_20

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Variable neighborhood formulation space search for circle packing
• Reformulation descent applied to circle packing problems
• A heuristic for the circle packing problem with a variety of containers
• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• Packing unequal circles using formulation space search

Cited in

(21)

• Variable neighbourhood search: Methods and applications
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search
• Solving the maximum min-sum dispersion by alternating formulations of two different problems
• Reformulation descent applied to circle packing problems
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Less is more approach in optimization: a road to artificial intelligence
• Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
• Packing a fixed number of identical circles in a circular container with circular prohibited areas
• Variable neighbourhood search for bandwidth reduction
• PERM for solving circle packing problem
• Formulation symmetries in circle packing
• Variable neighborhood formulation space search for circle packing
• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• Packing equal circles into a circle with circular prohibited areas
• Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
• A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure
• A literature review on circle and sphere packing problems: models and methodologies
• A heuristic for the circle packing problem with a variety of containers
• Beam search and non-linear programming tools for the circular packing problem
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Variable neighbourhood search: methods and applications

This page was built for publication: Formulation Space Search for Circle Packing Problems

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