Pareto-ranking based quantum-behaved particle swarm optimization for multiobjective optimization
From MaRDI portal
Publication:1667014
Recommendations
- Particle swarm with equilibrium strategy of selection for multi-objective optimization
- A novel multiobjective quantum-behaved particle swarm optimization based on the ring model
- A novel strategy of Pareto-optimal solution searching in multi-objective particle swarm optimization (MOPSO)
- scientific article; zbMATH DE number 6531618
- Comprehensive learning particle swarm optimizer for solving multiobjective optimization problems
Cites work
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A novel strategy of Pareto-optimal solution searching in multi-objective particle swarm optimization (MOPSO)
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Routing and scheduling in a flexible job shop by tabu search
Cited in
(5)- Solving bilevel multiobjective programming problem by elite quantum behaved particle swarm optimization
- A novel multiobjective quantum-behaved particle swarm optimization based on the ring model
- A novel multi-objective quantum particle swarm algorithm for suspension optimization
- A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
- Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: a review and state-of-the-art
This page was built for publication: Pareto-ranking based quantum-behaved particle swarm optimization for multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1667014)
