Optimization by GRASP. Greedy randomized adaptive search procedures
From MaRDI portal
Recommendations
Cited in
(63)- Using a greedy random adaptative search procedure to solve the cover printing problem
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- An efficient heuristic algorithm for solving connected vertex cover problem
- Greedy randomized adaptive search procedures
- Revenue maximization of Internet of Things provider using variable neighbourhood search
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
- Exact and heuristic algorithms for the weighted total domination problem
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- Optimizing tactical harvest planning for multiple fruit orchards using a metaheuristic modeling approach
- A FPGA-based accelerated architecture for the continuous GRASP
- A survey of scheduling with parallel batch (p-batch) processing
- Solving the traveling delivery person problem with limited computational time
- A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
- Optimizing node infiltrations in complex networks by a local search based heuristic
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- Problems of discrete optimization: challenges and main approaches to solve them
- MineReduce: an approach based on data mining for problem size reduction
- An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization
- The leader multipurpose shopping location problem
- A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem
- Capacitated clustering problems applied to the layout of IT-teams in software factories
- Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
- GRASP: An annoted bibliography
- An annotated bibliography of GRASP – Part I: Algorithms
- Extending time-to-target plots to multiple instances
- A survey on optimization metaheuristics
- The Capacitated and Economic Districting Problem
- Shop scheduling in manufacturing environments: a review
- A no-delay single machine scheduling problem to minimize total weighted early and late work
- A two-phase multi-objective metaheuristic for a green UAV grid routing problem
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
- Graph fragmentation problem: analysis and synthesis
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
- A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
- The two‐echelon routing problem with truck and drones
- A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
- Complexity and heuristics for the weighted max cut‐clique problem
- Optimal decision trees for the algorithm selection problem: integer programming based approaches
- An enhanced GRASP approach for the index tracking problem
- Efficient GRASP solution approach for the prisoner transportation problem
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
- A metaheuristic algorithm for large maximum weight independent set problems
- A random-key GRASP for combinatorial optimization
- Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
- Multiparent path relinking. An application to the power dominating set problem
- First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim
- Heuristics for the weighted total domination problem
- Curse of scale-freeness: intractability of large-scale optimization with multi-start methods
- An open-source framework for solving shop scheduling problems in manufacturing environments
- Solving the medical student scheduling problem using simulated annealing
- A local search algorithm for large maximum weight independent set problems
- Multi-armed bandit for the cyclic minimum sitting arrangement problem
- Two-phase GRASP for the multi-constraint graph partitioning problem
- Solving the yard crane scheduling problem with dynamic assignment of input/output points
- On the restricted Steiner multi cycle problem
- Fifty years of metaheuristics
- Fast heuristics for a staff scheduling problem with time interval demand coverage
- A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization
- Ensemble machine learning-based stopping rule for greedy randomized adaptive search procedure
- An effective greedy randomized adaptive search procedure-based hybrid metaheuristic for the distributed no-wait flowshop scheduling problem
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model
This page was built for publication: Optimization by GRASP. Greedy randomized adaptive search procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186644)
