A simulated annealing heuristic for the facility location problem (Q2446764)
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 6287091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simulated annealing heuristic for the facility location problem |
scientific article; zbMATH DE number 6287091 |
Statements
A simulated annealing heuristic for the facility location problem (English)
0 references
22 April 2014
0 references
Summary: A facility location problem (FLP) is considered by the possibility of duplications for each machine type in the presence of alternative processing routes for each product. The objective of this study is to minimise the total distance that is travelled by the products. According to the NP-hardness of the problem, a simulated annealing (SA) is proposed to solve the FLP. Considering two kinds of mutation operator in generating neighbourhood solution makes the SA as an efficient approach to solve large size FLP problems.
0 references
facility location problem
0 references
FLP
0 references
simulated annealing
0 references
duplication
0 references
alternative processing routes
0 references
mathematical modelling
0 references
numerical optimisation
0 references
0.8395651578903198
0 references
0.7982019782066345
0 references
0.796169638633728
0 references
0.7938069105148315
0 references
0.7889121174812317
0 references
