This paper presents an algorithm to get a solution of the facility layout problem for multiple-Β―oors. In a number of previous research, these problems are formulated as a combinatorial optimization problem to minimize only the cost owing to material Β―ow between departments ignoring the utilization o
β¦ LIBER β¦
A genetic algorithm with the heuristic procedure to solve the multi-line layout problem
β Scribed by Amir Sadrzadeh
- Book ID
- 113536781
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 569 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0360-8352
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Heuristic algorithm to solve the multi-f
β
Kenichiro Matsuzaki; Takashi Irohara; Kazuho Yoshimoto
π
Article
π
1999
π
Elsevier Science
π
English
β 231 KB
A heuristic algorithm to solve the task
β
He Yan-xiang; Chen Xin-mong; Donald H. Cooley; Zhang Jian-ping
π
Article
π
1999
π
Wuhan University
π
English
β 276 KB
A genetic algorithm based heuristic to t
β
N. Jawahar; N. Balaji
π
Article
π
2012
π
Elsevier Science
π
English
β 979 KB
Genetic algorithm using a modified backw
β
Kazi Shah Nawaz Ripon; Kyrre Glette; Dirk Koch; Mats Hovin; Jim Torresen
π
Article
π
2011
π
SP Versita
π
English
β 309 KB
Genetic algorithm using a modified backw
β
Kazi Shah Nawaz Ripon; Kyrre Glette; Dirk Koch; Mats Hovin; Jim Torresen
π
Article
π
2011
π
SP Versita
π
English
β 309 KB
## Abstract Layout planning in a manufacturing company is an important economical consideration. In the past, research examining the facility layout problem (FLP) generally concerned static cases, where the material flows between facilities in the layout have been assumed to be invariant over time.
A genetic algorithm to solve the general
β
N. Dellaert; J. Jeunet; N. Jonard
π
Article
π
2000
π
Elsevier Science
π
English
β 424 KB