An efficient hybrid multi-objective particle swarm optimization with a multi-objective dichotomy line search
DOI10.1016/j.cam.2014.11.056zbMath1309.90128OpenAlexW1985434370MaRDI QIDQ484884
Yi-hong Xu, Bin-Bin Liu, Gang Xu, Ai-jun Wu, Yu-qun Yang
Publication date: 8 January 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2014.11.056
multi-objective optimizationparticle swarm optimizationnon-dominated solutionsmulti-objective dichotomy linear search
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integrating particle swarm optimization with genetic algorithms for solving nonlinear optimization problems
- A rank based particle swarm optimization algorithm with dynamic adaptation
- A novel strategy of Pareto-optimal solution searching in multi-objective particle swarm optimization (MOPSO)
- An adaptive parameter tuning of particle swarm optimization algorithm
- On solving multiobjective bin packing problems using evolutionary particle swarm optimization
- Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients
- Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique
- A hybrid immune multiobjective optimization algorithm
This page was built for publication: An efficient hybrid multi-objective particle swarm optimization with a multi-objective dichotomy line search