### 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.

Original language | English |
---|---|

Pages (from-to) | 145-156 |

Number of pages | 12 |

Journal | Journal of Japan Industrial Management Association |

Volume | 64 |

Issue number | 2 |

Publication status | Published - 2013 |

### Fingerprint

### Keywords

- Facility layout problem
- Metaheuristics

### ASJC Scopus subject areas

- Industrial and Manufacturing Engineering
- Applied Mathematics
- Management Science and Operations Research
- Strategy and Management

### Cite this

**A force-directed heuristics for the facility layout problem : Relative location search using the chaos force-directed model.** / Ohmori, Shunichi; Yoshimoto, Kazuho.

Research output: Contribution to journal › Article

*Journal of Japan Industrial Management Association*, vol. 64, no. 2, pp. 145-156.

}

TY - JOUR

T1 - A force-directed heuristics for the facility layout problem

T2 - Relative location search using the chaos force-directed model

AU - Ohmori, Shunichi

AU - Yoshimoto, Kazuho

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Facility layout problem

KW - Metaheuristics

UR - http://www.scopus.com/inward/record.url?scp=84923261176&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84923261176&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:84923261176

VL - 64

SP - 145

EP - 156

JO - Journal of Japan Industrial Management Association

JF - Journal of Japan Industrial Management Association

SN - 0386-4812

IS - 2

ER -