Article

Geometric particle swarm optimisation on binary and real spaces: from theory to practice

Authors:

Cecilia Di Chio,

Alberto Moraglio,

Riccardo PoliAuthors Info & Claims

GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation

Pages 2659 - 2666

https://doi.org/10.1145/1274000.1274079

Published: 07 July 2007 Publication History

Abstract

Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continuous and combinatorial spaces. In previous work we have developed the theory behind it. The aim of this paper is to demonstrate the applicability of GPSO in practice. We demonstrate this for the cases of Euclidean, Manhattan and Hamming spaces and report extensive experimental results.

References

[1]

T. Bäck and D. B. Fogel and T. Michalewicz. Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, 2000.

[2]

M. Clerc. Discrete Particle Swarm Optimization, Illustrated by the Traveling Salesman Problem. New Optimization Techniques in Engineering, Springer, 2004.

[3]

M. Deza, M. Laurent. Geometry of cuts and metrics. Springer, 1991.

Digital Library

[4]

J. Kennedy and R. C. Eberhart, A Discrete Binary Version of the Particle Swarm Algorithm, IEEE, 1997.

[5]

J. Kennedy and R. C. Eberhart, Swarm Intelligence, Morgan Kaufmann Publishers, 2001.

Digital Library

[6]

S. Luke, L. Spector. A Revised Comparison of Crossover and Mutation in Genetic Programming. Proceedings of Genetic Programming Conference, 1998.

[7]

A. Moraglio, R. Poli. Topological interpretation of crossover. Proceedings of the Genetic and Evolutionary Computation Conference, 2004.

[8]

A. Moraglio, R. Poli. Topological crossover for the permutation representation. GECCO 2005 Workshop on Theory of Representations, 2005.

Digital Library

[9]

A. Moraglio, R. Poli. Geometric Landscape of Homologous Crossover for Syntactic Trees. Proceedings of the 2005 IEEE Congress on Evolutionary Computation, 2005.

[10]

A. Moraglio, R. Poli, and R. Seehuus. Geometric Crossover for Biological Sequences. Proceedings of European Conference on Genetic Programming, 2006.

Digital Library

[11]

A. Moraglio, R. Poli. Product Geometric Crossover. Proceedings of the Parallel Problem Solving from Nature Conference, 2006.

Digital Library

[12]

A. Moraglio, R. Poli. Geometric Crossover for Sets, Multisets and Partitions. Proceedings of the Parallel Problem Solving from Nature Conference, 2006.

Digital Library

[13]

A. Moraglio, C. Di Chio, and R. Poli. Geometric Particle Swarm Optimisation. Proceedings of European Conference on Genetic Programming, 2007.

Digital Library

[14]

P. M. Pardalos, M. G. C. Resende. Handbook of Applied Optimization. Oxford University Press, 2002.

[15]

N. Radcliffe. Equivalence Class Analysis of Genetic Algorithms. Journal of Complex Systems, 1991, vol. 5, pages 183--205.

[16]

M. L. J. VandeVel. Theory of Convex Structures. North-Holland, 1993.

Cited By

Macedo MSiqueira HFigueiredo ESantana CLira RGokhale ABastos-Filho C(2021)Overview on Binary Optimization Using Swarm-Inspired AlgorithmsIEEE Access10.1109/ACCESS.2021.31247109(149814-149858)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3124710
Moraglio AMoore J(2012)Geometry of evolutionary algorithmsProceedings of the 14th annual conference companion on Genetic and evolutionary computation10.1145/2330784.2330942(1317-1344)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1145/2330784.2330942
Moraglio ALanzi P(2011)Geometry of evolutionary algorithmsProceedings of the 13th annual conference companion on Genetic and evolutionary computation10.1145/2001858.2002144(1439-1468)Online publication date: 12-Jul-2011
https://dl.acm.org/doi/10.1145/2001858.2002144
Show More Cited By

Index Terms

Geometric particle swarm optimisation on binary and real spaces: from theory to practice
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Geometric particle swarm optimization for the sudoku puzzle
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation

Geometric particle swarm optimization (GPSO) is a recentlyintroduced generalization of traditional particle swarm optimization(PSO) that applies to all combinatorial spaces. The aim of thispaper is to demonstrate the applicability of GPSO to non-...
A fuzzy adaptive turbulent particle swarm optimisation

Particle Swarm Optimisation (PSO) algorithm is a stochastic search technique, which has exhibited good performance across a wide range of applications. However, very often for multimodal problems involving high dimensions, the algorithm tends to suffer ...
Dynamic task scheduling with load balancing using parallel orthogonal particle swarm optimisation

This paper presents a novel approach for dynamic task scheduling using particle swarm optimisation. Particle swarm optimisation (PSO) is a population-based meta-heuristic method which can be used to solve np-hard problems. The algorithm has been ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation

July 2007

1450 pages

ISBN:9781595936981

DOI:10.1145/1274000

Program Chairs:
Peter A. N. Bosman
Centre for Mathematics & Computer Science, The Netherlands
,
Tina Yu
Memorial University of Newfoundland, Canada
,
Anikó Ekárt
Aston University, UK

Copyright © 2007 ACM.

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: 07 July 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GECCO07

Sponsor:

GECCO07: Genetic and Evolutionary Computation Conference

July 7 - 11, 2007

London, United Kingdom

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
230
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Macedo MSiqueira HFigueiredo ESantana CLira RGokhale ABastos-Filho C(2021)Overview on Binary Optimization Using Swarm-Inspired AlgorithmsIEEE Access10.1109/ACCESS.2021.31247109(149814-149858)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3124710
Moraglio AMoore J(2012)Geometry of evolutionary algorithmsProceedings of the 14th annual conference companion on Genetic and evolutionary computation10.1145/2330784.2330942(1317-1344)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1145/2330784.2330942
Moraglio ALanzi P(2011)Geometry of evolutionary algorithmsProceedings of the 13th annual conference companion on Genetic and evolutionary computation10.1145/2001858.2002144(1439-1468)Online publication date: 12-Jul-2011
https://dl.acm.org/doi/10.1145/2001858.2002144
Liu LWang DYang S(2008)Compound particle swarm optimization in dynamic environmentsProceedings of the 2008 conference on Applications of evolutionary computing10.5555/1787943.1788017(616-625)Online publication date: 26-Mar-2008
https://dl.acm.org/doi/10.5555/1787943.1788017

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents