Sciweavers

250 search results - page 26 / 50
» Tabu Search on GPU
Sort
View
GECCO
2000
Springer
150views Optimization» more  GECCO 2000»
14 years 3 days ago
A Hybrid Genetic Algorithm for the Quadratic Assignment Problem
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...
Manuel Vázquez, L. Darrell Whitley
IPPS
2010
IEEE
13 years 6 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
14 years 2 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
TVCG
2011
274views more  TVCG 2011»
13 years 3 months ago
Memory-Scalable GPU Spatial Hierarchy Construction
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
Qiming Hou, Xin Sun, Kun Zhou, Christian Lauterbac...
HM
2007
Springer
135views Optimization» more  HM 2007»
14 years 2 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik