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

DOI10.1016/j.cor.2007.03.001zbMath1133.90424OpenAlexW2122309166MaRDI QIDQ2482382

Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez

Publication date: 16 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.03.001

zbMATH Keywords

heuristicssimulated annealingevaluation functionlinear arrangement

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (22)

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ Combining intensification and diversification strategies in VNS. An application to the vertex separation problem ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ Lower bounds for the bandwidth problem ⋮ New relationships for multi-neighborhood search for the minimum linear arrangement problem ⋮ Multi-objective variable neighborhood search: an application to combinatorial optimization problems ⋮ A New Lower Bound for the Minimum Linear Arrangement of a Graph ⋮ Efficient iterated greedy for the two-dimensional bandwidth minimization problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Swap-vertex based neighborhood for Steiner tree problems ⋮ Lower and upper bounds for the linear arrangement problem on interval graphs ⋮ Comparative analysis of three metaheuristics for short-term open pit block sequencing ⋮ Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs ⋮ Algorithmic expedients for the \(S\)-labeling problem ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ On solving the forward kinematics of 3RPR planar parallel manipulator using hybrid metaheuristics ⋮ Unnamed Item ⋮ A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem ⋮ A note on computational approaches for the antibandwidth problem ⋮ Addressing the envelope reduction of sparse matrices using a genetic programming system ⋮ A general variable neighborhood search for the cyclic antibandwidth problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Optimal linear labelings and eigenvalues of graphs
• A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems
• Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
• The noising method: A new method for combinatorial optimization
• Analysis of finite length annealing schedules
• Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Cooling Schedules for Optimal Annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Optimal Linear Ordering
• Experiments on the minimum linear arrangement problem
• Graph minimum linear arrangement by multilevel weighted edge contractions
• Optimal Assignments of Numbers to Vertices

This page was built for publication: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem