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

DOI10.1155/2015/940592zbMATH Open1394.90582OpenAlexW1565353536WikidataQ59120355 ScholiaQ59120355MaRDI QIDQ1667014FDOQ1667014

Zhicheng Ji, Na Tian

Publication date: 27 August 2018

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

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

Mathematics Subject Classification ID

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

Cites Work

• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• 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
• A novel strategy of Pareto-optimal solution searching in multi-objective particle swarm optimization (MOPSO)

Cited In (2)

• A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
• A novel multiobjective quantum-behaved particle swarm optimization based on the ring model

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)