Comparison of two modified meta-heuristic soft algorithms for solving a bi-objective facility layout problem (Q2214209)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7282823
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison of two modified meta-heuristic soft algorithms for solving a bi-objective facility layout problem |
scientific article; zbMATH DE number 7282823 |
Statements
Comparison of two modified meta-heuristic soft algorithms for solving a bi-objective facility layout problem (English)
0 references
7 December 2020
0 references
Summary: Facility layout problem (FLP) is one of the most important location analysis problems in operation research and computational geometry. This paper presents a novel optimisation model-based two meta-heuristics of particle swarm optimisation (PSO) and parallel simulated annealing (SA). Then, the problem is solved using the modified algorithms to determine the total material handling cost and dead space. The results obtained from the two proposed models are then compared and analysed by referring to two well-known previous approaches to find the optimal solution for the problem. The obtained results show that the modified PSO and SA algorithms outperform the previous two methods and therefore can be effectively as an optimal solution for certain bi-objective facility layout problems.
0 references
facility layout
0 references
meta-heuristic
0 references
particle swarm optimisation
0 references
PSO
0 references
facility layout problem
0 references
FLP
0 references
simulated annealing
0 references
SA
0 references
0.8145433664321899
0 references
0.7911142110824585
0 references
0.7811589241027832
0 references
0.7747208476066589
0 references
0.7739182114601135
0 references