Optimization by GRASP

DOI10.1007/978-1-4939-6530-4zbMath1356.90001OpenAlexW2541616316MaRDI QIDQ3186644

Celso Carneiro Ribeiro, Mauricio G. C. Resende

Publication date: 10 August 2016

Full work available at URL: https://doi.org/10.1007/978-1-4939-6530-4

combinatorial optimization metaheuristics local search discrete optimization randomized algorithms greedy algorithms

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

Problems of discrete optimization: challenges and main approaches to solve them ⋮ A biased random-key genetic algorithm for the maximum quasi-clique problem ⋮ 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 ⋮ 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 ⋮ The Capacitated and Economic Districting Problem ⋮ An enhanced GRASP approach for the index tracking problem ⋮ Efficient GRASP solution approach for the prisoner transportation problem ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ An efficient heuristic algorithm for solving connected vertex cover problem ⋮ Extending time‐to‐target plots to multiple instances ⋮ A survey on optimization metaheuristics ⋮ A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic ⋮ 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 ⋮ A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model ⋮ Hybrid algorithms for placement of virtual machines across geo-separated data centers ⋮ Solving the traveling delivery person problem with limited computational time ⋮ A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning