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

Authors:
Mauricio C. de Souza;Christophe Duhamel;Celso C. Ribeiro
Affiliations:
LIMOS, Université Blaise Pascal, BP 125, 63173 Aubière Cedex, France;LIMOS, Université Blaise Pascal, BP 125, 63173 Aubière Cedex, France;Department of Computer Science, Catholic University of Rio de Janeiro, Rio de Janeiro, 22453-900, Brazil
Venue:
Metaheuristics
Year:
2004

Citing 5
Cited 9

Cyclic transfer algorithms for multivehicle routing and scheduling problems

Operations Research
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

Journal of the ACM (JACM)
Tabu Search

Tabu Search
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

INFORMS Journal on Computing

Path relinking for the vehicle routing problem

Journal of Heuristics
Savings based ant colony optimization for the capacitated minimum spanning tree problem

Computers and Operations Research
Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

Computers and Operations Research
Metaheuristics for optimization problems in computer communications

Computer Communications
Efficient parallel cooperative implementations of GRASP heuristics

Parallel Computing
Design of capacitated minimum spanning tree with uncertain cost and demand parameters

Information Sciences: an International Journal
GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem

Journal of Heuristics
Savings based ant colony optimization for the capacitated minimum spanning tree problem

Computers and Operations Research
Leveraging saving-based algorithms by master-slave genetic algorithms

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 on benchmark problems illustrate the effectiveness of this approach, which is competitive with the best heuristics in the literature in terms of solution quality. The GRASP heuristic using a memory-based local search strategy improved the best known solution for some of the largest benchmark problem.