A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem
From MaRDI portal
Publication:316266
DOI10.1016/j.camwa.2013.08.011zbMath1381.90099OpenAlexW2067637438MaRDI QIDQ316266
Ziqiang Li, Zhuojun Tian, Yanfang Xie, Rong Huang, Ji Yang Tan
Publication date: 27 September 2016
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2013.08.011
particle swarm optimizationheuristic methodadjustment strategylayout knowledgeweighted circle packing problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Circle packings and discrete conformal geometry (52C26)
Related Items
Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium ⋮ Lattice Boltzmann simulation of solid particles behavior in a three-dimensional lid-driven cavity flow ⋮ A comprehensive survey on particle swarm optimization algorithm and its applications
Cites Work
- Approximate algorithms for constrained circular cutting problems
- Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
- Greedy algorithms for packing unequal circles into a rectangular container
- Heuristic approach for solving the multi-objective facility layout problem
- Unnamed Item