Finding optimum facility’s layout by developed simulated annealing algorithm
The Quadratic Assignment Problem (QAP) is one of the problems of combinatorial optimization belonging to the NP-hard problems’ class and has a wide application in the placement of facilities. Thus far, many efforts have been made to solve this problem and countless algorithms have been developed to...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ayandegan Institute of Higher Education,
2020-06-01
|
| Series: | International Journal of Research in Industrial Engineering |
| Subjects: | |
| Online Access: | http://www.riejournal.com/article_107113_fd32d15dc611b92c9a317dd6dbdda604.pdf |
| _version_ | 1819144323236626432 |
|---|---|
| author | H. Jafari M. Ehsanifar A. Sheykhan |
| author_facet | H. Jafari M. Ehsanifar A. Sheykhan |
| author_sort | H. Jafari |
| collection | DOAJ |
| description | The Quadratic Assignment Problem (QAP) is one of the problems of combinatorial optimization belonging to the NP-hard problems’ class and has a wide application in the placement of facilities. Thus far, many efforts have been made to solve this problem and countless algorithms have been developed to achieve the optimal solutions; one of which is the Simulated Annealing (SA) algorithm. This paper aims at finding a suitable layout for the facilities of an industrial workshop by using a Developed Simulated Annealing (DSA) method. |
| first_indexed | 2024-12-22T12:40:18Z |
| format | Article |
| id | doaj.art-204cdca70c6a4c75bb4a3496fad8e3a3 |
| institution | Directory Open Access Journal |
| issn | 2783-1337 2717-2937 |
| language | English |
| last_indexed | 2024-12-22T12:40:18Z |
| publishDate | 2020-06-01 |
| publisher | Ayandegan Institute of Higher Education, |
| record_format | Article |
| series | International Journal of Research in Industrial Engineering |
| spelling | doaj.art-204cdca70c6a4c75bb4a3496fad8e3a32022-12-21T18:25:26ZengAyandegan Institute of Higher Education,International Journal of Research in Industrial Engineering2783-13372717-29372020-06-019217218210.22105/riej.2020.218913.1119107113Finding optimum facility’s layout by developed simulated annealing algorithmH. Jafari0M. Ehsanifar1A. Sheykhan2Young Researchers and Elite Club, Arak Branch, Islamic Azad Univercity, Arak, Iran.Department of Industrial Engineering, Islamic Azad University of Arak, Arak, Iran.Department of Industrial Engineering, Islamic Azad University of Arak, Arak, Iran.The Quadratic Assignment Problem (QAP) is one of the problems of combinatorial optimization belonging to the NP-hard problems’ class and has a wide application in the placement of facilities. Thus far, many efforts have been made to solve this problem and countless algorithms have been developed to achieve the optimal solutions; one of which is the Simulated Annealing (SA) algorithm. This paper aims at finding a suitable layout for the facilities of an industrial workshop by using a Developed Simulated Annealing (DSA) method.http://www.riejournal.com/article_107113_fd32d15dc611b92c9a317dd6dbdda604.pdfsimulated annealingmeta-heuristicfacility layout problem(flp)dsa method |
| spellingShingle | H. Jafari M. Ehsanifar A. Sheykhan Finding optimum facility’s layout by developed simulated annealing algorithm International Journal of Research in Industrial Engineering simulated annealing meta-heuristic facility layout problem(flp) dsa method |
| title | Finding optimum facility’s layout by developed simulated annealing algorithm |
| title_full | Finding optimum facility’s layout by developed simulated annealing algorithm |
| title_fullStr | Finding optimum facility’s layout by developed simulated annealing algorithm |
| title_full_unstemmed | Finding optimum facility’s layout by developed simulated annealing algorithm |
| title_short | Finding optimum facility’s layout by developed simulated annealing algorithm |
| title_sort | finding optimum facility s layout by developed simulated annealing algorithm |
| topic | simulated annealing meta-heuristic facility layout problem(flp) dsa method |
| url | http://www.riejournal.com/article_107113_fd32d15dc611b92c9a317dd6dbdda604.pdf |
| work_keys_str_mv | AT hjafari findingoptimumfacilityslayoutbydevelopedsimulatedannealingalgorithm AT mehsanifar findingoptimumfacilityslayoutbydevelopedsimulatedannealingalgorithm AT asheykhan findingoptimumfacilityslayoutbydevelopedsimulatedannealingalgorithm |