Sciweavers

61 search results - page 6 / 13
» Hardware Support for Simulated Annealing and Tabu Search
Sort
View
AMC
2005
136views more  AMC 2005»
14 years 9 months ago
Solving a dynamic cell formation problem using metaheuristics
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...
GECCO
2007
Springer
191views Optimization» more  GECCO 2007»
15 years 3 months ago
One-test-at-a-time heuristic search for interaction test suites
Algorithms for the construction of software interaction test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing test suite...
Renée C. Bryce, Charles J. Colbourn
AAAI
2000
14 years 11 months ago
Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
Laura Barbulescu, Jean-Paul Watson, L. Darrell Whi...
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
15 years 6 months ago
Fixed-outline Floorplanning through Better Local Search
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
Saurabh N. Adya, Igor L. Markov
AEI
2004
150views more  AEI 2004»
14 years 9 months ago
Ant colony optimization techniques for the vehicle routing problem
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
John E. Bell, Patrick R. McMullen