Volume 7 Number 11 (Nov. 2012)
Home > Archive > 2012 > Volume 7 Number 11 (Nov. 2012) >
JSW 2012 Vol.7(11): 2567-2574 ISSN: 1796-217X
doi: 10.4304//jsw.7.11.2567-2574

Hierarchy and Adaptive Size Particle Swarm Optimization Algorithm for Solving Geometric Constraint Problems

Wenhui Li, Mingyu Sun, Huiying Li, Bo Fu, Huichun Li
College of Computer Science and Technology, Jilin University, Changchun 130012, P.R. China

Abstract—Geometric constraint problems are equivalent to a series of nonlinear equations which are constraint-meeting. Thus, it is a significant issue to improve solving efficiency of the nonlinear equations. This paper proposes Hierarchy and Adaptive Size Particle Swarm Optimization (HASPSO) algorithm for solving geometric constraint problems, and its aim is to greatly improving solving efficiency. This is the basic idea: according to individual extremum, making a comparison between each particle and its members in the direct next hierarchy, then based on transmission principle, taking the best particle’s personal optimal position as its own to do subsequent iterations. Meanwhile, it depends on the natural principle of Fibonacci sequence, by simulating biological reproduction behavior, to make the algorithm adaptively expand its population size from a single individual to appropriate numbers of ones for subsequent hierarchies. If a particle still has not found precisionmeeting optimal solution after a T times of iterations, then our approach judge whether the particle is new reproduced individual before the iterations, if so, it continues next T times of iterations, otherwise it produces one new individual in its direct next hierarchy, and reinitializes its position and velocity. HASPSO is able to rank population based on the form of adaptively increasing size by degrees. Theoretical Analysis and experiment show that compared with traditional particle swarm optimization (PSO) algorithm, it can make solution efficiency greatly improved and is an effective method for solving geometric constraint problems.

Index Terms—geometric constraint solving, particle swarm optimization, hierarchy, adaptive size

[PDF]

Cite: Wenhui Li, Mingyu Sun, Huiying Li, Bo Fu, Huichun Li, "Hierarchy and Adaptive Size Particle Swarm Optimization Algorithm for Solving Geometric Constraint Problems," Journal of Software vol. 7, no. 11, pp. 2567-2574, 2012.

General Information

ISSN: 1796-217X (Online)
Frequency:  Bimonthly (Since 2020)
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, Google Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsw@iap.org
  • Apr 26, 2021 News!

    Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec)     [Click]

  • Jun 22, 2020 News!

    Papers published in JSW Vol 14, No 1- Vol 15 No 4 have been indexed by DBLP     [Click]

  • Sep 13, 2021 News!

    The papers published in Vol 16, No 6 have all received dois from Crossref    [Click]

  • Jan 28, 2021 News!

    [CFP] 2021 the annual meeting of JSW Editorial Board, ICCSM 2021, will be held in Rome, Italy, July 21-23, 2021   [Click]

  • Sep 13, 2021 News!

    Vol 16, No 6 has been published with online version     [Click]