Pareto-ranking based quantum-behaved particle swarm optimization for multiobjective optimization

DOI10.1155/2015/940592MaRDI QIDQ1667014zbMATH OpenOpenAlexWikidataFDO

Authors Na Tian, Zhicheng Ji

Publication date 27 August 2018

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2015/940592

Mathematics Subject Classification ID

Quantum computation (81P68) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: A study on Pareto-ranking based quantum-behaved particle swarm optimization (QPSO) for multiobjective optimization problems is presented in this paper. During the iteration, an external repository is maintained to remember the nondominated solutions, from which the global best position is chosen. The comparison between different elitist selection strategies (preference order, sigma value, and random selection) is performed on four benchmark functions and two metrics. The results demonstrate that QPSO with preference order has comparative performance with sigma value according to different number of objectives. Finally, QPSO with sigma value is applied to solve multiobjective flexible job-shop scheduling problems.

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)

• A novel multiobjective quantum-behaved particle swarm optimization based on the ring model
• Solving bilevel multiobjective programming problem by elite quantum behaved particle swarm optimization
• A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
• A novel multi-objective quantum particle swarm algorithm for suspension optimization
• 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)