### 抄録

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 |

### Fingerprint

### ASJC Scopus subject areas

- Information Systems and Management
- Management Science and Operations Research
- Statistics, Probability and Uncertainty
- Applied Mathematics
- Modelling and Simulation
- Transportation

### これを引用

*European Journal of Operational Research*,

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

**A neural network approach to facility layout problems.** / Tsuchiya, Kazuhiro; Bharitkar, Sunil; Takefuji, Yoshiyasu.

研究成果: Article

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

}

TY - JOUR

T1 - A neural network approach to facility layout problems

AU - Tsuchiya, Kazuhiro

AU - Bharitkar, Sunil

AU - Takefuji, Yoshiyasu

PY - 1996/3/22

Y1 - 1996/3/22

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

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

KW - Facility layout

KW - Neural networks

KW - Parallel algorithms

KW - Quadratic assignment problem

KW - Two-dimensional maximum neuron model

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

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

U2 - 10.1016/0377-2217(95)00051-8

DO - 10.1016/0377-2217(95)00051-8

M3 - Article

AN - SCOPUS:0030105627

VL - 89

SP - 556

EP - 563

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -