Heuristics for the MinLA problem: some theoretical and empirical considerations
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/96970
Tipus de documentReport de recerca
Data publicació1998-03
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
This paper deals with some aspects on finding good solutions
for the Minimum Linear Arrangement problem (MinLA). We consider some
random type of sparse graphs, for which it is possible to obtain
trivial constant approximations. For similar graphs, we prove that
Metropolis can find good solutions, whereas we exhibit an instance for
which Hill Climbing is expected to need an exponential number of steps
to hit an optimum. Motivated by the last results, we present an
heuristic (SS+SA) to approximate the MinLA problem on sparse
graphs. The heuristic consists in using Spectral Sequencing to obtain
a first primal solution and after improving it locally through
(Parallel) Simulated Annealing. In the last part of the paper, we
report experimental results obtained with the SS+SA heuristic when
applied to a set of large sparse geometric graphs. Compared to other
heuristics, the measurements obtained on an IBM SP2 computer with 8
processors show that the new heuristic improves the solution quality,
decreases the running time and offers an excellent speedup when ran in parallel.
CitacióDiaz, J., Petit, J., Spirakis, P.G., Serna, M. "Heuristics for the MinLA problem: some theoretical and empirical considerations". 1998.
Forma partLSI-98-15-R
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1400261383.pdf | 1,337Mb | Visualitza/Obre |