Graph minimum linear arrangement by multilevel weighted edge contractions

A Refined Evaluation Function for the MinLA Problem

“…The test-suite used in this experiment is composed of the 21 benchmarks 2 proposed in [12] and used later in [10,13,14]. In our preliminary experiments, we observed similar results over the set of 21 benchmark instances.…”

“…To tackle the MinLA problem, a number of heuristic algorithms have been developed. Among these algorithms are a) heuristics especially developed for MinLA, such as the multi-scale algorithm [10] and the algebraic multi-grid scheme [14]; and b) metaheuristics such as Simulated Annealing [12] and Memetic Algorithms [13].…”

“…The resulting algorithm, called MAMP-Φ, was compared with the two best known heuristics: AMG [14] and MAMP [13]. The results obtained by MAMP-Φ are superior to those presented by the previous proposed evolutionary approach [13], and permit to improve on 8 previous best known solutions.…”

“…The results of this experiment are presented in Table 4 and compared with those of the two best known heuristics: AMG [14] and MAMP [13]. In this table, the name of the graph and its number of vertices are displayed in the first two columns.…”

A Comparison of Memetic Recombination Operators for the MinLA Problem

“…Therefore, there is a need for heuristics to address this problem in reasonable time. Among the reported algorithms are a) heuristics especially developed for MinLA, such as the binary balanced decomposition tree heuristic (DT) [1], the multi-scale algorithm (MS) [13] and the algebraic multigrid scheme (AMG) [18]; and b) metaheuristics such as Simulated Annealing [16] and Genetic Algorithms [17].…”