Sciweavers

273 search results - page 5 / 55
» Genetic local search for multi-objective combinatorial optim...
Sort
View
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 4 months ago
Genetic multi-step search in interpolation and extrapolation domain
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki
89
Voted
SAC
2004
ACM
15 years 3 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...
78
Voted
SAGA
2001
Springer
15 years 2 months ago
Evolutionary Search for Smooth Maps in Motor Control Unit Calibration
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
Jan Poland, Kosmas Knödler, Alexander Mittere...
174
Voted
CORR
2010
Springer
427views Education» more  CORR 2010»
14 years 8 months ago
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algori
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
Poonam Garg
73
Voted
IDA
2003
Springer
15 years 3 months ago
An Iterated Local Search Approach for Minimum Sum-of-Squares Clustering
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
Peter Merz