A primal-dual interior-point method for facility layout problem with relative-positioning constraints

Research output: Contribution to journalArticlepeer-review

Abstract

We consider the facility layout problem (FLP) in which we find the arrangements of departments with the smallest material handling cost that can be expressed as the product of distance times flows between departments. It is known that FLP can be formulated as a linear programming problem if the relative positioning of departments is specified, and, thus, can be solved to optimality. In this paper, we describe a custom interior-point algorithm for solving FLP with relative positioning constraints (FLPRC) that is much faster than the standard methods used in the general-purpose solver. We build a compact formation of FLPRC and its duals, which enables us to establish the optimal condition very quickly. We use this optimality condition to implement the primal-dual interior-point method with an efficient Newton step computation that exploit special structure of a Hessian. We confirm effectiveness of our proposed model through applications to several well-known benchmark data sets. Our algorithm shows much faster speed for finding the optimal solution.

Original languageEnglish
Article number60
JournalAlgorithms
Volume14
Issue number2
DOIs
Publication statusPublished - 2021 Feb

Keywords

  • Convex optimization
  • Facility layout problem
  • Interior-point method

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Numerical Analysis
  • Computational Theory and Mathematics
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'A primal-dual interior-point method for facility layout problem with relative-positioning constraints'. Together they form a unique fingerprint.

Cite this