A neural network approach to facility layout problems

Kazuhiro Tsuchiya; Sunil Bharitkar; Yoshiyasu Takefuji

doi:10.1016/0377-2217(95)00051-8

A neural network approach to facility layout problems

Kazuhiro Tsuchiya, Sunil Bharitkar, Yoshiyasu Takefuji

Faculty of Environment and Information Studies

Research output: Contribution to journal › Article › peer-review

37 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	556-563
Number of pages	8
Journal	European Journal of Operational Research
Volume	89
Issue number	3
DOIs	https://doi.org/10.1016/0377-2217(95)00051-8
Publication status	Published - 1996 Mar 22

Keywords

Facility layout
Neural networks
Parallel algorithms
Quadratic assignment problem
Two-dimensional maximum neuron model

ASJC Scopus subject areas

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

Access to Document

10.1016/0377-2217(95)00051-8

Cite this

@article{ed182395b5214a4cbbc4267004904c22,

title = "A neural network approach to facility layout problems",

abstract = "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.",

keywords = "Facility layout, Neural networks, Parallel algorithms, Quadratic assignment problem, Two-dimensional maximum neuron model",

author = "Kazuhiro Tsuchiya and Sunil Bharitkar and Yoshiyasu Takefuji",

note = "Funding Information: This work is partly supported by Fuji Electric Co., Ltd. and TEPCO Science Foundation. The authors are also thankful to Dr. J. Skorin-Kapov for providing data for the larger size problems.",

year = "1996",

month = mar,

day = "22",

doi = "10.1016/0377-2217(95)00051-8",

language = "English",

volume = "89",

pages = "556--563",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - A neural network approach to facility layout problems

AU - Tsuchiya, Kazuhiro

AU - Bharitkar, Sunil

AU - Takefuji, Yoshiyasu

N1 - Funding Information: This work is partly supported by Fuji Electric Co., Ltd. and TEPCO Science Foundation. The authors are also thankful to Dr. J. Skorin-Kapov for providing data for the larger size problems.

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

SN - 0377-2217

VL - 89

SP - 556

EP - 563

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

A neural network approach to facility layout problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this