Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
Design and Analysis of Experiments
Design and Analysis of Experiments
Multiple trajectory search for unconstrained/constrained multi-objective optimization
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
A review of multiobjective test problems and a scalable test problem toolkit
IEEE Transactions on Evolutionary Computation
A distributed Cooperative coevolutionary algorithm for multiobjective optimization
IEEE Transactions on Evolutionary Computation
Dominance-Based Multiobjective Simulated Annealing
IEEE Transactions on Evolutionary Computation
Memetic algorithm with local search chaining for large scale continuous optimization problems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Multiple trajectory search for unconstrained/constrained multi-objective optimization
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
WSEAS Transactions on Computers
Multi-Pareto-Ranking evolutionary algorithm
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Adaptive multi-objective genetic algorithm using multi-pareto-ranking
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Comprehensive Survey of the Hybrid Evolutionary Algorithms
International Journal of Applied Evolutionary Computation
Multi Agent Collaborative Search based on Tchebycheff decomposition
Computational Optimization and Applications
Hi-index | 0.00 |
Many real-world optimization problems involve multiple conflicting objectives. Therefore, multi-objective optimization has attracted much attention of researchers and many algorithms have been developed for solving multi-objective optimization problems in the last decade. In this paper the multiple trajectory search (MTS) is presented and successfully applied to thirteen unconstrained and ten constrained multi-objective optimization problems. These problems constitute a test suite provided for competition in the Special Session & Competition on Performance Assessment of Constrained/Bound Constrained Multi-Objective Optimization Algorithms in CEC 2009. In the multiple trajectory search, a set of uniformly distributed solutions is first generated. These solutions will be separated into foreground solutions and background solutions. The search is focuses mainly on foreground solutions and partly on background solutions. The MTS chooses and applies one of the three local search methods on solutions iteratively. The three local search methods begin their search in a very large "neighborhood". Then the neighborhood contracts step by step until it reaches a pre-defined tiny size, after then, it is reset to its original size. By utilizing such size-varied neighborhood searches, the MTS effectively solves the multi-objective optimization problems.