Probability distribution of solution time in GRASP: An experimental investigation

Journal of Heuristics

Volumn 8, Issue 3, 2002, Pages 343-373

  Aiex, Renata M ^a   Resende, Mauricio G C ^b   Ribeiro, Celso C ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Combinatorial optimization; Experimental analysis of algorithms; GRASP; Meta heuristic; Parallel algorithm; Probability distribution

Indexed keywords

FORTRAN (PROGRAMMING LANGUAGE); GRAPHIC METHODS; ITERATIVE METHODS; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PARAMETER ESTIMATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

COMBINATORIAL OPTIMIZATION; EXPONENTIAL DISTRIBUTION; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; METAHEURISTIC; SOLUTION TIME;

HEURISTIC METHODS;

EID: 0036566527     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1015061802659     Document Type: Article

References (36)

1. Parallel biased search for combinatorial optimization: Genetic algorithms and TABU
2. QAPLIB-a quadratic assignment problem library
3. An analysis of heuristics for the maximum planar subgraph problem
4. Slow annealing versus multiple fast annealing runs: An empirical investigation
5. A probabilistic analysis of local search
6. A probabilistic heuristic for a computationally difficult set covering problem
7. Greedy randomized adaptive search procedures
8. A greedy randomized adaptive search procedure for maximum independent set
9. GRASP: An annotated bibliography
10. Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory
11. An efficient graph planarization two-phase heuristic
12. Semi-greedy heuristics: An empirical study
13. Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
14. A greedy randomized adaptive search procedure for the quadratic assignment problem
15. A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy
16. A parallel GRASP for the Steiner problem in graphs
17. A parallel GRASP for the data association multidimensional assignment problem
18. A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks
19. A parallel GRASP implementation for the quadratic assignment problem
20. A parallel GRASP for MAX-SAT problems
21. Algorithm 769 fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP
22. GRASP: In the QAP: An acceptance bound for initial solution
23. A modified local search for GRASP in the quadratic assignment problem
24. Computing approximate solutions of the maximum covering problem using GRASP
25. A GRASP for satisfiability
26. Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
27. Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
28. Approximate solution of weighted MAX-SAT problems using GRASP
29. Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP
30. A GRASP for graph planarization
31. Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP
32. Noise strategies for improving local search
33. Robust taboo search for the quadratic assignment problem
34. Parallel local search