IDEAS home Printed from
   My bibliography  Save this article

A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization


  • Abbas El Dor


  • Maurice Clerc


  • Patrick Siarry



Particle swarm optimization (PSO) is characterized by a fast convergence, which can lead the algorithms of this class to stagnate in local optima. In this paper, a variant of the standard PSO algorithm is presented, called PSO-2S, based on several initializations in different zones of the search space, using charged particles. This algorithm uses two kinds of swarms, a main one that gathers the best particles of auxiliary ones, initialized several times. The auxiliary swarms are initialized in different areas, then an electrostatic repulsion heuristic is applied in each area to increase its diversity. We analyse the performance of the proposed approach on a testbed made of unimodal and multimodal test functions with and without coordinate rotation and shift. The Lennard-Jones potential problem is also used. The proposed algorithm is compared to several other PSO algorithms on this benchmark. The obtained results show the efficiency of the proposed algorithm. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • Abbas El Dor & Maurice Clerc & Patrick Siarry, 2012. "A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization," Computational Optimization and Applications, Springer, vol. 53(1), pages 271-295, September.
  • Handle: RePEc:spr:coopap:v:53:y:2012:i:1:p:271-295 DOI: 10.1007/s10589-011-9449-4

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Andrzej Ruszczynski & Alexander Shapiro, 2004. "Optimization of Convex Risk Functions," Risk and Insurance 0404001, EconWPA, revised 08 Oct 2005.
    2. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    3. Schlottmann, Frank & Seese, Detlef, 2004. "A hybrid heuristic approach to discrete multi-objective optimization of credit portfolios," Computational Statistics & Data Analysis, Elsevier, pages 373-399.
    4. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    5. Hans Kellerer & Renata Mansini & M. Speranza, 2000. "Selecting Portfolios with Fixed Costs and Minimum Transaction Lots," Annals of Operations Research, Springer, vol. 99(1), pages 287-304, December.
    6. Philippe Artzner & Freddy Delbaen & Jean-Marc Eber & David Heath, 1999. "Coherent Measures of Risk," Mathematical Finance, Wiley Blackwell, vol. 9(3), pages 203-228.
    7. Gomes da Silva, Carlos & Climaco, Joao & Figueira, Jose, 2006. "A scatter search method for bi-criteria {0, 1}-knapsack problems," European Journal of Operational Research, Elsevier, vol. 169(2), pages 373-391, March.
    8. repec:pal:jorsoc:v:54:y:2003:i:9:d:10.1057_palgrave.jors.2601596 is not listed on IDEAS
    9. Mahmoud H. Alrefaei & Sigrún Andradóttir, 1999. "A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization," Management Science, INFORMS, pages 748-764.
    10. Selcen (Pamuk) Phelps & Murat Köksalan, 2003. "An Interactive Evolutionary Metaheuristic for Multiobjective Combinatorial Optimization," Management Science, INFORMS, pages 1726-1738.
    11. Crama, Y. & Schyns, M., 2003. "Simulated annealing for complex portfolio selection problems," European Journal of Operational Research, Elsevier, vol. 150(3), pages 546-571, November.
    12. Ogryczak, Wlodzimierz & Ruszczynski, Andrzej, 1999. "From stochastic dominance to mean-risk models: Semideviations as risk measures," European Journal of Operational Research, Elsevier, vol. 116(1), pages 33-50, July.
    13. Rockafellar, R. Tyrrell & Uryasev, Stanislav, 2002. "Conditional value-at-risk for general loss distributions," Journal of Banking & Finance, Elsevier, vol. 26(7), pages 1443-1471, July.
    14. Jones, D. F. & Mirrazavi, S. K. & Tamiz, M., 2002. "Multi-objective meta-heuristics: An overview of the current state-of-the-art," European Journal of Operational Research, Elsevier, vol. 137(1), pages 1-9, February.
    15. Steuer, Ralph E. & Na, Paul, 2003. "Multiple criteria decision making combined with finance: A categorized bibliographic study," European Journal of Operational Research, Elsevier, vol. 150(3), pages 496-515, November.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Kedar Nath Das & Raghav Prasad Parouha, 2016. "Optimization with a novel hybrid algorithm and applications," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 443-473, September.
    2. repec:eee:apmaco:v:256:y:2015:i:c:p:666-701 is not listed on IDEAS


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:53:y:2012:i:1:p:271-295. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.