Solving Facility Layout Problem Using an Improved Genetic Algorithm(Numerical Analysis and Optimization)
スポンサーリンク
概要
- 論文の詳細を見る
The facility layout problem is one of the most fundamental quadratic assignment problems in operations research. In this paper, we present an improved genetic algorithm for solving the facility layout problem. In our computational model, we propose several improvements to the basic genetic procedures including conditional crossover and mutation. The performance of the proposed method is evaluated on some benchmark problems. Computational results showed that the improved genetic algorithm is capable of producing high-quality solutions.
- 社団法人電子情報通信学会の論文
- 2005-02-01
著者
-
OKAZAKI Kozo
Faculty of Engineering, University of Fukui
-
Wang Rong
Faculty Of Engineering University Of Fukui
-
Wang Rong
Faculty Of Engineering Fukui University
-
Okazaki Kozo
Faculty Of Engineering University Of Fukui
関連論文
- Ant Colony Optimization with Genetic Operation and Its Application to Traveling Salesman Problem
- A Fast and Reliable Approach to TSP using Positively Self-feedbacked Hopfield Networks
- Antioxidative Activity of (-)-Epigallocatechin-3-(3"-O-methyl) gallate Isolated from Fresh Tea Leaf and Preliminary Results on Its Biological Activity
- Ant Colony Optimization with Genetic Operation and Its Application to Traveling Salesman Problem
- A Genetic Algorithm with Conditional Crossover and Mutation Operators and Its Application to Combinatorial Optimization Problems(Neural Networks and Bioengineering)
- Learning Method of Hopfield Neural Network and Its Application to Traveling Salesman Problem (特集:論文誌C発刊30周年記念)
- Solving the Graph Planarization Problem Using an Improved Genetic Algorithm(Numerical Analysis and Optimization)
- An Efficient Algorithm for Minimum Vertex Cover Problem
- A Parallel Graph Planarization Algorithm Using Gradient Ascent Learning of Hopfield Network
- An Efficient Algorithm for Maximum Clique Problem Using Improved Hopfield Neural Network
- A Saturation Computation Method of Artificial Binary Neural Networks for Combinatorial Optimization Problems
- A Hopfield Network Learning Algorithm for Graph Planarization
- A Hill-Shift Learning Algorithm of Hopfield Network for Bipartite Subgraph Problem(Neural Networks and Bioengineering)
- Solving the Bipartite Subgraph Problem Using Genetic Algorithm with Conditional Genetic Operators
- Solving Facility Layout Problem Using an Improved Genetic Algorithm(Numerical Analysis and Optimization)