Please use this identifier to cite or link to this item:
Title: A multiobjective bacterial optimization method based on comprehensive learning strategy for environmental/economic power dispatch
Authors: Tan, L
Wang, H
Zhang, F
Feng, Y
Keywords: Bacterial foraging optimization
Comprehensive learning strategy
Environmental/economic power dispatch
Multi-objective problems
Issue Date: 2016
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2016, v. 9713, p. 400-407 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: This article extends the bacterial foraging optimization (BFO) for addressing the multi-objective environmental/economic power dispatch (EED) problem. This new approach, abbreviated as MCLBFO, is proposed based on the comprehensive learning strategy to improve the search capability of BFO for the optimal solution. Besides, the fitness survival mechanism based on a health sorting technique is employed and embedded in reproduction mechanism to enhance the quality of the bacteria swarm. The diversity of the solutions is achieved by the combination of two typical techniques, i.e. non-dominance sorting and crowded distance. Experimental tests on the stan-dard IEEE 30-bus, 6-generator test system demonstrate that the novel algorithm, MCLBFO, is superior to other well developed methods such as MOEA/D, SMS-EMOA and FCPSO. The results of the comparison indicate that MCLBFO is outstanding in handling optimization problems with multiple conflicting objectives.
Description: International Conference in Swarm Intelligence, ICSI 2016, Indonesia, 25-30 June 2016
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-319-41009-8_43
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Checked on Aug 13, 2017

Google ScholarTM



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