Reactive GRASP with path relinking for channel assignment in mobile phone networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
A GRASP and Path Relinking Heuristic for Rural Road Network Development
Journal of Heuristics
GRASP - evolution for constraint satisfaction problems
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Metaheuristics for optimization problems in computer communications
Computer Communications
A GRASP algorithm to solve the unicost set covering problem
Computers and Operations Research
A reactive GRASP and path relinking for a combined production-distribution problem
Computers and Operations Research
New heuristics for the maximum diversity problem
Journal of Heuristics
Reactive GRASP for the strip-packing problem
Computers and Operations Research
A GRASP approach for the extended car sequencing problem
Journal of Scheduling
A greedy randomized adaptive search procedure for the point-feature cartographic label placement
Computers & Geosciences
A reactive GRASP for a commercial territory design problem with multiple balancing requirements
Computers and Operations Research
A Corridor Method-Based Algorithm for the Pre-marshalling Problem
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems
INFORMS Journal on Computing
A combinatorial algorithm for the TDMA message scheduling problem
Computational Optimization and Applications
Models and heuristic algorithms for a weighted vertex coloring problem
Journal of Heuristics
GRASP and path relinking for the max-min diversity problem
Computers and Operations Research
A parallel hybrid implementation using genetic algorithm, GRASP and reinforcement learning
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
A hybrid heuristic for the diameter constrained minimum spanning tree problem
Journal of Global Optimization
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
A GRASP for a resource-constrained scheduling problem
International Journal of Innovative Computing and Applications
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Computers and Operations Research
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
Automated test case prioritization with reactive GRASP
Advances in Software Engineering - Special issue on software test automation
The open capacitated arc routing problem
Computers and Operations Research
A reactive GRASP with path relinking for capacitated clustering
Journal of Heuristics
On the use of human-guided evolutionary algorithms for tackling 2D packing problems
IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I
Computer Networks: The International Journal of Computer and Telecommunications Networking
A hybrid GRASP with data mining for the maximum diversity problem
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
A comparison of evolutionary approaches to the shortest common supersequence problem
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
A branch and price algorithm for the SS/TDMA problem with cardinality constraint
Computers and Operations Research
Heuristics for the strip packing problem with unloading constraints
Computers and Operations Research
A simulation-based approach for solving the flowshop problem
Proceedings of the Winter Simulation Conference
An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
Computers and Operations Research
A hybrid algorithm for the manufacturing cell formation problem
Journal of Heuristics
A survey on optimization metaheuristics
Information Sciences: an International Journal
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Computers and Operations Research
A GRASP metaheuristic for microarray data analysis
Computers and Operations Research
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
Computers and Operations Research
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
Computers and Operations Research
Power optimization in ad hoc wireless network topology control with biconnectivity requirements
Computers and Operations Research
GRASP with evolutionary path-relinking for the capacitated arc routing problem
Computers and Operations Research
Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic
Journal of Heuristics
A sequential GRASP for the therapist routing and scheduling problem
Journal of Scheduling
Hi-index | 0.01 |
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 procedureReactive 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 newReactive GRASP heuristic matches the optimal solution found by an exact column-generation with branch-and-bound algorithm.