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

@inproceedings{Souza2002AGH,
  title={A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy},
  author={Maur{\'i}cio C. de Souza},
  year={2002}
}
We describe a new neighborhood structure for the capacitated minimum spanning tree problem. This neighborhood structure is used by a local search strategy, leading to good trade-offs between solution quality and computation time. We also propose a GRASP with path-relinking heuristic. It uses a randomized version of a savings heuristic in the construction phase and an extension of the above local search strategy, incorporating some short term memory elements of tabu search. Computational results… CONTINUE READING
Highly Cited
This paper has 67 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

Computers & OR • 2007
View 20 Excerpts
Method Support
Highly Influenced

METAHEURISTIC HYBRIDIZATION WITH GRASP

View 16 Excerpts
Method Support
Highly Influenced

An energy-efficient capacitated minimum spanning tree algorithm for topology control in Wireless Sensor Networks

2017 25th Signal Processing and Communications Applications Conference (SIU) • 2017
View 1 Excerpt

68 Citations

0510'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

AGUNA AND R. MARTÍ, “GRASP and path relinking for 2-layer straight line crossing

M L
1956
View 12 Excerpts
Highly Influenced

PARDALOS, AND G. TORALDO, “GRASP with path-relinking for the three-index assignment problem

R. M. AIEX, P.M.M.G.C. RESENDE
Technical report, AT&T LabsResearch, • 2000

The complexity of the capacitated tree problem

Investigação Operacional, Universidade de Lisboa
P. MARTINS, personnal communication, • 1999

GRASP : An annotated bibliography ”

P. Hansen
Essays and Surveys in Metaheuristics • 1995

RESENDE, “Greedy randomized adaptive search procedures

FEO M.G.C.T.A
Journal of Global • 1995

Problema da árvore de suporte de custo mínimo com restrição de capaci

P. MARTINS
1993

ORLIN, “The theory of cyclic transfers

P. M. THOMPSON ANDJ.B
Working paper OR20089, • 1989