A neural network approach to facility layout problems
DOI10.1016/0377-2217(95)00051-8zbMath0915.90179OpenAlexW2081689975MaRDI QIDQ1266731
Yoshiyasu Takefuji, Kazuhiro Tsuchiya, Sunil Bharitkar
Publication date: 5 July 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00051-8
quadratic assignmentNP-completefacility layoutartificial two-dimensional maximum neural networknear-optimum parallel algorithm
Integer programming (90C10) Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Discrete location and assignment (90B80) Parallel numerical computation (65Y05)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- ``Neural computation of decisions in optimization problems
- The facility layout problem
- An artificial maximum neural network: A winner-take-all neuron model forcing the state of the system in a solution domain
- Recent models and techniques for solving the layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- A heuristic for quadratic Boolean programs with applications to quadratic assignment problems
- Assignment Problems and the Location of Economic Activities
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Tabu Search Applied to the Quadratic Assignment Problem
- P-Complete Approximation Problems
- An exact branch-and-bound procedure for the quadratic-assignment problem
- Tree-search algorithms for quadratic assignment problems
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
This page was built for publication: A neural network approach to facility layout problems