IMDEA Networks Institute Publications Repository

JAM: A Tabu-based Two-Stage Simulated Annealing Algorithm for the Multidimensional Arrangement Problem

Arjona Aroca, Jordi and Fernández Anta, Antonio (2014) JAM: A Tabu-based Two-Stage Simulated Annealing Algorithm for the Multidimensional Arrangement Problem. In: The 9th International Workshop on Hybrid Metaheuristics (HM 2014), 11-13 June 2014, Hamburg, Germany.

[img]
Preview
PDF (JAM, A Tabu-Based Two-Stage Simulated Annealing Algorithm for the Multidimensional Arrangement Problem) - Published Version
Download (136Kb) | Preview

Abstract

In this paper we study a version of the Multidimensional Arrangement Problem (MAP) that embeds a graph into a multidimensional array minimizing the aggregated (Manhattan) distance of the embedded edges. This problem includes the minimum Linear Arrangement Problem (minLA) as a special case, among others. We propose JAM, a tabu-based two-stage simulated annealing heuristic for this problem. Our algorithm relies on existing techniques for the minimum linear arrangement (minLA) problem, which are non-trivially adapted to work in multiple dimensions. Due to the scarcity of specific benchmarks for MAP, we have tested the performance of our algorithm with benchmarks for the minLA and Quadratic Assignment Problems (with more than 80 graphs). For each graph in these benchmarks, we provide results for 1, 2 and 3-dimensional instances of MAP, enlarging, hence, the benchmarking resources for the research community. The results obtained show the practicality of JAM, often matching the best known result and even improving some of them.

Item Type: Conference or Workshop Papers (Paper)
Uncontrolled Keywords: Multidimensional Arrangement Problem, Minimum Linear Arrangement Problem, Quadratic Assignment Problem, Simulated Annealing, Tabu Search.
Subjects: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Jordi Arjona
Date Deposited: 25 Jun 2014 11:15
Last Modified: 30 Nov 2016 11:41
URI: http://eprints.networks.imdea.org/id/eprint/846

Actions (login required)

View Item View Item