Probabilistic stopping rules for GRASP heuristics and extensions
From MaRDI portal
Publication:4924054
DOI10.1111/itor.12010zbMath1270.90108OpenAlexW2065703764MaRDI QIDQ4924054
Isabel Rosseti, Reinaldo C. Souza, Celso Carneiro Ribeiro
Publication date: 30 May 2013
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12010
heuristicscombinatorial optimizationmetaheuristicsartificial intelligencelocal searchexperimental resultsapplied probability
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems ⋮ Improved heuristics for the regenerator location problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- Looking ahead with the pilot method
- Statistical inferences for termination of Markov type random search algorithms
- QAPLIB - a quadratic assignment problem library
- Greedy randomized adaptive search procedures
- A hybrid heuristic for the \(p\)-median problem
- Bayesian stopping rules for greedy randomized procedures
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- Bayesian stopping rules for multistart global optimization methods
- Assignment Problems and the Location of Economic Activities
- An annotated bibliography of GRASP-Part II: Applications
- Stopping Rules for a Random Optimization Method
- An annotated bibliography of GRASP – Part I: Algorithms
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- P-Complete Approximation Problems
- Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search
- The 2-path network problem
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- A GRASP with path-relinking for private virtual circuit routing
- Integer Programming and the Theory of Grouping
- Cluster Analysis and Mathematical Programming
- Experimental evaluation of heuristic optimization algorithms: A tutorial
This page was built for publication: Probabilistic stopping rules for GRASP heuristics and extensions
