ArticleScientific reports2026
A novel quantum motivated particle swarm method with enhanced search strategy for electromagnetic optimization problems.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
1 author.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Parameter estimation of electromagnetic design problem is a complex task for traditional methods. However, quantum inspired optimization offers favorable advantages for tackling such problems. Since, many existing optimization techniques are prone to premature convergence due to an improper balanced exploration exploitation tradeoff and unstable control parameters. Therefore, to maintain a high solution quality it is necessary to overcome these challenges. In this context, this research work proposes a novel search-based quantum inspired particle swarm optimization (SQPSO) for electromagnetic applications. The proposed methodology incorporates a probability-based mutation mechanism guided by the global best solution, enabling more effective exploration of the search region. A tournament-driver selection strategy is further employed to identify superior particles and strengthen search diversity. In addition, a newly designed dynamic parameter strategy is incorporated to enhanced global search capability and improves algorithmic stability. Extensive benchmark tests and application-oriented case studies confirm that the proposed method consistently achieves faster convergence, higher-quality solutions and stronger robustness against local optima when compared with existing well-established metaheuristic techniques.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.