Evolutionary algorithms for constrained engineering problems
Computers and Industrial Engineering
An orthogonal simulated annealing algorithm for large floorplanning problems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Multiobjective optimization using dynamic neighborhood particle swarm optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
MOPSO: a proposal for multiple objective particle swarm optimization
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Multi-objective genetic algorithms: Problem difficulties and construction of test problems
Evolutionary Computation
An orthogonal genetic algorithm for multimedia multicast routing
IEEE Transactions on Evolutionary Computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
An orthogonal genetic algorithm with quantization for globalnumerical optimization
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
Hybrid Taguchi-genetic algorithm for global numerical optimization
IEEE Transactions on Evolutionary Computation
Intelligent evolutionary algorithms for large parameter optimization problems
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part II
Cooperative particle swarm optimization for multiobjective transportation planning
Applied Intelligence
Hi-index | 0.00 |
In this paper, we proposes a novel intelligent multi-objective particle swarm optimization (IMOPSO) to solve multi-objective optimization problems. High performance of IMOPSO mainly arises from two parts: one is using generalized Pareto-based scale-independent fitness function (GPSISF) can efficiently given all candidate solutions a score, and then decided candidate solutions level. The other one is replacing the conventional particle move process of PSO with an intelligent move mechanism (IMM) based on orthogonal experimental design to enhance the search ability. IMM can evenly sample and analyze from the best experience of an individual particle and group particles by using a systematic reasoning method, and then efficiently generate a good candidate solution for the next move of the particle. Some benchmark functions are used to evaluate the performance of IMOPSO, and compared with some existing multi-objective evolution algorithms. According to experimental results and analysis, they show that IMOPSO performs well.