202 search results - page 14 / 41 » Complexity of local search for the p-median problem |
COR
2006
13 years 7 months ago
2006
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
ICNC
2009
Springer
14 years 1 months ago
2009
Springer
—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...
CEC
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract— Over the last years, interest in hybrid metaheuristics has risen considerably in the field of optimization. Combinations of methods such as evolutionary algorithms and...