As you probably address NP-hard problems, you are doomed in any case. :-) You cannot in general know whether one algorithm will beat another one, given a sufficiently large and diverse set of test problems. I suggest that you instead compare your code with a mathematical optimization methodology or two - that will be more interesting.
Dear friends
PSO is a new technique which was developed in 1995.But quantum PSO is its improved approaches(technique). So improved version always has many advantages like accuracy, stability, reliability, rate of Convergence on the given problem than PSO.
From my experience both are weak optimization methods, I would rather recommend improved variants of ABC or DE, or my NSC-PSO method (see my article "NSC-PSO, a Novel PSO Variant without Speeds and Coefficients") where I combine ideas from PSO and ABC. In the article I compare NSC-PSO with SPSO 2007, which was the standard at that time, and NSC-PSO proved much better.
- Badges
- Science topic