A new polynomial-time algorithm for linear programming
Combinatorica
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Primal-dual interior-point methods
Primal-dual interior-point methods
Application of genetic algorithms to lubrication pump stacking design
Journal of Computational and Applied Mathematics - Special issue: Selected papers from the 2nd international conference on advanced computational methods in engineering (ACOMEN2002) Liege University, Belgium, 27-31 May 2002
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Quality improvement and optimization of test cases: a hybrid genetic algorithm based approach
ACM SIGSOFT Software Engineering Notes
Generating transformation rules from examples for behavioral models
Proceedings of the Second International Workshop on Behaviour Modelling: Foundation and Applications
Deriving high-level abstractions from legacy software using example-driven clustering
Proceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research
Example-Based sequence diagrams to colored petri nets transformation using heuristic search
ECMFA'10 Proceedings of the 6th European conference on Modelling Foundations and Applications
A global-local optimization approach to parameter estimation of RBF-type models
Information Sciences: an International Journal
CBSE'10 Proceedings of the 13th international conference on Component-Based Software Engineering
Hi-index | 7.29 |
Evolutionary algorithms are robust and powerful global optimization techniques for solving large-scale problems that have many local optima. However, they require high CPU times, and they are very poor in terms of convergence performance. On the other hand, local search algorithms can converge in a few iterations but lack a global perspective. The combination of global and local search procedures should offer the advantages of both optimization methods while offsetting their disadvantages. This paper proposes a new hybrid optimization technique that merges a genetic algorithm with a local search strategy based on the interior point method. The efficiency of this hybrid approach is demonstrated by solving a constrained multi-objective mathematical test-case.