Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: On the edge of feasibility: A case study of the particle swarm optimizer
Author: Bonyadi, M.
Michalewicz, Z.
Citation: Proceedings of the 2014 IEEE Congress on Evolutionary Computation, 2014 / pp.3059-3066
Publisher: IEEE
Issue Date: 2014
ISBN: 9781479914883
Conference Name: 2014 IEEE Congress on Evolutionary Computation (CEC 2014) (06 Jul 2014 - 11 Jul 2014 : Beijing, China)
Statement of
Mohammad Reza Bonyadi, Zbigniew Michalewicz
Abstract: In many real-world constrained optimization problems (COPs) it is highly probable that some constraints are active at optimum points, i.e. some optimum points are boundary points between feasible and infeasible parts of the search space. A method is proposed which narrows the feasible area of a COP to its boundary. In the proposed method the thickness of the narrowed boundary is adjustable by a parameter. The method is extended in a way that it is able to limit the feasible regions to boundaries where at least one of the constraints in a given subset of all constraints is active and the remaining constraints might be active or not. Another extension is able to limit the search to cases where all constraints in a given subset are active and the rest might be active or not. The particle swarm optimization algorithm is used as a framework to compare the proposed methods. Results show that the proposed methods can limit the search to the requested boundary and they are effective in locating optimal solutions on the boundaries of the feasible and infeasible area.
Keywords: Particle swarm optimization, educational institutions, optimization, computer science, search problems, sociology
Rights: © 2014 IEEE
RMID: 0030022061
DOI: 10.1109/CEC.2014.6900343
Grant ID:
Appears in Collections:Computer Science publications

Files in This Item:
File Description SizeFormat 
RA_hdl_108595.pdfRestricted Access1.44 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.