Parallel search algorithm for geometric constraints solving

Authors:
Hua Yuan;Wenhui Li;Kong Zhao;Rongqin Yi
Affiliations:
Key Lab. of Symbol Computation and Knowledge Eng. of the Ministry of Education, College of Computer Science and Techn., Jilin Univ., Changchun, China and School of Computer Science & Eng., Changch ...;Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China;Suzhou Top Institute of Information Technology, Suzhuo, China;Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China
Venue:
ICVR'07 Proceedings of the 2nd international conference on Virtual reality
Year:
2007

Citing 8
Cited 0

Optimization

Optimization
A graph-constructive approach to solving systems of geometric constraints

ACM Transactions on Graphics (TOG)
Optimization Software Guide

Optimization Software Guide
The random facet simplex algorithm on combinatorial cubes

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Solving Geometric Constraints By Homotopy

IEEE Transactions on Visualization and Computer Graphics
Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Dissipative particle swarm optimization

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a hybrid algorithm - (Parallel Search Algorithm) between PSO and simplex methods to approximate optimal solution for the Geometric Constraint problems. Locally, simplex is extended to reduce the number of infeasible solutions while solution quality is improved with an operation order search. Globally, PSO is employed to gain parallelization while solution diversity is maintained. Performance results on Geometric Constraint problems show that Parallel Search Algorithm outperforms existing techniques.