An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Rodríguez-Tello, Eduardo; Hao, Jin‐Kao; Torres-Jiménez, José

doi:10.1016/j.cor.2007.03.001

Cited by 66 publications

(31 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…using problem-specific knowledge, could improve the results for other hard combinatorial optimisation problems, as already demonstrated for certain cases [Rodriguez-Tello et al, 2008a;Rodriguez-Tello et al, 2008b].…”

Section: Chapter Conclusionmentioning

confidence: 93%

Heuristic algorithms and learning techniques: applications to the graph coloring problem

Porumbel¹

2011

4OR-Q J Oper Res

View full text Add to dashboard Cite

show abstract

Section: Chapter Conclusionmentioning

confidence: 93%

Heuristic algorithms and learning techniques: applications to the graph coloring problem

Porumbel¹

2011

4OR-Q J Oper Res

View full text Add to dashboard Cite

show abstract

“…In Table 5 we report the following for each instance: the name, the number of nodes and edges, the best known upper bound (taken from Rodriguez-Tello et al [25]), the best known combinatorial lower bound (from Petit [22]), the lower bound from the cutting-plane algorithm of Caprara et al [8], the lower bound from our cutting-plane algorithm, the number of iterations, and the total time in hours.…”

Section: Experiments With Large Instancesmentioning

confidence: 99%

A polyhedral approach to the single row facility layout problem

Amaral

Letchford

2012

Math. Program.

View full text Add to dashboard Cite

The Single Row Facility Layout Problem (SRFLP) is the -hard problem of arranging facilities on a line, while minimizing a weighted sum of the distances between facility pairs. In this paper, a detailed polyhedral study of the SRFLP is performed, and several huge classes of valid and facet-inducing inequalities are derived. Some separation heuristics are presented, along with a primal heuristic based on multidimensional scaling. Finally, a branch-and-cut algorithm is described and some encouraging computational results are given.

show abstract

“…Global optima are defined as being the absolute maxima (or minima) in the whole of S. Other features of a landscape such as basins, barriers, or neutrality can be defined likewise (Stadler, 2002). Neutrality is a particularly important notion in real-world problems such as flow-shop scheduling problem (Marmion et al, 2011b), minimum linear arrangement (Rodriguez-Tello et al, 2008), etc.…”

Section: Definitionmentioning

confidence: 99%

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms

et al. 2013

View full text Add to dashboard Cite

Abstract:This document presents a general-purpose software framework dedicated to the design, the analysis and the implementation of local search algorithms: ParadisEO-MO. A substantial number of single-solution based local search metaheuristics has been proposed so far, and an attempt of unifying existing approaches is here presented. Based on a fine-grained decomposition, a conceptual model is proposed and is validated by regarding a number of state-of-the-art methodologies as simple variants of the same structure. This model is then incorporated into the ParadisEO-MO software framework. This framework has proven its efficiency and high flexibility by enabling the resolution of many academic and real-world optimization problems from science and industry.

show abstract

An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

Cited by 66 publications

References 25 publications

Heuristic algorithms and learning techniques: applications to the graph coloring problem

Heuristic algorithms and learning techniques: applications to the graph coloring problem

A polyhedral approach to the single row facility layout problem

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms

Contact Info

Product

Resources

About