A neural network approach to facility layout problems

Kazuhiro Tsuchiya, Sunil Bharitkar, Yoshiyasu Takefuji

Research output: Contribution to journalArticle

40 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 languageEnglish
Pages (from-to)556-563
Number of pages8
JournalEuropean Journal of Operational Research
Volume89
Issue number3
DOIs
Publication statusPublished - 1996 Mar 22

Fingerprint

Facility Layout
layout
neural network
Neural Networks
Neural networks
Operations research
Parallel algorithms
Neurons
Computational complexity
Quadratic Assignment Problem
Operations Research
operations research
Parallel Algorithms
Facility layout
Neuron
NP-complete problem
Benchmark
Minimise
Costs
costs

Keywords

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

ASJC Scopus subject areas

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

Cite this

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

In: European Journal of Operational Research, Vol. 89, No. 3, 22.03.1996, p. 556-563.

Research output: Contribution to journalArticle

Tsuchiya, Kazuhiro ; Bharitkar, Sunil ; Takefuji, Yoshiyasu. / A neural network approach to facility layout problems. In: European Journal of Operational Research. 1996 ; Vol. 89, No. 3. pp. 556-563.
@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",
year = "1996",
month = "3",
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

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 -