Affordable Access

Publisher Website

A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem

Authors
Journal
Computers & Mathematics with Applications
0898-1221
Publisher
Elsevier
Volume
66
Issue
10
Identifiers
DOI: 10.1016/j.camwa.2013.08.011
Keywords
  • The Weighted Circle Packing Problem
  • Particle Swarm Optimization
  • Heuristic Method
  • Adjustment Strategy
  • Layout Knowledge
Disciplines
  • Computer Science

Abstract

Abstract The weighted circle packing problem is a kind of important combination optimization problem and has the NP-hard property. Inspired by the No Free Lunch Theorem, a knowledge-based heuristic particle swarm optimization approach with the adjustment strategy (KHPSOA) is developed for this problem. The knowledge (e.g., the relation between its weight matrix and better solution) is obtained from this problem itself and existing layout scheme diagrams and applied to form more effective ordering and positioning rules of the proposed heuristic method. A better layout scheme of larger circles is obtained through the heuristic method. The optimal solution of this problem is obtained by inserting a few residual smaller circles into the gaps of the better layout scheme and further optimizing it through the proposed particle swarm optimization with the adjustment strategy. The numerical experiments show that KHPSOA is superior to the existing algorithms in the performances.

There are no comments yet on this publication. Be the first to share your thoughts.