### 抜粋

A near-optimum parallel algorithm for solving facility layout problems is presented in this paper where the problem is NP-complete. The facility layout problem is one of the most fundamental quadratic assignment problems in Operations Research. The goal of the problem is to locate N facilities on an N-square (location) array so as to minimize the total cost. The proposed system is composed of N x N neurons based on an artificial two-dimensional maximum neural network for an N-facility layout problem. Our algorithm has given improved solutions for several benchmark problems over the best existing algorithms.

元の言語 | English |
---|---|

ページ（範囲） | 556-563 |

ページ数 | 8 |

ジャーナル | European Journal of Operational Research |

巻 | 89 |

発行部数 | 3 |

DOI | |

出版物ステータス | Published - 1996 3 22 |

### ASJC Scopus subject areas

- Computer Science(all)
- Modelling and Simulation
- Management Science and Operations Research
- Information Systems and Management

## フィンガープリント A neural network approach to facility layout problems' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

Tsuchiya, K., Bharitkar, S., & Takefuji, Y. (1996). A neural network approach to facility layout problems.

*European Journal of Operational Research*,*89*(3), 556-563. https://doi.org/10.1016/0377-2217(95)00051-8