Greedy randomized adaptive search procedures
From MaRDI portal
Publication:1804580
DOI10.1007/BF01096763zbMATH Open0822.90110OpenAlexW2997776631MaRDI QIDQ1804580FDOQ1804580
Authors: Thomas A. Feo, Mauricio G. C. Resende 
Publication date: 15 May 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01096763
Recommendations
- scientific article; zbMATH DE number 2050708
- Greedy randomized adaptive search procedures
- Parallel Greedy Randomized Adaptive Search Procedures
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Greedy algorithms for adaptive approximation
- scientific article; zbMATH DE number 4029304
- Adaptive stochastic search
- Adaptive greedy approximations
- Adaptive approximations by greedy algorithms
- Greedy search of optimal approximate solutions
heuristiccomputer implementationgreedy randomized adaptive search proceduresiterative randomized sampling technique
Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- QAPLIB-A quadratic assignment problem library
- Title not available (Why is that?)
- An Efficient Heuristic Procedure for Partitioning Graphs
- Title not available (Why is that?)
- Tabu Search—Part I
- Computational results of an interior point algorithm for large scale linear programming
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Title not available (Why is that?)
- A probabilistic heuristic for a computationally difficult set covering problem
- Tabu Search—Part II
- Title not available (Why is that?)
- An exact algorithm for the maximum clique problem
- A GRASP for a difficult single machine scheduling problem
- The Intermodal Trailer Assignment Problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- The Fixed Job Schedule Problem with Spread-Time Constraints
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Title not available (Why is that?)
- Title not available (Why is that?)
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- Note—Operations Sequencing in Discrete Parts Manufacturing
- Title not available (Why is that?)
- Facility-Wide Planning and Scheduling of Printed Wiring Board Assembly
Cited In (only showing first 100 items - show all)
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- A scatter search approach for the minimum sum-of-squares clustering problem
- Hybridization of GRASP metaheuristic with data mining techniques
- A GRASP for parallel machine scheduling with time windows
- A biased random-key genetic algorithm for data clustering
- On some optimization problems in molecular biology
- An annotated bibliography of GRASP – Part I: Algorithms
- Applications of the DM‐GRASP heuristic: a survey
- A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- Randomized heuristics for the Max-Cut problem
- Network repair crew scheduling and routing for emergency relief distribution problem
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- Integer programming models for feature selection: new extensions and a randomized solution algorithm
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- Heuristics for the generalized median graph problem
- Enhanced controlled tabular adjustment
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Load-dependent and precedence-based models for pickup and delivery problems
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem
- Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
- A GRASP metaheuristic for microarray data analysis
- A hybrid data mining GRASP with path-relinking
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints
- A heuristic algorithm for a supply chain's production-distribution planning
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
- Scatter search for an uncapacitated \(p\)-hub median problem
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- Multi-neighborhood local search optimization for machine reassignment problem
- Revised GRASP with path-relinking for the linear ordering problem
- Title not available (Why is that?)
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- Tabu search and GRASP for the maximum diversity problem
- The single period coverage facility location problem: Lagrangean heuristic and column generation approaches
- A nonmonotone GRASP
- A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems
- Logic classification and feature selection for biomedical data
- The GLOBAL optimization method revisited
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
- Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows
- A hybrid heuristic algorithm for the open-pit-mining operational planning 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
- Incremental bipartite drawing problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Inventory routing with continuous moves
- Optimizing base station location and configuration in UMTS networks
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
- A mathematical program to refine gene regulatory networks
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- A quality and distance guided hybrid algorithm for the vertex separator problem
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- A GRASP for the biquadratic assignment problem
- Scatter search for the cutwidth minimization problem
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- Hybrid metaheuristics: an introduction
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Minimizing latency in post-disaster road clearance operations
- Efficient solutions for the far from most string problem
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- A variable neighborhood search approach for the vertex bisection problem
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- A survey of recent research on location-routing problems
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- The production routing problem: a review of formulations and solution algorithms
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands
- Title not available (Why is that?)
- The \(p\)-median problem: a survey of metaheuristic approaches
- Scatter search for the single source capacitated facility location problem
- A hybrid evolution strategy for the open vehicle routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A benchmark library and a comparison of heuristic methods for the linear ordering problem
- Variable neighborhood search: Principles and applications
- A review of recent advances in global optimization
- A fast algorithm for robust regression with penalised trimmed squares
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- GRASP for set packing problems.
- Improved solutions to the Steiner triple covering problem
- A survey for the quadratic assignment problem
- Heuristics for the mirrored traveling tournament problem
- A crane scheduling method for port container terminals
- Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers
- A three-phased local search approach for the clique partitioning problem
- Local search for the undirected capacitated arc routing problem with profits
Uses Software
This page was built for publication: Greedy randomized adaptive search procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804580)
