A Multiobjective Particle Swarm Optimizer for Constrained Optimization

A Multiobjective Particle Swarm Optimizer for Constrained Optimization

Gary G. Yen (Oklahoma State University, USA) and Wen-Fung Leong (Oklahoma State University, USA)
Copyright: © 2013 |Pages: 25
DOI: 10.4018/978-1-4666-2479-5.ch005
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Constraint handling techniques are mainly designed for evolutionary algorithms to solve constrained multiobjective optimization problems (CMOPs). Most multiojective particle swarm optimization (MOPSO) designs adopt these existing constraint handling techniques to deal with CMOPs. In the proposed constrained MOPSO, information related to particles’ infeasibility and feasibility status is utilized effectively to guide the particles to search for feasible solutions and improve the quality of the optimal solution. This information is incorporated into the four main procedures of a standard MOPSO algorithm. The involved procedures include the updating of personal best archive based on the particles’ Pareto ranks and their constraint violation values; the adoption of infeasible global best archives to store infeasible nondominated solutions; the adjustment of acceleration constants that depend on the personal bests’ and selected global best’s infeasibility and feasibility status; and the integration of personal bests’ feasibility status to estimate the mutation rate in the mutation procedure. Simulation to investigate the proposed constrained MOPSO in solving the selected benchmark problems is conducted. The simulation results indicate that the proposed constrained MOPSO is highly competitive in solving most of the selected benchmark problems.
Chapter Preview
Top

1. Introduction

In real world applications, most optimization problems are subject to different types of constraints. These problems are known as the constrained optimization problems (COPs) or constrained multiobjective optimization problems (CMOPs) if more than one objective function is involved. Comprehensive survey (Michalewicz & Schoenauer, 1996; Mezura-Montes & Coell Coello, 2006) shows a variety of constraint handling techniques have been developed to counter the deficiency of evolutionary algorithms (EAs), in which, their original design are unable to deal with constraints in an effective manner. These techniques are mainly targeted at EAs, particularly genetic algorithms (GAs), to solve COPs (Runarsson & Yao, 2005; Takahama & Sakai, 2006; Cai & Wang, 2006; Wang et al., 2007, 2008; Oyama et al., 2007; Tessema & Yen, 2009) and CMOPs (Fonseca & Fleming, 1998; Coello & Christiansen, 1999; Binh & Korn, 1997; Deb et al., 2002; Kurpati et al., 2002; Hingston et al., 2006; Jimenéz et al., 2002; Ray & Won, 2005; Harada et al., 2007; Geng et al., 2006; Zhang et al., 2006; Chafekar, Xuan & Rasheed, 2003; Woldesenbet, Tessema, & Yen, 2009). During the past few years, due to the success of particle swarm optimization (PSO) in solving many unconstrained optimization problems, research on incorporating existing constraint handling techniques in PSO for solving COPs is steadily gaining attention (Parsopoulus & Vrahatis, 2002; Zielinski & Laur, 2006; He & Wang, 2007; Pulido & Coello, 2004; Liu, Wang, & Li, 2008; Lu & Chen, 2006; Li, Li, & Yu, 2008; Liang & Suganthan, 2006; Cushman, 2007; Wei & Wang, 2006). Nevertheless, many real world problems are often multiobjective in nature. The ultimate goal is to develop multiobjective particle swarm optimization algorithms (MOPSOs) that effectively solve CMOPs. In addition to this perspective, the recent successes of MOPSOs in solving unconstrained MOPs have further motivated us to design a constrained MOPSO to solve CMOPs.

Considering a minimization problem, the general form of the CMOP with objective functions is given as follows:

(1) subject to
(2a)
(2b)
(2c) whereis the decision vector of decision variables. Its upper and lower bounds in Equation 2c define the search space, represents the jth inequality constraint, while represents the jth equality constraint. The inequality constraints that are equal to zero, i.e., , at the global optimum of a given problem are called active constraints. The feasible region is defined by satisfying all constraints (Equations 2a-2b). A solution in the feasible region is called a feasible solution, otherwise it is considered an infeasible solution.

Complete Chapter List

Search this Book:
Reset