PSO Variants for TSP/QAP/Knapsack
Version 1.1.0.0 (1.72 MB) by
Zhifei Li
Particle Swarm Optimization for the combination optimization problems
The diversified PSO algorithms are used to resolve three typical NP-hard problems.
(1) PSO variants: standard PSO, adaptive PSO, quantum-behaved PSO, PSO-GA, PSO-GSA
(2) Problems: TSP, QAP, Knapsack
Cite As
Zhifei Li (2026). PSO Variants for TSP/QAP/Knapsack (https://www.mathworks.com/matlabcentral/fileexchange/60121-pso-variants-for-tsp-qap-knapsack), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Created with
R2014b
Compatible with any release
Platform Compatibility
Windows macOS LinuxCategories
- Mathematics and Optimization > Global Optimization Toolbox > Particle Swarm >
- MATLAB > Mathematics > Graph and Network Algorithms > Shortest Path > Traveling Salesman (TSP) >
- Mathematics and Optimization > Optimization Toolbox > Linear Programming and Mixed-Integer Linear Programming > Problem-Based Linear Programming >
Find more on Particle Swarm in Help Center and MATLAB Answers
Tags
Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
