A parallel genetic algorithm for the geometrically constrained site layout problem
Parallel genetic algorithms techniques have been used in a variety of computer engineering and science areas. This paper presents a parallel genetic algorithm to solve the geometrically constrained site layout problem that involves coordinating the use of limited space to accommodate temporary facil...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | conferenceObject |
| منشور في: |
2018
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/8629 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://s3.amazonaws.com/academia.edu.documents/45671627/A_Parallel_Genetic_Algorithm_for_the_Geo20160516-692-t5zqpx.pdf?AWSAccessKeyId=AKIAIWOWYYGZ2Y53UL3A&Expires=1539592716&Signature=e%2FrM8bu%2FfYYAdyOplgDXdIi6ioU%3D&response-content-disposition=inline%3B%20filename%3DA_Parallel_Genetic_Algorithm_for_the_Geo.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Parallel genetic algorithms techniques have been used in a variety of computer engineering and science areas. This paper presents a parallel genetic algorithm to solve the geometrically constrained site layout problem that involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. The algorithm is parallelized based on a message passing architecture using parallel search and chromosomes migration. The algorithm is tested on a variety of layout problems to illustrate its performance and many favorable results are reported. |
|---|