Sciweavers

273 search results - page 45 / 55
» Genetic local search for multi-objective combinatorial optim...
Sort
View
IEEECIT
2009
IEEE
15 years 5 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
GECCO
2004
Springer
103views Optimization» more  GECCO 2004»
15 years 3 months ago
Training Neural Networks with GA Hybrid Algorithms
Abstract. Training neural networks is a complex task of great importance in the supervised learning field of research. In this work we tackle this problem with five algorithms, a...
Enrique Alba, J. Francisco Chicano
70
Voted
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 2 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
CEC
2007
IEEE
15 years 7 days ago
Hybrid optimization using DIRECT, GA, and SQP for global exploration
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
Satoru Hiwa, Tomoyuki Hiroyasu, Mitsunori Miki
ECAI
2000
Springer
15 years 2 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon