Some Methods for Nonlinear Multi-objective Optimization
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
INFORMS Journal on Computing
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Evolutionary multiobjective optimization
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Evolutionary Computation
Advances in Differential Evolution
Advances in Differential Evolution
Computers and Operations Research
Multi-objective evolutionary algorithm based on adaptive discrete differential evolution
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A hybrid evolutionary metaheuristics (HEMH) applied on 0/1 multiobjective knapsack problems
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
IEEE Transactions on Evolutionary Computation
A hybrid evolutionary approach with search strategy adaptation for mutiobjective optimization
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
Hybrid evolutionary metaheuristics tend to enhance search capabilities, by improving intensification and diversification, through incorporating different cooperative metaheuristics. In this paper, an improved version of the Hybrid Evolutionary Metaheuristics (HEMH) [7] is presented. Unlike HEMH, HEMH2 uses simple inverse greedy algorithm to construct its initial population. Then, the search efforts are directed to improve these solutions by exploring the search space using binary differential evolution. After a certain number of evaluations, path relinking is applied on high quality solutions to investigate the non-visited regions in the search space. During evaluations, the dynamic-sized neighborhood structure is adopted to shrink/extend the mating/updating range. Furthermore, the Pareto adaptive epsilon concept is used to control the archiving process with preserving the extreme solutions. HEMH2 is verified against its predecessor HEMH and the MOEA/D [13], using a set of MOKSP instances from the literature. The experimental results indicate that the HEMH2 is highly competitive and can achieve better results.