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

Shunichi Ohmori*, Kazuho Yoshimoto

*この研究の対応する著者

研究成果: Article査読

抄録

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.

本文言語English
論文番号60
ジャーナルAlgorithms
14
2
DOI
出版ステータスPublished - 2021 2

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 数値解析
  • 計算理論と計算数学
  • 計算数学

フィンガープリント

「A primal-dual interior-point method for facility layout problem with relative-positioning constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル