A Force-directed Heuristics for the Facility Layout Problem

DOI Web Site 17 References

Bibliographic Information

Other Title
  • 力学的モデルを用いた施設レイアウト問題の解法
  • 力学的モデルを用いた施設レイアウト問題の解法 : カオス力学的モデルを用いた相対位置関係の探索
  • リキガクテキ モデル オ モチイタ シセツ レイアウト モンダイ ノ カイホウ : カオス リキガクテキ モデル オ モチイタ ソウタイ イチ カンケイ ノ タンサク
  • —Relative Location Search using the Chaos Force-directed Model—
  • —カオス力学的モデルを用いた相対位置関係の探索—

Search this article

Abstract

In this paper, we present a new heuristics for the facility layout problem (FLP). It is known that the FLP can be solved to optimality via mixed integer programming (MIP). The largest problem that has been solved to optimality to date, however, contains only eleven departments, and thus, is not applicable to typical problems where there are many more departments. In this paper, we developed a new force-directed model that enables us to develop good relative locations of departments very quickly by exploiting the special structure of the problem. We used the chaos characteristics of the force-directed model used in the algorithm so that they do not become stuck as a result of the local optima. We use this relative position to formulate the FLP as linear programming. In the computational experiments, we tested our proposed method against several well-known benchmark data sets. Our algorithm shows better or equal cost performance in most of them, and also finishes the computations much faster.

Journal

References(17)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top