Logo Goletty

Lifecycle-based Swarm Optimization Method for Constrained Optimization
Journal Title Journal of Computers
Journal Abbreviation jcp
Publisher Group Academy Publisher
Website http://ojs.academypublisher.com
PDF (1,044 kb)
   
Title Lifecycle-based Swarm Optimization Method for Constrained Optimization
Authors Jin, Li; Zhu, Yunlong; Shen, Hai; Guo, Haifeng
Abstract Each  biologic  must  go  through  a  process  from birth, growth, reproduction until death, this process known as  life  cycle.  This  paper  borrows  the  biologic  life  cycle theory  to  propose  a  Lifecycle-based  Swarm  Optimization (LSO) algorithm. Based on some features of  life cycle, LSO designs six optimization operators: chemotactic, assimilation, transposition,  crossover,  selection  and  mutation.  In  this paper,  the  capability  of the  LSO  to  address  constrained optimization problem was investigated. Firstly, the proposed method  was  test  on  some  well-known  and  widely  used benchmark  problems. When compared  with  PSO,  we  can see  that  LSO  can  obtain  the  better  solution  and  lower standard  deviation  than  PSO  on  many  different  types  of constrained  optimization problems.  Finally,  LSO  was  also used for seeking the optimal route for vehicle route problem in  logistics  system.  The  result  of  LSO  is  the  best  when comparing  with PSO  and  GA.  The  results  of  above  two types  of  experiments, which  include  not  only  the  ordinary benchmark  problem  but  also  the  practical  problems  in engineering, demonstrate  that  LSO  is  a  competitive  and effective approach for solving constrained problems.
Publisher ACADEMY PUBLISHER
Date 2011-05-03
Source Journal of Computers Vol 6, No 5 (2011): Special Issue: Selected Best Papers of the International Workshop on CSEEE 2011
Rights Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html.

 

See other article in the same Issue


Goletty © 2024