Experimental analysis of simulated annealing based algorithms for the layout problem
From MaRDI portal
Publication:1197688
DOI10.1016/0377-2217(92)90042-8zbMath0825.90454OpenAlexW2025427163MaRDI QIDQ1197688
Sunderesh S. Heragu, Attahiru Sule Alfa
Publication date: 16 January 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(92)90042-8
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Production models (90B30) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (51)
Construction heuristics for the single row layout problem with machine-spanning clearances ⋮ A Monte Carlo simulation based heuristic procedure for solving dynamic line layout problems for facilities using conventional material handling devices ⋮ Large-scale layout of facilities using a heuristic hybrid algorithm ⋮ Simulated annealing heuristics for managing resources during planned outages at electric power plants ⋮ An ant algorithm for the single row layout problem in flexible manufacturing systems ⋮ Fast local search for single row facility layout ⋮ Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem ⋮ Layout design for flexible manufacturing systems considering single-loop directional flow patterns ⋮ Solving the bi-objective corridor allocation problem using a permutation-based genetic algorithm ⋮ Insertion based Lin-Kernighan heuristic for single row facility layout ⋮ A modification of threshold accepting and its application to the quadratic assignment problem ⋮ A computational study and survey of methods for the single-row facility layout problem ⋮ Fast simulated annealing for single-row equidistant facility layout ⋮ Location and layout planning. A survey ⋮ Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models ⋮ Metaheuristics: A bibliography ⋮ Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty ⋮ Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Two-level modified simulated annealing based approach for solving facility layout problem ⋮ Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities ⋮ Optimal solutions for the double row layout problem ⋮ Hope: A genetic algorithm for the unequal area facility layout problem. ⋮ The single row facility layout problem: state of the art ⋮ Unnamed Item ⋮ An efficient genetic algorithm for single row facility layout ⋮ Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm ⋮ The Constrained Single-Row Facility Layout Problem with Repairing Mechanisms ⋮ Simulated annealing algorithm for solving the single machine early/tardy problem ⋮ A GRASP algorithm for solving large-scale single row facility layout problems ⋮ Recent models and techniques for solving the layout problem ⋮ Machine layout problem in modern manufacturing facilities ⋮ Single row facility layout problem using a permutation-based genetic algorithm ⋮ Optimization of cube-per-order index warehouse layouts with zoning constraints ⋮ Simulated annealing heuristics for the dynamic facility layout problem ⋮ An efficient tabu algorithm for the single row facility layout problem ⋮ On the exact solution of a facility layout problem ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ A new lower bound for the single row facility layout problem ⋮ Layout designs in cellular manufacturing ⋮ Probabilistic local search algorithms for concave cost transportation network problems ⋮ Solving the failure-to-fit problem for plant layout: By changing department shapes and sizes ⋮ A neural network approach to facility layout problems ⋮ Hybrid ant systems for the dynamic facility layout problem ⋮ A semidefinite optimization approach for the single-row layout problem with unequal dimensions ⋮ Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry ⋮ A practical method for design of hybrid-type production facilities ⋮ A new simulated annealing algorithm for the facility layout problem ⋮ An improved tabu search heuristic for solving facility layout design problems ⋮ A simulated annealing algorithm based on a closed loop layout for facility layout design in flexible manufacturing systems ⋮ Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
Cites Work
- Unnamed Item
- Quadratic assignment problems
- An improved annealing scheme for the QAP
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Efficient models for the facility layout problem
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- The facility layout problem
- Assignment Problems and the Location of Economic Activities
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Using simulated annealing to solve routing and location problems
- Simulated Annealing – An Annotated Bibliography
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu Search Applied to the Quadratic Assignment Problem
- Equation of State Calculations by Fast Computing Machines
- One-Dimensional Space Allocation: An Ordering Algorithm
This page was built for publication: Experimental analysis of simulated annealing based algorithms for the layout problem