Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- 1 August 2000
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 12 (3), 164-176
- https://doi.org/10.1287/ijoc.12.3.164.12639
Abstract
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. In this paper, we describe a GRASP for a matrix decomposition problem arising in the context of traffic assignment in communication satellites. We review basic concepts of GRASP: construction and local search algorithms. The local search phase is based on the use of a new type of neighborhood defined by constructive and destructive moves. The implementation of a GRASP for the matrix decomposition problem is described in detail. Extensive computational experiments on literature and randomly generated problems are reported. Moreover, we propose a new procedure Reactive GRASP, in which the basic parameter that defines the restrictiveness of the candidate list during the construction phase is self-adjusted according to the quality of the solutions previously found. The approach is robust and does not require calibration efforts. On most of the literature problems considered, the new Reactive GRASP heuristic matches the optimal solution found by an exact column-generation with branch-and-bound algorithm.Keywords
This publication has 12 references indexed in Scilit:
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995
- Efficient algorithms for SS/TDMA schedulingIEEE Transactions on Communications, 1992
- A note on efficient SS/TDMA assignment algorithmsIEEE Transactions on Communications, 1988
- Minimizing the Number of Switchings in an SS/TDMA SystemIEEE Transactions on Communications, 1985
- On the complexity of decomposing matrices arising in satellite communicationOperations Research Letters, 1985
- Traffic assignment in communication satellitesOperations Research Letters, 1983
- An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of TranspondersIEEE Transactions on Communications, 1981
- An Efficient SS/TDMA Time Slot Assignment AlgorithmIEEE Transactions on Communications, 1979
- Comments on "Analysis of a switch matrix for an SS/TDMA system"Proceedings of the IEEE, 1978
- Analysis of a switch matrix for an SS/TDMA systemProceedings of the IEEE, 1977