Abstract
Real-life problems are often subject to various constraints that limit the search space to a constrained area. Due to the complexity of constraints, a general deterministic solution is often hard to find. A relaxed constraint particle swarm optimization algorithm is proposed in this paper.