Abstract

Stochastic search methods, such as the particle swarm optimization (PSO) algorithm, are primarily directed by two main features — exploration and exploitation. Exploration is the ability of the algorithm to broadly search through the solution space for new quality solutions, whereas exploitation is responsible for refining the search in the neighborhood of the good solutions found previously. Proper balance between these features is sought, to obtain good performance of these algorithms. An explorative mechanism is introduced in this paper to improve the performance of the PSO algorithm. The method is based on introducing artificial exploration into the algorithm by randomly repositioning the particles approaching stationary status. A velocity measure is used to distinguish between flying and stationary particles. This can be sought as a sudden death followed by a rebirth of these particles. Two options are tested for the rebirthing mechanism, which are (i) clearing and (ii) keeping the memory of rebirthing particles. The global best particle is exempted from rebirthing process so that the most useful of the swarm’s past experiences is not lost. The method is applied to a benchmark storm water network design problem and the results are presented and compared with those of the original algorithm and other methods. The proposed method, though simple, is shown to be very effective in avoiding local optima, leading to an improved version of the algorithm at no extra computational effort.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.