A newly proposed computational method known as the three-stage passive particle swarm optimization algorithm achieves superior performance and robustness in solving the classical p-median problem. The p-median problem, or PMP, is a classical NP-hard challenge in location science for which numerous computational methods have been developed. To improve the comprehensive performance of an earlier approach called novel discrete particle swarm optimization, researchers designed the three-stage passive particle swarm optimization algorithm, designated as TSPPSO. Experimental evaluations confirm that the new algorithm demonstrates notable simplicity, superiority, and robust execution.
To establish the swarm particles, the algorithm implements an integer encoding scheme paired with a random particle generation method.
At the core of the TSPPSO framework is a three-stage evolution strategy developed to guide the swarm. This evolutionary process incorporates three mechanisms: single point crossover, single point mutation, and a dynamic probability mechanism.
In addition to the three-stage evolution strategy, the framework integrates a passive strategy tailored for passive particles.
To validate the effectiveness and advantages of TSPPSO, researchers conducted experiments across 40 PMP instances. The team benchmarked the performance of TSPPSO against eight representative methods developed for the p-median problem. Experimental results from these comparisons demonstrated the performance, simplicity, superiority, and robustness of TSPPSO across the test instances.
Subject of Research: Particle swarm optimization for the p-median problem
Article Title: A novel three stage passive particle swarm optimization algorithm for the p-median problem
Article References: An, M., Xiang, W., Lu, Y., Zhu, W., & Liu, L. (2026). A novel three stage passive particle swarm optimization algorithm for the p-median problem. Scientific Reports, 16(1), Article 38116. https://doi.org/10.1038/s41598-026-78860-0
Image Credits: AI Generated
DOI: 10.1038/s41598-026-78860-0
Keywords: p-median problem, location science, NP-hard problem, particle swarm optimization, novel discrete particle swarm optimization, NDPSO, TSPPSO, three-stage evolution strategy, passive strategy, passive particles, single point crossover, single point mutation, dynamic probability mechanism, integer encoding scheme, random particle generation, swarm particles, PMP instances, algorithm robustness
Cite Scienmag News
Gavin Prescott. (November 18, 2026). Passive Swarm Algorithm Enhances Solutions for Classical P-Median Location Problems. Scienmag. https://scienmag.com/passive-swarm-algorithm-enhances-solutions-for-classical-p-median-location-problems/
Gavin Prescott. "Passive Swarm Algorithm Enhances Solutions for Classical P-Median Location Problems." Scienmag, 18 November 2026, https://scienmag.com/passive-swarm-algorithm-enhances-solutions-for-classical-p-median-location-problems/. Accessed 19 November 2026.
Gavin Prescott. "Passive Swarm Algorithm Enhances Solutions for Classical P-Median Location Problems." Scienmag. November 18, 2026. https://scienmag.com/passive-swarm-algorithm-enhances-solutions-for-classical-p-median-location-problems/








