Speeding up continuous GRASP
From MaRDI portal
Publication:976348
DOI10.1016/j.ejor.2010.02.009zbMath1189.90055MaRDI QIDQ976348
Panos M. Pardalos, Mauricio G. C. Resende, Michael J. Hirsch
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.009
global optimization; GRASP; nonlinear programming; heuristic; stochastic algorithm; stochastic local search; continuous optimization; multimodal functions; continuous GRASP
90C15: Stochastic programming
90C59: Approximation methods and heuristics in mathematical programming
90B30: Production models
Related Items
Correspondence of projected 3-D points and lines using a continuous GRASP, A stochastic local search algorithm for constrained continuous global optimization, Annealing evolutionary stochastic approximation Monte Carlo for global optimization, Annealing evolutionary stochastic approximation Monte Carlo for global optimization, Multi-depot vessel routing problem in a direction dependent wavefield, Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm, Continuous GRASP with a local active-set method for bound-constrained global optimization, A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization, A simulated annealing driven multi-start algorithm for bound constrained global optimization, The GLOBAL optimization method revisited, A Python/C library for bound-constrained global optimization with continuous GRASP, A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm, One side cut accelerated random search
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving systems of nonlinear equations with continuous GRASP
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- Global optimization by continuous grasp
- Tabu search directed by direct search methods for nonlinear global optimization
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Stopping Rules for a Random Optimization Method
- Mersenne twister
- Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search
- Enhanced simulated annealing for globally minimizing functions of many-continuous variables
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- Minimizing multimodal functions by simplex coding genetic algorithm
