Sciweavers

HEURISTICS
2002
122views more  HEURISTICS 2002»
13 years 11 months ago
Complete Local Search with Memory
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
Diptesh Ghosh, Gerard Sierksma
HEURISTICS
2002
99views more  HEURISTICS 2002»
13 years 11 months ago
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...
HEURISTICS
2002
65views more  HEURISTICS 2002»
13 years 11 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...
HEURISTICS
2002
88views more  HEURISTICS 2002»
13 years 11 months ago
The Parallel Variable Neighborhood Search for the p-Median Problem
Félix García-López, Bel&eacut...