The effect of decoding fairness on particle swarm optimization for the p-median problem
Pages 1650 - 1657
Abstract
Solution encoding and decoding have a direct impact on meta-heuristic optimization methods. The mapping between search and solution spaces outlines the conditions for the metaheuristics and affects their ability to solve particular problems. The issue of encoding becomes especially pronounced when continuous metaheuristics are applied to discrete problems, in particular combinatorial problems with strict positional dependences in solution representations. This work takes a closer look at the decoding of combinations (fixed-length subsets) in continuous metaheuristics, demonstrates the inherent bias of simple combination decoding, and studies the effect of fair decoding in the context of the particle swarm optimization algorithm and the p-Median problem.
References
[1]
A. Al-Ani, A. Alsukker, and R. N. Khushaba. Feature subset selection using differential evolution and a wheel based search strategy. Swarm and Evolutionary Computation, 9:15--26, 2013.
[2]
T. Back and S. Khuri. An evolutionary heuristic for the maximum independent set problem. In Proc. of the First IEEE Conf. on Evolutionary Computation. IEEE World Congress on Computational Intelligence, pages 531--535 vol.2, 1994.
[3]
M. Z. Baig, N. Aslam, H. P. Shum, and L. Zhang. Differential evolution algorithm as a tool for optimal feature subset selection in motor imagery eeg. Expert Systems with Applications, 90:184--195, 2017.
[4]
M. Basti and M. Sevkli. An artificial bee colony algorithm for the p-median facility location problem. Int. Journal of Metaheuristics, 4(1):91--113, 2015.
[5]
M. R. Bonyadi and Z. Michalewicz. Analysis of stability, local convergence, and transformation sensitivity of a variant of the particle swarm optimization algorithm. IEEE Transactions on Evolutionary Computation, 20(3):370--385, 2016.
[6]
P. Cameron and S. Cameron. Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, 1994.
[7]
D. Candelero, G. F. Roberto, M. Z. do Nascimento, G. B. Rozendo, and L. A. Neves. Selection of cnn, haralick and fractal features based on evolutionary algorithms for classification of histological images. In 2020 IEEE Int. Conf. on Bioinformatics and Biomedicine (BIBM), pages 2709--2716, 2020.
[8]
E. S. Correa, M. T. A. Steiner, A. A. Freitas, and C. Carnieri. A genetic algorithm for the p-median problem. In L. Spector, E. D. Goodman, A. Wu, W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, and E. Burke, editors, Proc. of the Genetic and Evolutionary Computation Conf. (GECCO-2001), pages 1268--1275, San Francisco, California, USA, 7--11 July 2001. Morgan Kaufmann.
[9]
J. Demšar. Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res., 7:1--30, Dec. 2006.
[10]
M. Eddaly, B. Jarboui, and P. Siarry. Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. Journal of Computational Design and Engineering, 3(4):295--311, 2016.
[11]
A. Engelbrecht. Computational Intelligence: An Introduction, 2nd Edition. Wiley, New York, NY, USA, 2007.
[12]
J. Garcia-Nieto and E. Alba. Why six informants is optimal in pso. In Proc. of the 14th Annual Conf. on Genetic and Evolutionary Computation, GECCO '12, page 25--32, New York, NY, USA, 2012. Association for Computing Machinery.
[13]
G. W. Greenwood. Using differential evolution for a subclass of graph theory problems. IEEE Transactions on Evolutionary Computation, 13(5):1190--1192, 2009.
[14]
B. Jarboui, M. Cheikh, P. Siarry, and A. Rebai. Combinatorial particle swarm optimization (cpso) for partitional clustering problem. Applied Mathematics and Computation, 192:337--345, 09 2007.
[15]
H. Jongen, K. Meer, and E. Triesch. Optimization Theory. Springer US, 2013.
[16]
J. Kennedy and R. Eberhart. Particle swarm optimization. In Proc. of ICNN'95 - Int. Conf. on Neural Networks, volume 4, pages 1942--1948 vol.4, 1995.
[17]
R. N. Khushaba, A. Al-Ani, and A. Al-Jumaily. Differential evolution based feature subset selection. In 2008 19th Int. Conf. on Pattern Recognition, pages 1--4, 2008.
[18]
R. N. Khushaba, A. Al-Ani, and A. Al-Jumaily. Feature subset selection using differential evolution. In Int. Conf. on Neural Information Processing, pages 103--110. Springer, 2008.
[19]
P. Krömer, J. Platoš, J. Nowaková, and V. Snášel. Optimal column subset selection for image classification by genetic algorithms. Annals of Operations Research, 265(2):205--222, 2018.
[20]
P. Krömer and J. Platoš. Solving the p-median problem by a simple differential evolution. In 2014 IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC), pages 3503--3507, 2014.
[21]
P. Krömer, J. Platoš, and V. Snášel. Traditional and self-adaptive differential evolution for the p-median problem. In 2015 IEEE 2nd Int. Conf. on Cybernetics (CYBCONF), pages 299--304, 2015.
[22]
G. Lin and J. Guan. A hybrid binary particle swarm optimization for the obnoxious p-median problem. Information Sciences, 425:1--17, 2018.
[23]
N. Mladenović, J. Brimberg, P. Hansen, and J. A. Moreno-Pérez. The p-median problem: A survey of metaheuristic approaches. European Journal of Operational Research, 179(3):927 -- 939, 2007.
[24]
A. K. Panja, S. F. Karim, S. Neogy, and C. Chowdhury. A novel feature based ensemble learning model for indoor localization of smartphone users. Engineering Applications of Artificial Intelligence, 107:104538, 2022.
[25]
W. Pullan. A population based hybrid metaheuristic for the p-median problem. In 2008 IEEE Congress on Evolutionary Computation, CEC 2008, pages 75--82, 2008.
[26]
M. Sevkli, R. Mamedsaidov, and F. Camci. A novel discrete particle swarm optimization for p-median problem. Journal of King Saud University - Engineering Sciences, 26(1):11--19, 2014.
[27]
Y. Shitov. Column subset selection is np-complete. Linear Algebra and its Applications, 610:52--58, 2021.
[28]
B. Wei, W. Zhang, X. Xia, Y. Zhang, F. Yu, and Z. Zhu. Efficient feature selection algorithm based on particle swarm optimization with learning memory. IEEE Access, 7:166066--166078, 2019.
[29]
M. Zambrano-Bigiarini, M. Clerc, and R. Rojas. Standard particle swarm optimisation 2011 at cec-2013: A baseline for future pso improvements. In 2013 IEEE Congress on Evolutionary Computation, pages 2337--2344, 2013.
Index Terms
- The effect of decoding fairness on particle swarm optimization for the p-median problem
Recommendations
Particle swarm optimization for the continuous p-median problem
CIMMACS'07: Proceedings of the 6th WSEAS international conference on Computational intelligence, man-machine systems and cyberneticsThis work describes the application of the Particle Swarm Optimization (PSO) metaheuristic to the continuous version of the p-median problem. The problem consists in determining p points minimizing the weighted distance to a given set of points. This is ...
Euclidean Particle Swarm Optimization
ICINIS '09: Proceedings of the 2009 Second International Conference on Intelligent Networks and Intelligent SystemsParticle swarm optimization (PSO) is a swarm intelligence algorithm, has been successfully applied to many engineering optimization problems and shown its high search speed in these applications. However, as the dimension and the number of local optima ...
An improved cooperative quantum-behaved particle swarm optimization
Particle swarm optimization (PSO) is a population-based stochastic optimization. Its parameters are easy to control, and it operates easily. But, the particle swarm optimization is a local convergence algorithm. Quantum-behaved particle swarm ...
Comments
Information & Contributors
Information
Published In
July 2022
2395 pages
Copyright © 2022 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 the author(s) 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: 19 July 2022
Check for updates
Qualifiers
- Research-article
Funding Sources
- Ministerstvo ðkolství, Mládeðe a Tðlovðchovy
- Ministerstvo Školství, Mládeže a Tělovýchovy
Conference
GECCO '22
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 47Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in