Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2739480.2754810acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

The Effect of Quantum and Charged Particles on the Performance of the Dynamic Vector-evaluated Particle Swarm Optimisation Algorithm

Published: 11 July 2015 Publication History

Abstract

Many problems in the real-world have more than one objective, with at least two objectives in conflict with one another. In addition, at least one objective changes over time. These kinds of problems are called dynamic multi-objective optimisation problems (DMOOPs). Studies have shown that both the quantum particle swarm optimisation (QPSO) and charged particle swarm optimisation (CPSO) algorithms perform well in dynamic environments, since they maintain swarm diversity. Therefore, this paper investigates the effect of using either QPSOs or CPSOs in the sub-swarms of the dynamic vector-evaluated particle swarm optimisation (DVEPSO) algorithm. These DVEPSO variations are then compared against the default DVEPSO algorithm that uses gbest PSOs and DVEPSO using heterogeneous PSOs that contain both charged and quantum particles. Furthermore, all of the aforementioned DVEPSO configurations are compared against the dynamic multi-objective optimisation (DMOPSO) algorithm that was the winning algorithm of a comprehensive comparative study of dynamic multi-objective optimisation algorithms. The results indicate that charged and quantum particles improve the performance of DVEPSO, especially for DMOOPs with a deceptive POF and DMOOPs with a non-linear POS.

References

[1]
T. Blackwell and P. Bentley. Dynamic search with charged swarms. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 19--26, New York, U.S.A., 9--13 July 2002.
[2]
T. Blackwell and J. Branke. Multiswarms, exclusion, and anti-convergence in dynamic environments. IEEE Transactions on Evolutionary Computation, 10(4):459--472, August 2006.
[3]
C.A. Coello Coello and M. Lechuga. MOPSO: a proposal for multiple objective particle swarm optimization. In Proceedings of Congress on Evolutionary Computation, volume 2, pages 1051--1056, 2002.
[4]
M. Cámara, J. Ortega, and F. de Toro. A single front genetic algorithm for parallel multi-objective optimization in dynamic environments. Neurocomputing, 72(16--18):3570--3579, 2007.
[5]
A. Carlisle and G. Dozier. Tracking changing extrema with adaptive particle swarm optimizer. In Proceedings of World Automation Congress, volume 13, pages 265--270, Orlando, Florida, U.S.A., June 2002.
[6]
M. Farina, K. Deb, and P. Amato. Dynamic multiobjective optimization problems: test cases, approximations, and applications. IEEE Transactions on Evolutionary Computation, 8(5):425--442, October 2004.
[7]
C. Fonseca, L. Paquete, and M. Lopez-Ibanez. An improved dimension-sweep algorithm for the hypervolume indicator. In Proceedings of Congress on Evolutionary Computation, pages 1157--1163, New York, U.S.A., July 2006. Source code available online at: http://iridia.ulb.ac.be/ manuel/hypervolume. Last accessed on: 10 December 2013.
[8]
C.-K. Goh and K. Tan. A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization. IEEE Transactions on Evolutionary Computation, 13(1):103--127, February 2009.
[9]
M. Greeff and A. Engelbrecht. Solving dynamic multi-objective problems with vector evaluated particle swarm optimisation. In Proceedings of World Congress on Computational Intelligence (WCCI): Congress on Evoluationary Computation, pages 2917--2924, Hong Kong, June 2008.
[10]
M. Greeff and A. Engelbrecht. Dynamic multi-objective optimisation using PSO. In N. Nedjah, L. dos Santos Coelho, and L. de Macedo Mourelle, editors, Multi-Objective Swarm Intelligent Systems, volume 261 of Studies in Computational Intelligence, pages 105--123. Springer Berlin/Heidelberg, 2010.
[11]
K. Harrison, B. Ombuki-Berman, and A. Engelbrecht. Dynamic multi-objective optimization using sharged vector evaluated particle swarm optimization. In Proceedings of IEEE Congress on Evolutionary Computation, pages 1929--1936, July 2014.
[12]
M. Helbig. Solving dynamic multi-objective optimisation problems using vector evaluated particle swarm optimisation. PhD thesis, University of Pretoria, 2012.
[13]
M. Helbig and A. Engelbrecht. Archive management for dynamic multi-objective oınputwins-loss-overall-environment-typeo1ptimisation problems using vector evaluated particle swarm optimisation. In Proceedings of Congress on Evolutionary Computation, pages 2047--2054, New Orleans, U.S.A., June 2011.
[14]
M. Helbig and A. Engelbrecht. Analysing the performance of dynamic multi-objective optimisation algorithms. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 1531--1539, Cancún, Mexico, June 2013.
[15]
M. Helbig and A. Engelbrecht. Benchmarks for dynamic multi-objective optimisation. In Proc. of IEEE Symposium Series on Computational Intelligence, pages 84--91, Singapore, April 2013.
[16]
M. Helbig and A. Engelbrecht. Performance measures for dynamic multi-objective optimisation algorithms. Information Sciences, 250:61--81, November 2013.
[17]
M. Helbig and A. Engelbrecht. Benchmarks for dynamic multi-objective optimisation algorithms. ACM Computing Surveys, 46(3):37:1--37:39, 2014.
[18]
M. Helbig and A. Engelbrecht. Heterogeneous dynamic vector evaluated particle swarm optimisation for dynamic multi-objective optimisation. In IEEE Congress on Evoluationary Computation, pages 3151--3159, July 2014.
[19]
M. Lechuga. Multi-objective optimisation using sharing in swarm optimisation algorithms. PhD thesis, University of Birmingham, July 2009.
[20]
G. Pampará, A. Engelbrecht, and T. Cloete. CIlib: A collaborative framework for computational intelligence algorithms - Part I. In Proceedings of World Congress on Computational Intelligence, pages 1750--1757, Hong Kong, 1--8 June 2008. Source code available at: http://www.cilib.net. Last accessed on: 10 December 2013.
[21]
K. Parsopoulos and M. Vrahatis. Recent approaches to global optimization problems through particle swarm optimization. Natural Computing, 1(2--3):235--306, 2002.
[22]
F. v.d.Bergh and A. Engelbrecht. A study of particle swarm optimization particle trajectories. Information Sciences, 176(8):937--971, 2006.

Index Terms

  1. The Effect of Quantum and Charged Particles on the Performance of the Dynamic Vector-evaluated Particle Swarm Optimisation Algorithm

        Recommendations

        Comments

        Please enable JavaScript to view thecomments powered by Disqus.

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        GECCO '15: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation
        July 2015
        1496 pages
        ISBN:9781450334723
        DOI:10.1145/2739480
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 11 July 2015

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. charged pso
        2. dynamic multi-objective optimisation
        3. dynamic vecor-evaluated pso
        4. heterogeneous pso
        5. quantum pso

        Qualifiers

        • Research-article

        Conference

        GECCO '15
        Sponsor:

        Acceptance Rates

        GECCO '15 Paper Acceptance Rate 182 of 505 submissions, 36%;
        Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • 0
          Total Citations
        • 129
          Total Downloads
        • Downloads (Last 12 months)1
        • Downloads (Last 6 weeks)1
        Reflects downloads up to 17 Nov 2024

        Other Metrics

        Citations

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media