Multiobjective capacitated plant location problem (Q969381)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiobjective capacitated plant location problem |
scientific article; zbMATH DE number 5705060
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiobjective capacitated plant location problem |
scientific article; zbMATH DE number 5705060 |
Statements
Multiobjective capacitated plant location problem (English)
0 references
7 May 2010
0 references
Summary: Multicriteria decision-making is a field which is expanding rapidly. There has been increasing recognition that there is a practical need to explicitly consider several criteria simultaneously. It has been observed that most of the problems on facility location are in reality multicriteria problems. E. Fernandez and J. Presto (2003) have discussed the multiobjective uncapacitated plant location problem. In practice, facilities may have constraining capacities on the amount of demand they can serve. To bridge this gap between theory and practice, we have considered the multiobjective capacitated plant location problem. The multiobjective plant location problem is decomposed into two sub-problems. The allocation of plants to the clients when the capacities are restricted has been discussed in detail. Two algorithms are presented to solve the allocation problem. The method used in [loc. cit.] has been modified to solve this problem. It is illustrated with the help of examples.
0 references
capacitated plant location
0 references
multiobjective plant location
0 references
optimisation
0 references
multicriteria decision making
0 references
MCDM
0 references
0.9592154
0 references
0.9330554
0 references
0.93089926
0 references
0.9172373
0 references
0.9103178
0 references
0 references
0.8984027
0 references
0.8979712
0 references
0.8943405
0 references