A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

Authors:
Celso C. Ribeiro;Eduardo Uchoa;Renato F. Werneck
Affiliations:
-;-;-
Venue:
INFORMS Journal on Computing
Year:
2002

Citing 0
Cited 36

A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
A Hybrid Heuristic for the p-Median Problem

Journal of Heuristics
New benchmark instances for the Steiner problem in graphs

Metaheuristics
A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy

Metaheuristics
A GRASP and Path Relinking Heuristic for Rural Road Network Development

Journal of Heuristics
Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Worst-case performance of Wong's Steiner tree heuristic

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
GRASP with path relinking for the weighted MAXSAT problem

Journal of Experimental Algorithmics (JEA)
Metaheuristics for optimization problems in computer communications

Computer Communications
Efficient parallel cooperative implementations of GRASP heuristics

Parallel Computing
New heuristics for the maximum diversity problem

Journal of Heuristics
Hybrid Heuristics for Multi-mode Resource-Constrained Project Scheduling

Learning and Intelligent Optimization
An Ant Algorithm for the Steiner Tree Problem in Graphs

Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
GRASP and path relinking for the max-min diversity problem

Computers and Operations Research
Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Worst-case performance of Wong's Steiner tree heuristic

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Benchmarking a wide spectrum of metaheuristic techniques for the radio network design problem

IEEE Transactions on Evolutionary Computation
Black box scatter search for general classes of binary optimization problems

Computers and Operations Research
Heuristics for the bandwidth colouring problem

International Journal of Metaheuristics
A GRASP-based network re-optimization strategy for improving RWA in multi-constrained optical transport infrastructures

Computer Communications
Adaptive memory in multistart heuristics for multicommodity network design

Journal of Heuristics
A hybrid evolutionary metaheuristics (HEMH) applied on 0/1 multiobjective knapsack problems

Proceedings of the 13th annual conference on Genetic and evolutionary computation
GRASP with path-relinking for data clustering: a case study for biological data

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
GRASP with path-relinking for the generalized quadratic assignment problem

Journal of Heuristics
GRASP with path-relinking for the weighted maximum satisfiability problem

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
GRASP with path-relinking for the maximum diversity problem

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Fast local search for the steiner problem in graphs

Journal of Experimental Algorithmics (JEA)
A benchmark library and a comparison of heuristic methods for the linear ordering problem

Computational Optimization and Applications
Path-relinking intensification methods for stochastic local search algorithms

Journal of Heuristics
The minimum cost perfect matching problem with conflict pair constraints

Computers and Operations Research
HEMH2: an improved hybrid evolutionary metaheuristics for 0/1 multiobjective knapsack problems

SEAL'12 Proceedings of the 9th international conference on Simulated Evolution and Learning
Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary Inversions

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Heuristics and metaheuristics for the maximum diversity problem

Journal of Heuristics
A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

Computers and Operations Research
Power optimization in ad hoc wireless network topology control with biconnectivity requirements

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose and describe a hybrid GRASP with weight perturbations and adaptive path-relinking heuristic (HGP + PR) for the Steiner problem in graphs. In this multi-start approach, the greedy randomized construction phase of a GRASP is replaced by the use of several construction heuristics with a weight perturbation strategy that combines intensification and diversification elements, as in a strategic oscillation approach. The improvement phase circularly explores two different local search strategies. The first uses anode-based neighborhood for local search, while the second uses a key-path-based neighborhood. An adaptive path-relinking technique is applied to a set of elite solutions as apost-optimization strategy. Computational results on a broad set of benchmark problems illustrate the effectiveness and the robustness of our heuristic, which is very competitive when compared to other approximate algorithms.