Probability distribution of solution time in GRASP: an experimental investigation
From MaRDI portal
Publication:1850990
DOI10.1023/A:1015061802659zbMath1012.68795MaRDI QIDQ1850990
Mauricio G. C. Resende, Celso Carneiro Ribeiro, Renata M. Aiex
Publication date: 15 December 2002
Published in: Journal of Heuristics (Search for Journal in Brave)
combinatorial optimizationGRASPprobability distributionparallel algorithmmeta-heuristicexperimental analysis of algorithms
Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)
Related Items (39)
Routing and wavelength assignment by partition colouring ⋮ A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks ⋮ 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 ⋮ A GRASP metaheuristic for microarray data analysis ⋮ Power optimization in ad hoc wireless network topology control with biconnectivity requirements ⋮ A nonmonotone GRASP ⋮ A biased random-key genetic algorithm for the maximum quasi-clique problem ⋮ Efficient approaches for the flooding problem on graphs ⋮ Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem ⋮ Combinatorial search from an energy perspective ⋮ Model and methods to address urban road network problems with disruptions ⋮ 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 ⋮ Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm ⋮ Using sequential runtime distributions for the parallel speedup prediction of SAT local search ⋮ TTT plots: a perl program to create time-to-target plots ⋮ Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs ⋮ A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure ⋮ Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ Adaptive memory in multistart heuristics for multicommodity network design ⋮ Clonal selection: an immunological algorithm for global optimization over continuous spaces ⋮ Variable neighborhood descent with iterated local search for routing and wavelength assignment ⋮ Efficient solutions for the far from most string problem ⋮ Randomized heuristics for the Max-Cut problem ⋮ \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms ⋮ On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics ⋮ Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines ⋮ Hybridizations of GRASP with path relinking for the far from most string problem ⋮ A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution ⋮ GRASP with path-relinking for the generalized quadratic assignment problem ⋮ Statistical inferences for termination of Markov type random search algorithms ⋮ GENVNS-TS-CL-PR: A heuristic approach for solving the vehicle routing problem with simultaneous pickup and delivery ⋮ 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 ⋮ Large-scale parallelism for constraint-based local search: the costas array case study ⋮ Solving the traveling delivery person problem with limited computational time ⋮ Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters ⋮ Designing vehicle routes for a mix of different request types, under time windows and loading constraints
Uses Software
This page was built for publication: Probability distribution of solution time in GRASP: an experimental investigation
