Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

DOI10.1287/ijoc.12.3.164.12639zbMath1040.90504OpenAlexW1977846845MaRDI QIDQ4427329

Marcelo Prais, Celso Carneiro Ribeiro

Publication date: 28 October 2003

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/800029086a84b4daffa3c84ad1d48cb318b819cf

zbMATH Keywords

combinatorial optimizationmetaheuristicgreedy randomized adaptive search procedure

Mathematics Subject Classification ID

Related Items (56)

A GRASP approach for the extended car sequencing problem ⋮ A combinatorial algorithm for the TDMA message scheduling problem ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ Local search-based hybrid algorithms for finding Golomb rulers ⋮ Finding minimum and equitable risk routes for hazmat shipments ⋮ A tabu search approach for scheduling hazmat shipments ⋮ A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems ⋮ A GRASP metaheuristic for microarray data analysis ⋮ A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering ⋮ Power optimization in ad hoc wireless network topology control with biconnectivity requirements ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem ⋮ Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking ⋮ On Monte Carlo tree search for weighted vertex coloring ⋮ Iterated local search with tabu search for the weighted vertex coloring problem ⋮ A GRASP algorithm to solve the unicost set covering problem ⋮ A reactive GRASP and path relinking for a combined production-distribution problem ⋮ A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ The leader multipurpose shopping location problem ⋮ A variable neighborhood search algorithm for the multimode set covering problem ⋮ Hybrid Metaheuristics: An Introduction ⋮ A sequential GRASP for the therapist routing and scheduling problem ⋮ Heuristic and metaheuristic methods for the multi‐skill project scheduling problem with partial preemption ⋮ Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ Heuristic and exact algorithms for a min-max selective vehicle routing problem ⋮ Metaheuristics: A Canadian Perspective ⋮ Monte Carlo tree search with adaptive simulation: a case study on weighted vertex coloring ⋮ Adaptive feasible and infeasible tabu search for weighted vertex coloring ⋮ Bayesian stopping rules for greedy randomized procedures ⋮ Exact weighted vertex coloring via branch-and-price ⋮ GRASP for set packing problems. ⋮ Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP ⋮ Transit Pattern Detection Using Tensor Factorization ⋮ Applications of the DM‐GRASP heuristic: a survey ⋮ A GRASP heuristic for slab scheduling at continuous casters ⋮ Reactive GRASP for the strip-packing problem ⋮ A survey on optimization metaheuristics ⋮ Improved state space relaxation for constrained two-dimensional guillotine cutting problems ⋮ A reactive GRASP for a commercial territory design problem with multiple balancing requirements ⋮ Solving a bus driver scheduling problem with randomized multistart heuristics ⋮ A reactive GRASP with path relinking for capacitated clustering ⋮ A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM ⋮ A capacitated facility location problem with constrained backlogging probabilities ⋮ A hybrid heuristic for the diameter constrained minimum spanning tree problem ⋮ The open capacitated arc routing problem ⋮ Iterated greedy for the maximum diversity problem ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits ⋮ Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs ⋮ Randomized heuristics for the family traveling salesperson problem ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ GRASP and path relinking for the max-min diversity problem ⋮ Models and heuristic algorithms for a weighted vertex coloring problem ⋮ Metaheuristics—the metaphor exposed ⋮ A GRASP and path relinking heuristic for rural road network development ⋮ Metaheuristics in combinatorial optimization

This page was built for publication: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment