A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem

  • Authors:

  • Ibrahim H. Osman

  • Affiliations:

  • Suliman S. Olayan School of Business, American University of Beirut, Beirut, Lebanon

  • Venue:
  • Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

An efficient and effective tabu search implementation for the weighted maximal planar graph problem is proposed. The search incorporates a number of novel features including: the introduction of a new set of two-move operators; a move-cache-memory structure for efficiently searching the neighbourhood space; and a random roulette selection from a ranked list of best moves for diversification. The effects of these and other features on solution quality are investigated. Computational results are reported on a set of 100 benchmark instances of sizes varying from 20 to 100 vertices. The results demonstrate that the new probabilistic tabu search algorithm is very competitive with state of the art algorithms in the literature in terms of both solution quality and computational effort.