Probability distribution of solution time in GRASP: an experimental investigation
From MaRDI portal
Publication:1850990
DOI10.1023/A:1015061802659zbMATH Open1012.68795MaRDI QIDQ1850990FDOQ1850990
Authors: Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro 
Publication date: 15 December 2002
Published in: Journal of Heuristics (Search for Journal in Brave)
Recommendations
combinatorial optimizationparallel algorithmprobability distributionmeta-heuristicGRASPexperimental analysis of algorithms
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)
Cited In (44)
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
- Parallel Greedy Randomized Adaptive Search Procedures
- Solving the traveling delivery person problem with limited computational time
- Clonal selection: an immunological algorithm for global optimization over continuous spaces
- Piecewise linear time series estimation with GRASP
- Routing and wavelength assignment by partition colouring
- Hybridizations of GRASP with path relinking for the far from most string problem
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- Randomized heuristics for the Max-Cut problem
- Model and methods to address urban road network problems with disruptions
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- Adaptive memory in multistart heuristics for multicommodity network design
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- Heuristics for the generalized median graph problem
- Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem
- Extending time-to-target plots to multiple instances
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- A GRASP metaheuristic for microarray data analysis
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- GENVNS-TS-CL-PR: a heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery
- Large-scale parallelism for constraint-based local search: the costas array case study
- Statistical inferences for termination of Markov type random search algorithms
- Variable neighborhood descent with iterated local search for routing and wavelength assignment
- Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
- A nonmonotone GRASP
- Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
- Grice-representability of response time distribution families
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
- GRASP with path-relinking for the generalized quadratic assignment problem
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Efficient approaches for the flooding problem on graphs
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search
- Designing vehicle routes for a mix of different request types, under time windows and loading constraints
- Combinatorial search from an energy perspective
- TTT plots: a perl program to create time-to-target plots
- Efficient solutions for the far from most string problem
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
- Probabilistic stopping rules for GRASP heuristics and extensions
Uses Software
This page was built for publication: Probability distribution of solution time in GRASP: an experimental investigation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850990)
