Fast simulated annealing for single-row equidistant facility layout

DOI10.1016/J.AMC.2015.04.073zbMATH Open1410.90119OpenAlexW280719629MaRDI QIDQ1663580FDOQ1663580

Gintaras Palubeckis

Publication date: 21 August 2018

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.04.073

zbMATH Keywords

simulated annealingcombinatorial optimizationquadratic assignmentsingle-row facility layout

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Assignment Problems
• Assignment Problems and the Location of Economic Activities
• A survey for the quadratic assignment problem
• A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• Breakout local search for the quadratic assignment problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Directional decomposition heuristic for a linear machine-cell location problem.
• The single row facility layout problem: state of the art
• A new heuristic for the linear placement problem
• Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
• Provably near-optimal solutions for very large single-row facility layout problems
• A computational study and survey of methods for the single-row facility layout problem
• On the One-Dimensional Space Allocation Problem
• Tabu Search Applied to the Quadratic Assignment Problem
• A branch-and-bound algorithm for the single-row equidistant facility layout problem
• Locating cells with bottleneck machines in cellular manufacturing systems
• Simulated annealing and genetic algorithms for the facility layout problem: A survey
• A cooperative parallel tabu search algorithm for the quadratic assignment problem
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• The corridor allocation problem
• Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Finite-State Processes and Dynamic Programming
• Graph minimum linear arrangement by multilevel weighted edge contractions
• One-dimensional machine location problems in a multi-product flowline with equidistant locations
• Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
• Simulated annealing and tabu search approaches for the Corridor Allocation Problem
• Linear placement algorithms and applications to VLSI design

Cited In (4)

• Decorous combinatorial lower bounds for row layout problems
• Enhanced simulated annealing technique for the single-row routing problem
• Construction heuristics for the single row layout problem with machine-spanning clearances
• Fast local search for single row facility layout

   Recommendations

• A new simulated annealing algorithm for the facility layout problem 👍 👎
• A branch-and-bound algorithm for the single-row equidistant facility layout problem 👍 👎
• Simulated annealing heuristics for the dynamic facility layout problem 👍 👎
• A simulated annealing heuristic for the facility location problem 👍 👎
• Fast local search for single row facility layout 👍 👎
• Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing 👍 👎
• Provably near-optimal solutions for very large single-row facility layout problems 👍 👎
• SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS 👍 👎
• The single row facility layout problem: state of the art 👍 👎

This page was built for publication: Fast simulated annealing for single-row equidistant facility layout

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663580)