265 search results - page 23 / 53 » Neighborhood Composition: A Parallelization of Local Search ... |
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
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...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
COMPSAC
2002
IEEE
14 years 1 months ago
2002
IEEE
Genetic algorithms (GAs) are efficient non-gradient stochastic search methods. Parallel GAs are proposed to overcome the deficiencies of sequential GAs, such as low speed and aptn...
CPHYSICS
2008
13 years 8 months ago
2008
A scalable parallel algorithm has been designed to study long-time dynamics of many-atom systems based on the nudged elastic band method, which performs mutually constrained molec...