Parallel biased search for combinatorial optimization: genetic algorithms and TABU
Microprocessors & Microsystems
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Mathematical Software (TOMS)
An analysis of some heuristics for the maximum planar subgraph problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
Artificial Intelligence
ACM Transactions on Mathematical Software (TOMS)
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
Discrete Applied Mathematics
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
Journal of Heuristics
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy
Journal of Global Optimization
A Parallel GRASP for MAX-SAT Problems
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
A Parallel GRASP for the Steiner Problem in Graphs
IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
INFORMS Journal on Computing
Journal of Experimental Algorithmics (JEA)
Metaheuristics for optimization problems in computer communications
Computer Communications
Efficient parallel cooperative implementations of GRASP heuristics
Parallel Computing
New heuristics for the maximum diversity problem
Journal of Heuristics
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Adaptive memory in multistart heuristics for multicommodity network design
Journal of Heuristics
A biased random-key genetic algorithm for routing and wavelength assignment
Journal of Global Optimization
Experiments in parallel constraint-based local search
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
GRASP with path-relinking for the generalized quadratic assignment problem
Journal of Heuristics
A GRASP-based approach to the generalized minimum spanning tree problem
Expert Systems with Applications: An International Journal
Variable neighborhood descent with iterated local search for routing and wavelength assignment
Computers and Operations Research
Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
GRASP with path-relinking for the maximum diversity problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Path-relinking intensification methods for stochastic local search algorithms
Journal of Heuristics
Targeting the Cell Broadband Engine for constraint-based local search
Concurrency and Computation: Practice & Experience
Operations Research Letters
Clonal selection: an immunological algorithm for global optimization over continuous spaces
Journal of Global Optimization
Journal of Global Optimization
Variable neighborhood search with ejection chains for the antibandwidth problem
Journal of Heuristics
Biased random-key genetic algorithm for linearly-constrained global optimization
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A GRASP metaheuristic for microarray data analysis
Computers and Operations Research
Power optimization in ad hoc wireless network topology control with biconnectivity requirements
Computers and Operations Research
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
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 sub-optimal target value in five GRASPs that have appeared in the literature and for which source code is available. The distributions are estimated by running 12,000 independent runs of the heuristic. Standard methodology for graphical analysis is used to compare the empirical and theoretical distributions and estimate the parameters of the distributions. We conclude that the solution time to a sub-optimal target value fits a two-parameter exponential distribution. Hence, it is possible to approximately achieve linear speed-up by implementing GRASP in parallel.