ACM logo

The ACM Journal of Experimental Algorithmics

Volume 8, Article 6, 2003

Experiments on the Minimum Linear Arrangement Problem

by

Jordi Petit

http://www.jea.acm.org/2003/PetitMLAP/

Abstract:

This paper deals with the Minimum Linear Arrangement problem from an experimental point of view. Using a testsuite of sparse graphs, we experimentally compare several algorithms to obtain upper and lower bounds for this problem. The algorithms considered include Successive Augmentation heuristics, Local Search Heuristics and Spectral Sequencing. The testwuite is base on two random models and ``real life'' graphs. As a consequence of this study, two main conclusions can be drawn: On one hand, the best approximations are usually obtained using Simulated Annealing, which involves a large amount of coputation time. Solutions found with Spectral Sequencing are close to the ones found with Simulated Annealing and can be obtained in significantly less time. On the other hand, we notice that there exists a big gap between the best obtained upper bounds and te best obtained lower bounds. These two facts together show that, in practice, finding lower and upper bounds for the Minimum Linear Arrangement problem is hard.

Keywords: Algorithm, Minimum Linear Arrangement Problem, Experimental Analysis.

Categories: G.4 Mathematical Software: Algorithm Design and Analysis