Sciweavers

41 search results - page 7 / 9
» A fast hybrid genetic algorithm for the quadratic assignment...
Sort
View
CEC
2007
IEEE
13 years 9 months 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
WSC
2008
13 years 10 months ago
Mixed model assembly line balancing problem with fuzzy operation times and drifting operations
Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of ...
Weida Xu, Tianyuan Xiao
SIAMSC
2010
215views more  SIAMSC 2010»
13 years 6 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 11 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
14 years 1 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong