On a new modelling approach for circular layouts and its practical advantages

We consider a new facility layout problem. The Directed Circular Facility Layout Problem (DCFLP) seeks to optimally arrange machines on a circular layout with given material flow direction. The DCFLP allows for a wide range of applications and contains several other relevant layout problems as special cases. We model the DCFLP as a Linear Ordering Problem and solve it using an Integer Linear Program and a Tabu Search heuristic. In our computational study we show that the DCFLP is easier to solve for both exact and heuristic approaches than other related layout problems.

• Publication year

  2017

• Venue

  IEEE International Conference on Industrial Engineering and Engineering Management

• Publication date

  2017-10-06

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/IEEM.2017.8290159
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Variable Neighborhood Search

  2018cited by this paper
• Semidefinite relaxations of ordering problems

  2013cited by this paper
• A Semidefinite Optimization Approach to the Directed Circular Facility Layout Problem

  2013influential reference
• Exact Approaches to Multilevel Vertical Orderings

  2013cited by this paper
• An Exact Approach for the Combined Cell Layout Problem

  2012influential reference
• Handbook on Semidefinite, Conic and Polynomial Optimization

  2012cited by this paper
• A computational study and survey of methods for the single-row facility layout problem

  2012cited by this paper
• A benchmark library and a comparison of heuristic methods for the linear ordering problem

  2011cited by this paper
• Single row facility layout problem using a permutation-based genetic algorithm

  2011cited by this paper
• The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization

  2011cited by this paper
• An SDP approach to multi-level crossing minimization

  2011cited by this paper
• Exact Algorithms for the Quadratic Linear Ordering Problem

  2010cited by this paper
• Contributions to the Minimum Linear Arrangement Problem

  2010cited by this paper
• A new lower bound for the single row facility layout problem

  2009cited by this paper
• Greedy Randomized Adaptive Search Procedures

  2009cited by this paper
• Provably near-optimal solutions for very large single-row facility layout problems

  2009cited by this paper
• An Exact Approach to the One-Dimensional Facility Layout Problem

  2008cited by this paper
• Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes

  2008cited by this paper
• A survey for the quadratic assignment problem

  2007cited by this paper
• Variable neighborhood search for the linear ordering problem

  2006cited by this paper
• On the exact solution of a facility layout problem

  2006cited by this paper
• Meta-heuristics from nature for the loop layout design problem

  2006cited by this paper
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions

  2005cited by this paper
• Laying Out Sparse Graphs with Provably Minimum Bandwidth

  2005cited by this paper
• Design of unidirectional cyclic layouts

  2005influential reference
• The Linear Ordering Problem: Instances, Search Space Analysis and Algorithms

  2004cited by this paper
• Unidirectional loop network layout by a LP heuristic and design of telecommunications networks

  2004cited by this paper
• The directed circular arrangement problem

  2004cited by this paper
• Pushing Dependent Data in Clients–Providers–Servers Systems

  2003cited by this paper
• Circular Arrangements

  2002cited by this paper
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs

  2002cited by this paper
• A survey of graph layout problems

  2002cited by this paper
• An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

  2001cited by this paper
• Solving Linear Ordering Problems with a Combined Interior Point/Simplex Cutting Plane Algorithm

  2000cited by this paper
• Handbook of Semidefinite Programming

  2000cited by this paper
• Intensification and diversification with elite tabu search solutions for the linear ordering problem

  1999cited by this paper
• Fixing Variables in Semidefinite Relaxations

  1997cited by this paper
• Genetic Algorithms + Data Structures = Evolution Programs

  1996cited by this paper
• The facility layout problem: Recent and emerging trends and perspectives

  1996cited by this paper
• An Interior-Point Method for Semidefinite Programming

  1996cited by this paper
• A new heuristic algorithm solving the linear ordering problem

  1996cited by this paper
• On genetic algorithms

  1995cited by this paper
• Machine layout problem in modern manufacturing facilities

  1994cited by this paper
• Polyhedral structure and properties of a model for layout design

  1994cited by this paper
• Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems

  1992cited by this paper
• A survey of layout issues in flexible manufacturing systems

  1992cited by this paper
• Cones of Matrices and Set-Functions and 0-1 Optimization

  1991cited by this paper
• A loop layout design problem for flexible manufacturing systems

  1989cited by this paper
• Exact solution procedures for the circular layout problem

  1989cited by this paper
• Machine Layout Problem in Flexible Manufacturing Systems

  1988cited by this paper
• Future paths for integer programming and links to artificial intelligence

  1986cited by this paper
• A Cutting Plane Algorithm for the Linear Ordering Problem

  1984cited by this paper
• A branch and bound algorithm for the acyclic subgraph problem

  1981cited by this paper
• HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS

  1977cited by this paper
• An efficient heuristic procedure for partitioning graphs

  1970cited by this paper
• La hiérarchie des industries dans un tableau des échanges interindustriels

  1960cited by this paper
• International Comparisons of the Structure of Production

  1958cited by this paper

• Exact approaches for the combined cell layout problem

  2022cites this paper
• New exact approaches for the combined cell layout problem and extensions of the multi-bay facility layout problem

  2020cites this paper
• Exact and heuristic approaches for a new circular layout problem

  2020cites this paper
• An Integer Linear Programming Approach for the Combined Cell Layout Problem

  2018cites this paper
• Model development of rescue assignment and scheduling problem using grasp metaheuristic

  2017cites this paper